REVIEW 4 cited by
Private Quantum Channels and the Cost of Randomizing Quantum Information
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 4 Pith papers
-
Pseudorandom quantum authentication
Quantum states can be hidden and authenticated with a reusable key using pseudorandom unitaries, injected mixing qubits, and unitary designs.
-
Randomness cost of masking quantum information and the information conservation law
The randomness cost of a universal quantum masker is at least a measure of information unevenness between its two outputs, and the geometric 'disk' conjecture on maskable states is false.
-
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.
-
Rethinking quantum information in gravity and fields
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.
Discussion (0). Continue with ORCID to comment.