pith. sign in

arxiv: quant-ph/0003101 · v2 · submitted 2000-03-22 · 🪐 quant-ph

Private Quantum Channels and the Cost of Randomizing Quantum Information

classification 🪐 quant-ph
keywords quantumprivateclassicalencryptioninformationnecessaryqubitsrandomizing
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Geometrical constructions of purity testing protocols and their applications to quantum communication

    quant-ph 2025-03 unverdicted novelty 6.0

    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.