The No-Cloning Theorem and Why It Holds
The no-cloning theorem, proved by Wootters, Zurek and Dieks in 1982, forbids copying an unknown quantum state. The proof and its consequences.
The no-cloning theorem, proved by Wootters, Zurek and Dieks in 1982, forbids copying an unknown quantum state. The proof and its consequences.
Perfect cloning is impossible, but approximate quantum cloning machines can make imperfect copies. Types, fidelity limits and experiments.
Quantum state merging transfers one party’s share of a state to another, and its cost can be negative, meaning entanglement is gained.
Superdense coding, proposed by Bennett and Wiesner in 1992, sends two classical bits with one qubit using a shared entangled pair. How it works.
The entanglement of formation is the minimum entanglement needed to create a given state. Its definition, formulas for two qubits and uses.
Quantum discord captures non-classical correlations that can exist even without entanglement. Its definition, measurement and possible uses.
The Holevo bound, proved by Alexander Holevo in 1973, limits how much classical information can be read from qubits. Its statement and consequences.
Quantum multi-party computation lets several parties compute jointly on private data using quantum resources. Protocols, security and scaling.
Quantum information splitting distributes a quantum state among parties so that they must cooperate to recover it. Protocols and uses.
Quantum algorithms for lattice problems and quantum lattice models, and why lattice-based cryptography is believed to resist quantum attacks.
Why qubit connectivity limits quantum computers and networks: routing, swap overhead, entanglement distribution and network topologies.
Measures of quantum correlations beyond entanglement, such as discord, how they differ from classical correlations and where they matter.