Optimal encryption of quantum bits
By P. Oscar Boykin, Vwani P. Roychowdhury. 2000
344 citations recorded by the source corpus.
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.
Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics
View Paper: https://www.semanticscholar.org/paper/90556085dd8f283c7fc2ce9349b89e22df872e14
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Joseph Francis Fitzsimons
- Anne Broadbent
- Howard Barnum
- Vwani P. Roychowdhury
- Daniel Gottesman
- Somshubhro Bandyopadhyay
- Alain Tapp
- Elham Kashefi
In Atomic and Molecular Physics, and Optics
- Joseph Francis Fitzsimons
- Anne Broadbent
- Howard Barnum
- Vwani P. Roychowdhury
- Daniel Gottesman
- Somshubhro Bandyopadhyay
- Elham Kashefi
- P. Oscar Boykin
Citations in the corpus
- Universal Blind Quantum Computation (2008, background): “The case of a blind quantum computation was first considered by Childs [12] based on the idea of encrypting input qubits with a quantum one-time pad [5], [10].”
- Authentication of quantum messages (2001, methodology): “This is called a quantum one-time pad (QOTP). This scheme is optimal [1, 9 ]: any”
- A New Proof for the Existence of Mutually Unbiased Bases (2001, background): “This allows us to connect encryption of quantum bits [3], which uses unitary bases of operators, to quantum key distribution, which uses mutually unbiased bases of quantum systems.”