| no‑cloning theorem | |
|---|---|
| Name | No‑cloning theorem |
| Field | Quantum mechanics |
| Proved by | W. K. Wootters and W. H. Zurek, independently by Dieks, Dennis |
| Year | 1982 |
| Statement | Unknown quantum states cannot be perfectly copied by any physical process |
no‑cloning theorem
The no‑cloning theorem is a fundamental result in Quantum mechanics and Quantum information theory stating that it is impossible to create an identical copy of an arbitrary unknown quantum state. This limitation underpins the security of quantum cryptography and constrains designs in quantum computing and quantum communication by forbidding certain forms of state replication that would be trivial in classical information theory.
The theorem asserts that there is no unitary operation or more general completely positive trace‑preserving map that takes an arbitrary state |ψ⟩ and a fixed blank state |0⟩ to |ψ⟩⊗|ψ⟩ for all possible |ψ⟩ in a Hilbert space. First formulated in rigorous terms in 1982, the result applies across finite and infinite dimensional Hilbert spacees and to pure states and, with modifications, to mixed states described by density matrix formalism. The impossibility is often contrasted with the no‑deleting theorem and the no‑broadcasting theorem, and is central to understanding why quantum states cannot be treated as classical information carriers.
Standard proofs use linearity of quantum mechanics and properties of unitary operators. Suppose a universal cloning machine U exists such that U(|ψ⟩⊗|e⟩)=|ψ⟩⊗|ψ⟩ for any |ψ⟩, where |e⟩ is an ancilla. Linearity implies U acting on superpositions leads to contradictions because inner products are not preserved by copying arbitrary non‑orthogonal states. An alternative formulation uses completely positive maps and shows no trace‑preserving completely positive map can clone non‑commuting density operators. The formalism employs tools from linear algebra (inner product, orthogonality), operator theory (Kraus operators), and the structure of unitary evolution to demonstrate impossibility.
Physically, the theorem reflects that quantum information is not holonomic classical data but encoded in amplitudes and relative phases of a state vector. It enforces trade‑offs such as the Heisenberg uncertainty principle and limits on measurement: a single copy of an unknown state cannot be measured to arbitrary precision without disturbance. Consequences include secure key distribution in Quantum key distribution protocols like BB84 protocol and E91 protocol, and the inability to create perfect backups of quantum data, which impacts notions of quantum error correction and quantum repeaters. It also implies that entanglement cannot be freely redistributed, constraining protocols in quantum teleportation and entanglement swapping.
The no‑cloning theorem applies only to arbitrary unknown states; it allows perfect cloning of orthogonal states and copying when prior information restricts the state to a known set. Approximate cloning machines, such as the Bužek–Hillery quantum cloning machine, and probabilistic cloning protocols achieve imperfect or probabilistic copies and are characterized by optimum fidelity bounds derived from quantum estimation theory. Related no‑go results include the no‑deleting theorem, the no‑broadcasting theorem for mixed states, and restrictions from the monogamy of entanglement. The theorem also informs limits in models of relativistic quantum information and discussions of black hole information paradox where cloning would violate unitarity and causality.
The no‑cloning theorem is foundational to quantum information theory and practical quantum cryptography: it guarantees that eavesdroppers cannot perfectly copy quantum signals without detection, a premise used in implementations by research groups at BBN Technologies, ID Quantique, and in standards development by organizations like NIST. In quantum computing architectures—superconducting qubits (e.g., at IBM Quantum and Google Quantum AI), trapped ions (e.g., IonQ, Honeywell research), and photonic systems—designers must use quantum error correction codes (e.g., Shor code, Surface code) rather than naive duplication. In quantum networks, the theorem motivates use of entanglement distribution, quantum repeaters (proposed in work by H. J. Briegel et al.) and teleportation circuits developed from theory by Bennett, Charles H. and others.
The theorem was independently formulated by W. K. Wootters and W. H. Zurek and by Dennis Dieks in 1982. Early antecedents include insights from Werner Heisenberg and the development of quantum measurement theory in the 20th century. Subsequent key contributors expanded its implications: Vlatko Vedral and Asher Peres clarified information‑theoretic contexts; Vladimír Bužek and Mark Hillery introduced approximate cloners; Charles H. Bennett, Gilles Brassard, and Artur Ekert connected the theorem to cryptographic protocols. Institutional work at Bell Labs, Los Alamos National Laboratory, and universities such as Harvard University, University of Oxford, MIT, and Caltech advanced both theory and experiment, while conferences like Quantum Information Processing (QIP) and publications in Physical Review Letters disseminated results.
Category:Quantum information theory Category:Theorems in quantum mechanics