Symptom

You have spent this whole part learning that information wants to be copied. Entropy bounds compression (T018), Huffman hits the bound (T020), redundancy buys error correction (T021). Every result so far treats “make another copy” as the free operation — the thing you do without thinking, the reason cp has no interesting failure modes.

Then you write your first quantum program and the compiler rejects a line that looks completely ordinary. You wanted to save a qubit’s state before a measurement so you could check your work. There is no instruction for it. Not a slow one, not an approximate one. The operation does not exist.

The instinct is that this is an engineering gap — quantum hardware is young, someone will build a qubit copier eventually. It is not a gap. And the reason matters far beyond quantum computing, because if you could copy an unknown quantum state, you could signal faster than light, and the theorem is what stands between quantum mechanics and a contradiction with relativity.

Statement

There is no unitary operation that copies an arbitrary unknown quantum state.

There is no unitary $U$ such that for all states $\lvert\psi\rangle$,

$$U \big( \lvert\psi\rangle \otimes \lvert 0 \rangle \big) = \lvert\psi\rangle \otimes \lvert\psi\rangle .$$

The quantifier is the whole theorem. Arbitrary and unknown. You can copy a state you already know the description of — just prepare a second one the same way. You can copy states drawn from a known orthogonal set, which is exactly what a classical bit is. What you cannot do is build one device that takes in any state, including ones you have no description of, and emits two.

And the proof is not deep. It is linearity. Quantum evolution is linear, copying is not, and that is the entire conflict.

Argument

Proof one: linearity. Suppose $U$ clones two particular states,

$$U(\lvert\psi\rangle \lvert 0\rangle) = \lvert\psi\rangle\lvert\psi\rangle, \qquad U(\lvert\phi\rangle \lvert 0\rangle) = \lvert\phi\rangle\lvert\phi\rangle .$$

Now feed it the superposition $\lvert\chi\rangle = \alpha\lvert\psi\rangle + \beta\lvert\phi\rangle$. Because $U$ is linear, it must distribute:

$$U(\lvert\chi\rangle\lvert 0\rangle) = \alpha \lvert\psi\rangle\lvert\psi\rangle + \beta \lvert\phi\rangle\lvert\phi\rangle .$$

But cloning $\lvert\chi\rangle$ demands

$$\lvert\chi\rangle\lvert\chi\rangle = \alpha^2 \lvert\psi\rangle\lvert\psi\rangle

  • \alpha\beta \lvert\psi\rangle\lvert\phi\rangle
  • \beta\alpha \lvert\phi\rangle\lvert\psi\rangle
  • \beta^2 \lvert\phi\rangle\lvert\phi\rangle .$$

These agree only when the cross terms vanish and $\alpha^2 = \alpha$, $\beta^2 = \beta$ — that is, only when one of $\alpha,\beta$ is 1 and the other 0. So $U$ clones $\lvert\psi\rangle$ and $\lvert\phi\rangle$ but no genuine superposition of them. $\blacksquare$

Copying is a quadratic operation on amplitudes; unitary evolution is linear. There is nothing more to it than that mismatch.

Proof two: inner products. Unitaries preserve inner products. If $U$ cloned both states, then

$$\langle \psi \vert \phi \rangle = \langle \psi \vert \phi \rangle \cdot \langle \psi \vert \phi \rangle,$$

so $\langle\psi\vert\phi\rangle \in {0, 1}$: the states are either orthogonal or identical. A cloner can therefore only handle a set of mutually orthogonal states — which is precisely a classical alphabet. Classical information is the part of quantum information that happens to be clonable, and that reframing is the one worth keeping.

Why this saves relativity. Entanglement creates correlations that appear instantaneous. Alice and Bob share a Bell pair; Alice measures in one of two bases and Bob’s qubit collapses correspondingly, immediately, at any distance. No signal is sent, because Bob’s outcomes are uniformly random whichever basis Alice chose, and his marginal distribution is identical either way. He learns nothing.

Unless he could clone. Given a million copies of his qubit, Bob could do tomography, determine the state, infer Alice’s basis choice, and read one bit — faster than light, in flat contradiction with causality. Nick Herbert proposed exactly this in 1981, and Wootters, Zurek, and Dieks published no-cloning in 1982 in direct response. The theorem is not a curiosity about qubits; it is the reason quantum mechanics and special relativity coexist.

Where the information actually is. It is worth being precise about what a qubit contains, because the usual “infinite information in one qubit” line makes no-cloning sound like a tragedy. A pure qubit state is a point on the Bloch sphere, specified by two real angles, so it does take infinitely many bits to write down. But Holevo’s theorem says you can extract at most one classical bit from measuring one qubit. The description is continuous and the accessible content is a single bit.

So no-cloning is not withholding a treasure. It is the flip side of the same fact: the reason you cannot copy the state is the reason you cannot read it, and both come from the same place, which is that measurement returns one outcome from a basis you had to choose in advance. A cloner would let you defeat that by measuring each copy in a different basis. The theorem and the measurement postulate are two views of one restriction, and a universe with one but not the other would be inconsistent.

Forbids

Copying an unknown qubit, exactly, ever, by any means.

Perfect quantum error correction by naive redundancy. The classical repetition code — store it three times, take a majority — is not available, and this shaped the entire field. Quantum error correction had to be invented differently: Shor’s nine-qubit code spreads one logical qubit’s information across entanglement among nine physical qubits without ever copying it, and syndrome measurement extracts error information without measuring the data.

Backing up a quantum state, saving it before a risky operation, or checkpointing a quantum computation. Every debugging technique that relies on inspecting intermediate state is unavailable. This is a genuine reason quantum programming is hard, not an incidental tooling gap.

Signalling faster than light using entanglement. The theorem closes the loophole directly, and every subsequent proposal for FTL signalling with entanglement fails at the same step.

Undetectably eavesdropping on a quantum channel. An eavesdropper cannot copy a qubit in transit and forward the original untouched. She must measure, and measuring in the wrong basis disturbs the state. That disturbance is the detection mechanism, and it is the entire security argument for QKD.

Does not forbid

It does not forbid quantum key distribution being attacked, and “no-cloning makes QKD unbreakable” is the misreading this post exists to kill. The theorem protects the channel, not the endpoints. Every practical QKD break has been an implementation attack: Vadim Makarov’s group blinded commercial ID Quantique and MagiQ detectors with bright laser light, turning single-photon detectors into classical ones and reading the entire key undetected. Photon-number splitting exploits attenuated lasers that occasionally emit two identical photons, letting Eve keep one — no cloning required, because the source did the duplication. Trojan-horse attacks probe Alice’s modulator from outside. The physics is sound and the devices are not, and the security proof’s assumptions about the hardware are where the entire attack surface lives.

It does not forbid approximate cloning. The Bužek-Hillery universal cloner produces two copies with fidelity $5/6 \approx 0.833$ for arbitrary qubit inputs, and that is provably optimal. Perfect cloning is impossible; imperfect cloning is a well-characterized resource with a known bound, and quantum cryptanalysis takes it seriously.

It does not forbid teleportation, which is the confusion the name invites. Quantum teleportation moves a state from Alice to Bob using a shared Bell pair plus two classical bits. It does not violate no-cloning because the original is destroyed by Alice’s measurement — it is a move, not a copy, and at no instant do two copies exist. It also does not exceed lightspeed, because the two classical bits travel by ordinary channel and Bob’s state is useless until they arrive.

It does not forbid copying classical information encoded in quantum states. If your bits are encoded in orthogonal basis states and you know the basis, you can measure and re-prepare freely. Every quantum computer’s classical readout does this. No-cloning bites only on genuinely unknown superpositions.

It does not forbid quantum error correction, despite forbidding the obvious approach. Shor, Steane, and surface codes work by encoding logical information in entangled subspaces and measuring syndromes — operators that reveal which error occurred without revealing the encoded state. The threshold theorem says arbitrary-length quantum computation is possible with imperfect components. The field’s founding achievement was routing around this theorem, and it took a decade.

Boundary

The precise scope is narrower than the slogan:

  • Unitary evolution only. Measurement is not unitary, and does destroy states rather than copying them, so it is no loophole.
  • Arbitrary unknown states only. Known states are freely reproducible. Orthogonal sets are freely copyable. The classical world is the copyable subset.
  • Exact copying only. Fidelity up to $5/6$ is achievable, and the exact optimum is known for every input ensemble.
  • Pure states, in the original statement. The mixed-state generalization is the no-broadcasting theorem: a set of mixed states can be broadcast if and only if they commute. Same structure, same conclusion.

There is a companion worth knowing: no-deleting. Given two identical copies of an unknown state, you cannot delete one and leave the other intact. Quantum information can be neither created nor destroyed by local unitary means, only moved. Taken together the two theorems say quantum information is conserved in a way classical information is not, and that conservation is what makes it a genuinely different resource rather than classical bits with extra steps.