Phys. Rev. A 67, 042317 (2003) [6 pages]Optimal encryption of quantum bitsReceived 19 September 2002; revised 28 January 2003; published 22 April 2003 We show that 2n random classical bits are both necessary and sufficient for encrypting any unknown state of n quantum bits in an informationally secure manner. We also characterize the complete set of optimal protocols in terms of a set of unitary operations that comprise an orthonormal basis in a canonical inner product space. Moreover, a connection is made between quantum encryption and quantum teleportation that allows for a different proof of optimality of teleportation. © 2003 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.67.042317
DOI:
10.1103/PhysRevA.67.042317
PACS:
03.67.Dd, 03.67.Hk
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.