Private Quantum Channels and the Cost of Randomizing Quantum Information

Abstract

We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular we show that in order to transmit n qubits privately, 2n bits of shared private key are necessary and sufficient. This result may be viewed as the quantum analogue of the classical one-time pad encryption scheme. From the point of view of the eavesdropper, this encryption process can be seen as a randomization of the original state. We thus also obtain strict bounds on the amount of entropy necessary for randomizing n qubits.

LaTeX, 10 pages. Minor changes in the typesetting and references

References in corpus (1)

• Optimal Encryption of Quantum Bits

Cited by in corpus (14)

• Security in Quantum Cryptography
• General paradigm for distilling classical key from quantum states
• Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices
• Invertible Quantum Operations and Perfect Encryption of Quantum States
• Quantum Encryption of superposition states with Quantum Permutation Pad in IBM Quantum Computers
• Verifiable Hybrid Secret Sharing With Few Qubits
• Quantum message authentication codes
• On the Power of Quantum Encryption Keys
• Combinatorial Approaches in Quantum Information Theory
• Computational Distinguishability of Quantum Channels
• A method of enciphering quantum states
• Testing quantum circuits and detecting insecure encryption
• How to securely decouple quantum systems: local shredding of bipartite correlations
• Quantum deletion is possible via a partial randomization procedure