Quantum mutual information and the one-time pad

Benjamin Schumacher; Michael D. Westmoreland

REVIEW

Quantum mutual information and the one-time pad

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv quant-ph/0604207 v1 pith:33R5SC2W submitted 2006-04-27 quant-ph

Quantum mutual information and the one-time pad

Benjamin Schumacher , Michael D. Westmoreland This is my paper

classification quant-ph

keywords informationquantumalicemutualone-timesystemamountcomposite

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

Alice and Bob share a correlated composite quantum system AB. If AB is used as the key for a one-time pad cryptographic system, we show that the maximum amount of information that Alice can send securely to Bob is the quantum mutual information of AB.

Quantum mutual information and the one-time pad

discussion (0)