Barbara M. Terhal, David P. DiVincenzo, Debbie W. Leung
Published 2000-11-10, updated 2001-03-07Version 3
We present a scheme for hiding bits in Bell states that is secure even when the sharers Alice and Bob are allowed to carry out local quantum operations and classical communication. We prove that the information that Alice and Bob can gain about a hidden bit is exponentially small in $n$, the number of qubits in each share, and can be made arbitrarily small for hiding multiple bits. We indicate an alternative efficient low-entanglement method for preparing the shared quantum states. We discuss how our scheme can be implemented using present-day quantum optics.
Comments: 4 pages RevTex, 1 figure, various small changes and additional paragraph on optics implementation
Journal: Phys. Rev. Lett. 86, 5807--5810 (2001)
Comment on "A Random Quantum Key Distribution Achieved by Using Bell States"
Retraction of "Near-Deterministic Discrimination of All Bell States with Linear Optics," Phys. Rev. Lett. 107, 080403 (2011) and Erratum Phys. Rev. Lett. 107, 219901 (2011)
The distillable entanglement of multiple copies of Bell states
