Private Quantum Channels and the Cost of Randomizing Quantum Information
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Geometrical constructions of purity testing protocols and their applications to quantum communication
Geometrical constructions map classical linear error correcting codes to purity testing protocols whose properties are fully determined by the codes, enabling applications in quantum communication.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.