English static mirror for SEO/GEO · AI-assisted translation · Read Chinese original

No-Cloning: The Common Starting Point of Quantum Banknotes and Quantum Cryptography

Forum topic · 小凯 · 2026-11-07

Summary

This tutorial article (episode 028 of a quantum computing series) explains the no-cloning theorem and its consequences. It presents a five-step proof by contradiction that no machine can copy an arbitrary unknown quantum state: while CNOT can copy computational basis states like |0⟩ and |1⟩, linearity of quantum mechanics forces a machine promised to copy the superposition |+⟩ to produce a four-term product state, whereas the actual evolution produces the entangled Bell state (|00⟩+|11⟩)/√2 — a contradiction. The article delineates the exceptions that do not violate the theorem: copying known states (with the right basis), teleportation that destroys the original, and re-preparing fresh instances. Two applications are examined: quantum banknotes, whose secret-basis quantum states make counterfeiting physically impossible rather than merely hard (though portable quantum storage remains unrealized; quantum key distribution is the practical descendant), and quantum circuits, where the absence of a COPY instruction explains why reversible computation and quantum error correction must spread information across entanglement rather than store backup copies.

Prerequisites: Episodes 014 (linearity rules), 017 (measurement axes), 019 (invisible ink), 022 (CNOT is not a photocopier). Next episode: 029, "True Randomness: The Quantum World's Only Dice Roll."

No-Cloning: The Common Starting Point of Quantum Banknotes and Quantum Cryptography

*(An introductory SVG banner illustrates two quantum coins with a "copying forbidden" sign.)*

Why are genuine banknotes hard to forge? Look at their anti-counterfeiting features: watermarks, fluorescent fibers, the tactile feel of intaglio printing... The common thread is that the manufacturer controls a secret process that counterfeiters cannot replicate. But note the wording carefully: classical anti-counterfeiting is only "very hard to copy" — secrets eventually leak, printing technology keeps advancing, and defense versus forgery is an endless engineering race.

In the 1960s, someone proposed a far more radical idea: replace the watermark with a quantum state itself. Each banknote would carry a string of special qubits, prepared by the bank along "axes" only it knows. For such a banknote, counterfeiting would no longer be "very hard" — it would be:

> Physically impossible. Because the quantum world has an iron rule: no process exists that can copy an arbitrary unknown quantum state. This is the no-cloning theorem, the star of this episode.

The theorem itself takes five steps to prove, using only the tools you already have; but its two applications — the safety lock of quantum banknotes and the root of quantum cryptography — deserve to be examined one by one.

A Five-Step Proof That No Photocopier Exists

Episode 022 left evidence at the scene: CNOT acts like a copier on basis states (|10⟩→|11⟩), but on superpositions it produces entanglement, not copies. Now let's upgrade that observation into a theorem — by contradiction.

Step 1. Assume a "quantum photocopier" really exists: a machine that takes in "unknown state + blank paper" and outputs "two identical states." In mathematical notation: U(|ψ⟩|0⟩) = |ψ⟩|ψ⟩, holding for any unknown state |ψ⟩.

Step 2. First, satisfy the two basic customers: |0⟩ and |1⟩ must be copiable — U(|0⟩|0⟩)=|0⟩|0⟩, U(|1⟩|0⟩)=|1⟩|1⟩. CNOT can do this (episode 022); nothing remarkable here.

Step 3. Now a superposition customer arrives: |+⟩ = (|0⟩+|1⟩)/√2 (the equator point from episode 017). The copier promises U(|+⟩|0⟩) = |+⟩|+⟩. Expand the promise: |+⟩|+⟩ spreads into a 2×2 grid — (|00⟩+|01⟩+|10⟩+|11⟩), each term with weight 1/4. All four cells light up.

Step 4. Actually compute it using the linearity rule of quantum mechanics (episode 014: the table applies row by row to superpositions): the input is an equal superposition of |0⟩|0⟩ and |1⟩|0⟩. U acts on each row separately — the first row yields |00⟩, the second yields |11⟩, combining into (|00⟩+|11⟩)/√2 — that entangled state from episode 022. Only two cells light up; cells 01 and 10 stay permanently dark.

Step 5. Reconcile the books: Step 3 requires all four cells lit; Step 4 allows only two. Same input, same machine, yet the two requirements demand two different outputs — contradiction. The assumption fails; the copier does not exist.

The pathology is plainly visible: copying demands "a custom action for each state," while quantum mechanics' linearity demands "one table governs all states" — the two cannot coexist. Basis states sit exactly in the intersection of both requirements (which is why episode 022's "looks like copying" wasn't wrong); as soon as superpositions enter, the crack tears open.

The Boundary of Exceptions: What Can Be Copied and What Cannot

The theorem's wording must be precise — it forbids copying "arbitrary unknown states." Three kinds of "copying" do not violate it, each occupying a safe zone:

Known states can be copied. Episode 017 taught that a state's content is basis-relative — if you know which axis the state was prepared along, you can measure in the right basis and re-prepare it (exactly the bank's banknote-making process at the start of this episode). The theorem blocks "photocopying without reading the manual."

"Copying while destroying the original" doesn't count as copying. Episode 025's teleportation rebuilds the original state at Bob's location, but the original at Alice's side already collapsed upon measurement — at any moment, only one copy exists in the world; the ledger balances. Teleportation is "moving house," not "photocopying."

Producing multiple identical states doesn't count either. A bank can make ten thousand banknotes, preparing the same state ten thousand times — each is a fresh preparation, not a copy of an existing one. What is forbidden is making copies of the one unknown state in your hands.

Safety Lock One: Why Quantum Banknotes Are Foolproof

Back to the opening idea — now we can see how the anti-counterfeiting works. The quantum states in the banknote are prepared along secret axes (they are *known* states to the bank, so the bank can both make and verify them). A counterfeiter doesn't know the axes, and the geometry of episodes 017/019 sits right there: measuring along the wrong axis yields uniform randomness — you not only fail to read the content, you also scramble the original state (episode 019's invisible ink: under the wrong basis, only white porridge — plus the fingerprint of disturbance). Want to copy without disturbing? The no-cloning theorem has welded that door shut.

Every attempt at verification or forgery leaves statistically irremovable traces — anti-counterfeiting upgrades for the first time from an "engineering race" to a "physical law."

An honest boundary (as of November 2026): quantum banknotes require carrying and preserving quantum states on your person, and such "portable quantum memory" still has no practical implementation — it remains a thought treasure. What has truly deployed at scale is its twin brother — quantum key distribution: replacing "anti-counterfeiting" with "anti-eavesdropping," same root principle (eavesdroppers leave traces by measuring, and copying is against the rules). Combined with episode 029's true randomness, it forms the complete foundation of quantum cryptography (developed head-on in episode 063 of batch eight).

Safety Lock Two: Quantum Circuits Have No COPY Key

The theorem also has an engineering face. A classical programmer's daily bread is "copy memory" — variable assignment is copying. In quantum circuits there is no such instruction: try to "back up" a superposition, and the no-cloning theorem says no.

This explains two things seen earlier: why episode 018 rewrote classical logic into reversible circuits by "adding garbage bits" (if you can't copy, don't throw away — route around it); and what's coming in batch six — why quantum error correction cannot "store three backup copies": the classical backup route is sealed by the theorem, so error-correcting codes can only take the strange path of "spreading information into entanglement" (the "information relocation" foreshadowed by consequence three in episode 018) — one of quantum engineering's most ingenious inventions. See you in batch six.

Dismantling the Analogy

Where the banknote analogy falls short:

  • Disanalogy one: classical banknote verification is non-destructive — shine a lamp, look at the watermark, the note is untouched; quantum banknote verification is consumptive: measurement collapses, and each verification consumes the note (the bank verifies by "sampling," and a verified note is voided).
  • Disanalogy two: a watermark is an objective pattern printed on paper, present at all times; a quantum state's "content" is basis-relative (episode 017) — unmeasured, it isn't *any* definite thing. The defense isn't just against "peeking at the pattern"; the very act of "peeking" changes the object.

Luggage to Take Home

1. The no-cloning theorem: no process can copy an arbitrary unknown state; a five-step proof by contradiction — linearity (one table for all states) is incompatible with custom-tailored copying; basis states merely *look* like copies by coincidence. 2. Safe zones: copying in a known basis is fine, teleportation-style "moving" is fine, re-preparation is fine — only the "copy key for unknown states" is forbidden. 3. Two safety locks: quantum banknotes/cryptography (eavesdropping always leaves traces; anti-counterfeiting becomes physical law; the deployed version is quantum key distribution in batch eight) and no COPY key in quantum circuits (reversible computation detours around it; error correction cannot store copies — batch six's "spread into entanglement" is the ingenious contrivance forced by the theorem).

A hook for the next stop: anti-counterfeiting, cryptography, and error correction all block on "can't copy" — but where the quantum world is truly generous is "randomness." Classical dice are all "chaotic determinism"; quantum dice are rolled by the universe itself. Next: 029, "True Randomness: The Quantum World's Only Dice Roll."

Hashtags: quantum computing · from coins to error correction · no-cloning · quantum cryptography.

Tags

#quantum-computing#no-cloning-theorem#quantum-cryptography#quantum-money#quantum-key-distribution#quantum-error-correction#cnot#tutorial

This page is an English static mirror generated for search and AI citation. It may be a full translation or structured summary of the Chinese original. Canonical interactive discussion lives on the Chinese page: https://zhichai.net/topic/178636862