DeepPractise
DeepPractise

No-Cloning Theorem

Track: Foundations · Difficulty: Beginner · Est: 12 min

No-Cloning Theorem

Overview

In classical computing, copying information is trivial: you can duplicate a bit perfectly.

In quantum computing, there is a fundamental limitation: you cannot perfectly copy an arbitrary unknown quantum state. This is the no-cloning theorem.

This page states the theorem, gives a clean contradiction proof (based on inner products), and explains practical consequences—without using circuits or gate matrices.

Intuition

A qubit state is not a label you can read out directly. If you try to learn “what the state is” by measuring, you generally disturb it.

Cloning would allow a loophole: if you could copy an unknown state, you could make many copies and measure them in many different bases to reconstruct the state without limitation. Quantum theory does not allow that.

The intuition is not “quantum is mysterious.” The intuition is that quantum states contain continuous information (amplitudes and phases) that cannot be extracted and duplicated perfectly by a physical process that must work for all possible inputs.

Formal Description

Statement (no-cloning theorem). There is no single physical operation that takes an arbitrary unknown state ψ|\psi\rangle and a fixed blank state 0|0\rangle and outputs two copies ψψ|\psi\rangle\otimes|\psi\rangle for every input ψ|\psi\rangle.

We will prove this by contradiction using a basic property of valid quantum evolution:

  • any allowed evolution preserves inner products between states.

Assume there exists an operation UU that clones every state:

U(ψ0)=ψψfor all ψ.U\,(|\psi\rangle\otimes|0\rangle) = |\psi\rangle\otimes|\psi\rangle \quad\text{for all }|\psi\rangle.

Now pick two (possibly non-orthogonal) states ψ|\psi\rangle and ϕ|\phi\rangle. Take the inner product of the two input states:

ψϕ00=ψϕ.\langle\psi|\phi\rangle\,\langle 0|0\rangle = \langle\psi|\phi\rangle.

After applying UU, inner products must be preserved, so this must equal the inner product of the two outputs:

ψϕψϕ=(ψϕ)2.\langle\psi|\phi\rangle\cdot\langle\psi|\phi\rangle = (\langle\psi|\phi\rangle)^2.

Therefore,

ψϕ=(ψϕ)2.\langle\psi|\phi\rangle = (\langle\psi|\phi\rangle)^2.

The only complex numbers xx satisfying x=x2x=x^2 are x=0x=0 and x=1x=1.

So the only pairs of states that could be cloned by the same universal cloner are those with overlap 0 (orthogonal states) or 1 (identical states). Since most pairs of quantum states have overlap strictly between 0 and 1, a universal perfect cloner cannot exist.

This proves the no-cloning theorem.

Worked Example

Consider 0|0\rangle and +|+\rangle, where

+=12(0+1).|+\rangle = \tfrac{1}{\sqrt{2}}(|0\rangle+|1\rangle).

Their overlap is

0+=12.\langle 0|+\rangle = \tfrac{1}{\sqrt{2}}.

If a universal cloner existed, the argument above would require

12=(12)2=12,\tfrac{1}{\sqrt{2}} = \left(\tfrac{1}{\sqrt{2}}\right)^2 = \tfrac{1}{2},

which is false. Therefore, no operation can clone both 0|0\rangle and +|+\rangle perfectly while also cloning every other possible state.

Turtle Tip

Turtle Tip

The no-cloning theorem does not say “you can never copy anything.” It says you can’t build one machine that perfectly copies every possible unknown input state. Orthogonal states can be copied because they can be distinguished without ambiguity.

Common Pitfalls

Common Pitfalls

Don’t confuse “unknown state” with “random state.” Even if the state is fixed and perfectly well-defined, if you don’t know which state it is, you still cannot clone it universally.

Also, avoid thinking no-cloning is about technology limitations. It is a mathematical consequence of how quantum states and valid evolutions behave.

Quick Check

Quick Check
  1. In the proof, where did we use the fact that allowed evolution preserves inner products?
  2. Why do orthogonal states not contradict the no-cloning theorem?

What’s Next

You now have the core multi-qubit concepts: tensor products, entanglement, Bell states, reduced descriptions, and the no-cloning limitation. Next we can start building computational tools on top of these ideas—first by introducing single-qubit transformations more formally, and then by moving toward circuits.