No-Cloning & No-Signalling
You cannot copy an unknown quantum state, or use entanglement to signal.
Quantum mechanics is linear, and linearity alone rules out a universal copier. The same structure guarantees that entanglement, for all its instant correlations, can never carry a message. In this lesson you prove both theorems and see why each one needs the other.
What you’ll learn
- Prove the no-cloning theorem from linearity and, more sharply, from the preservation of inner products.
- Characterize exactly which sets of states can be cloned, and build a cloner for the basis.
- Prove the no-signalling theorem for an arbitrary local operation using the partial trace.
- Explain why a perfect cloner would allow superluminal signalling, and place no-cloning among its related no-go theorems.
What a cloner would have to do
Model a would-be copier in full generality. It receives the input system in an unknown state , a blank system in a fixed state , and its own machinery in a fixed state . Closed quantum evolution is unitary, and any physical process, including measurements whose outcomes are later discarded, can be modeled as a unitary on a larger system (Stinespring dilation). So nothing is lost by asking for a single unitary with
The machine may end in a state that depends on the input; this also absorbs any global phase.
Some sets can be cloned. The CNOT clones with blank and no machine at all. Any orthonormal basis can be cloned the same way: rotate it to the computational basis, fan out with CNOTs, and rotate both outputs back. The real question is whether one unitary can clone states that are not orthogonal.
Test this with two copiers: the usual one for the basis, and one you build for the basis.
A unitary clones , and another unitary clones . Which statement is true?
- Applying and then clones all four states
- A cleverly designed unitary with a large enough machine register clones all four
- No unitary clones all four, because and are neither orthogonal nor equal
- The combination clones all four
Show the answer
C. No unitary clones all four, because and are neither orthogonal nor equal
You will prove next that a clonable set must be pairwise orthogonal or identical. Since , no unitary, with any machine, clones both and .
Proof 1: linearity
Suppose clones both basis states. (Leave out the machine for now; Proof 2 puts it back.)
Linearity: the superposition passes through term by term.
What a genuine copy of would be.
Match the and coefficients (even allowing an overall phase on the right): they force . Every genuine superposition is mis-copied.
Worse than mis-copied: for the output is entangled. A basis copier converts superposition into entanglement with the blank, exactly what you saw in the circuit.
The CNOT copier receives . What is the fidelity of each output qubit's reduced state with ?
Show the answer
0.5
The output is , and each half of a Bell pair is maximally mixed: , so . Averaged over all pure inputs, the CNOT copier's single-copy fidelity is the average of , which is . The best possible universal copier reaches , as the Rydberg State lesson on optimal cloning shows.
Proof 2: inner products
Proof 1 assumed the copier works on a whole basis. A stronger statement needs only two states and allows any machine. The tool is the inner product, which every unitary preserves.
Suppose clones two states and .
Take the inner product of the two equations. The left-hand side uses .
Take absolute values. By Cauchy–Schwarz the machine overlap is at most 1.
So the two states are orthogonal or identical up to phase. Conversely, a pairwise-orthogonal set extends to an orthonormal basis, which can be cloned.
Which of these assumptions does the inner-product proof not need?
- That the copier preserves inner products (is unitary on input, blank and machine)
- That it copies both and
- That the blank and the machine start in the same states for both inputs
- That the machine ends in the same state for both inputs
Show the answer
D. That the machine ends in the same state for both inputs
The final machine states , may differ: they enter only through , which is all the proof uses.
No-signalling
Now the other half of the story. Alice and Bob share a state , possibly entangled. Alice does anything to her system: a gate, a measurement, a noisy process. Can Bob, looking only at his own system, tell what she did?
Everything Bob can observe locally is fixed by his reduced density matrix : any measurement he makes, with POVM elements , has outcome probabilities . So the question is whether Alice can change .
Any operation by Alice, including a measurement whose outcome Bob does not know, is described by Kraus operators acting on alone.
The partial trace over is cyclic for operators that act on only.
Completeness. Bob's state is untouched, whatever Alice chose to do.
A concrete case: for , if Alice measures in , Bob's qubit becomes or with probability ½ each; if she measures in , it becomes or . Two different ensembles, one density matrix:
Cloning would break causality
This is exactly where a cloner would break things. If Bob could turn his qubit into perfect copies, Alice's two choices would leave him with
For these differ. Measuring all copies in gives all-equal outcomes for , but for all-equal outcomes occur only with probability . Bob would learn Alice's choice instantly.
| Task | Possible? | Notes |
|---|---|---|
| Clone an unknown pure state | No | No-cloning (1982) |
| Clone states promised to come from an orthogonal set | Yes | Measure and re-prepare, or a CNOT-style unitary |
| Approximately clone every qubit state | Yes | Best symmetric fidelity is , reached by the Bužek–Hillery cloner (1996) |
| Clone exactly but probabilistically, heralding success | Only for linearly independent sets | Probabilistic cloning (Duan–Guo, 1998) |
| Broadcast non-commuting mixed states | No | No-broadcasting (Barnum, Caves, Fuchs, Jozsa & Schumacher, 1996) |
| Delete one of two copies of an unknown state | No | No-deleting (Pati & Braunstein, 2000) |
| Signal using entanglement alone | No | No-signalling |
Key takeaways
- A unitary clones a set of pure states iff they are pairwise orthogonal or equal up to phase. Linearity and inner-product preservation each prove it.
- A basis copier entangles instead of copying: .
- No-signalling: for every local channel , so Alice's choices are invisible to Bob alone.
- A perfect cloner would distinguish ensembles with the same density matrix, which is superluminal signalling. The two no-go theorems protect each other.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
Which set of states can a single unitary (with blank and machine) clone perfectly?
- All states on the equator of the Bloch sphere
Show the answer
D.
and are orthogonal, so a unitary (rotate them to , CNOT, rotate back) clones them. Every other option contains a pair whose overlap is strictly between 0 and 1.
Alice and Bob share . Without telling Bob, Alice either does nothing, applies , or measures in the basis. Bob's reduced density matrix in the three cases is:
- in all three cases
- , , and then or
- , , and
- It depends on how far apart they are
Show the answer
A. in all three cases
Each is a local operation on , so is unchanged. After an measurement Bob's qubit is or , but since he does not know which, his description is the equal mixture, again .
Why can't a large machine register rescue a cloner of and ?
- Large machines decohere too quickly
- The machine would need infinitely many qubits
- The machine overlap only shrinks the right side of , which with is already too small
- The machine would become entangled with Bob
Show the answer
C. The machine overlap only shrinks the right side of , which with is already too small
With , cloning would need : impossible for any machine of any size.
Why would a perfect cloner enable faster-than-light signalling?
- Copies of a qubit would travel faster than the original
- Bob could copy his half of an entangled pair many times and distinguish two ensembles that share the same density matrix
- Cloning creates entanglement, and entanglement acts faster than light
- Alice could clone her classical bits before sending them
Show the answer
B. Bob could copy his half of an entangled pair many times and distinguish two ensembles that share the same density matrix
Alice's basis choice prepares or at Bob's end, both with . Many copies would make the two ensembles distinguishable (), so Bob would learn her choice with no classical message at all.
Which of these does quantum mechanics allow?
- Copying any unknown qubit exactly, with a heralded success probability of ½
- Deleting one of two copies of an unknown state while leaving the other intact
- Using shared entanglement alone to send one bit
- Producing two imperfect copies of an unknown qubit, each with fidelity
Show the answer
D. Producing two imperfect copies of an unknown qubit, each with fidelity
Approximate cloning is allowed: the optimal universal cloner gives each copy fidelity . Exact probabilistic cloning works only for linearly independent sets, deleting is ruled out by the no-deleting theorem, and signalling by no-signalling.
Go deeper
- Optimal Approximate Cloning · The best imperfect copier and the 5/6 fidelity limit.
- Quantum Money & Unclonable Cryptography · From Wiesner's banknotes to modern unclonable primitives.
Further reading
- W. K. Wootters & W. H. Zurek, "A single quantum cannot be cloned", Nature 299, 802 (1982).
- D. Dieks, "Communication by EPR devices", Physics Letters A 92, 271 (1982).
- M. A. Nielsen & I. L. Chuang, Quantum Computation and Quantum Information, §1.3.5 and Box 12.1 (Cambridge, 2010).
- V. Scarani, S. Iblisdir, N. Gisin & A. Acín, "Quantum cloning", Reviews of Modern Physics 77, 1225 (2005).