Optimal Encryption of Quantum Bits
| dc.creator | Boykin, P. Oscar | |
| dc.creator | Roychowdhury, Vwani | |
| dc.date | 2000-03-16 | |
| dc.date | 2000-03-21 | |
| dc.date.accessioned | 2026-07-07T05:59:43Z | |
| dc.date.available | 2026-07-07T05:59:43Z | |
| dc.description | We characterize the complete set of protocols that may be used to securely encrypt n quantum bits using secret and random classical bits. In addition to the application of such quantum encryption protocols to quantum data security, our framework allows for generalizations of many classical cryptographic protocols to quantum data. We show that the encrypted state gives no information without the secret classical data, and that 2n random classical bits are the minimum necessary for informationally secure quantum encryption. Moreover, the quantum operations are shown to have a surprising structure in a canonical inner product space. This quantum encryption protocol is a generalization of the classical one time pad concept. A connection is made between quantum encryption and quantum teleportation, and this allows for a new proof of optimality of teleportation. | |
| dc.description | 12 pages, LaTeX. Replacement fixes incorrect reference [15], otherwise identical | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0003059 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0003059 | |
| dc.identifier | Phys. Rev. A 67, 042317 (2003) | |
| dc.identifier | doi:10.1103/PhysRevA.67.042317 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/88782 | |
| dc.subject | Quantum Physics | |
| dc.title | Optimal Encryption of Quantum Bits | |
| dc.type | text |