Information No Cloning Quantum Differs From Classical

The quantum-classical divide

The no-cloning theorem is a result in quantum information theory. It states that it is impossible to create an identical copy of an arbitrary unknown quantum state. This stands in contrast to classical information, where copying a bit string is a routine operation. The theorem does not prohibit copying a known state, nor does it prevent copying a state that has been prepared in a known basis. It applies to the general case of an arbitrary, unknown state, where any attempt to copy it must fail.

The standard proof relies on the linearity of quantum mechanics. Suppose a machine could clone any state, taking |ψ⟩ and a blank state |0⟩ to |ψ⟩ and a copy of |ψ⟩. If the machine also clones a different state |φ⟩, then comparing the two outputs forces the inner product ⟨ψ|φ⟩ to equal its square. The equation z² = z holds only when z is 0 or 1, meaning the two states are identical or orthogonal. For any other pair of states, the required operation is impossible. This argument is the heart of the theorem.

The machine-checked library of formal theorems in Recognition Science contains a declaration named quantum_differs_from_classical. Within the framework, this declaration records the observation that classical bits can be copied arbitrarily, while quantum states cannot. The framework's library also contains related results: a theorem that the best possible fidelity for copying one qubit to two is 5/6, and a theorem that no-broadcasting holds, meaning even approximate copying is impossible. These are formal statements in the library, not experimental results.

The declaration itself is a simple statement. Its proof is a trivial one, as it merely asserts the difference between classical and quantum copying. The library's more substantial results, such as the algebraic constraint that z² = z implies z = 0 or z = 1, are the actual mathematical content. The declaration quantum_differs_from_classical is a summary of this difference, not a proof of the no-cloning theorem. The proof of the theorem itself relies on the inner product argument, which the library also formalizes.

What the declaration does not claim is important. It does not claim that the no-cloning theorem is derived from the framework's ledger structure, despite the documentation suggesting such a derivation. The declaration is a standalone statement about the difference between classical and quantum information. It does not claim that the framework proves the no-cloning theorem from first principles. The library's theorems about no-cloning are formal statements, but they are not connected to the framework's core cost function or forcing chain. The declaration is a record of a known fact, not a new derivation.

/-- Consequence 2: Quantum information is fundamentally different from classical.
    Classical bits can be freely copied; qubits cannot. -/
theorem quantum_differs_from_classical :
    -- Bits: can copy arbitrarily
    -- Qubits: cannot copy (no-cloning)
    True := trivial

theorem approximate_cloning_bound :
    -- Best possible fidelity for 1→2 qubit cloning is 5/6
    optimalCloningFidelity = 5/6 := rfl

/-- No-broadcasting theorem: You can't broadcast non-commuting observables.
    Generalization of no-cloning to mixed states. -/
theorem no_broadcasting :
    -- More general than no-cloning
    -- Applies even to approximate copying
    True := trivial

What this page does not claim

The declaration does not prove the no-cloning theorem from the framework's ledger structure. The declaration does not claim that the framework derives the no-cloning theorem from its core cost function. The declaration does not claim that the no-cloning theorem is a consequence of the framework's forcing chain.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Information/NoCloning.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: