Pith. sign in

REVIEW 3 cited by

Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem

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

arxiv quant-ph/0106052 v2 pith:RBJSTXIV submitted 2001-06-08 quant-ph

Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem

classification quant-ph
keywords channelcapacityquantumentropyclassicalentanglemententanglement-assistedprior
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that this capacity is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs $\rho$, of the entropy of the channel input plus the entropy of the channel output minus their joint entropy, the latter being defined as the entropy of an entangled purification of $\rho$ after half of it has passed through the channel. We calculate entanglement-assisted capacities for two interesting quantum channels, the qubit amplitude damping channel and the bosonic channel with amplification/attenuation and Gaussian noise. We discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel, alone or in the presence of ancillary resources such as prior entanglement. In the classical analog of entanglement assisted communication--communication over a discrete memoryless channel (DMC) between parties who share prior random information--we show that one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMC's of equal capacity can simulate one another with unit asymptotic efficiency.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

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

  1. An Operational Framework for Nonclassicality in Quantum Communication Networks

    quant-ph 2024-03 unverdicted novelty 7.0

    A variational optimization framework computes linear classical bounds on network input/output probabilities whose violation certifies nonclassicality, finding entanglement necessary for nonclassicality in single-sende...

  2. Non-signaling assistance in prepare-and-measure scenarios with classical communication

    quant-ph 2026-07 unverdicted novelty 6.0

    Non-adaptive non-signaling assistance simulates quantum communication in PM scenarios with a classical dit replacing a qudit, while adaptive NS advantages are confined to single-setting receiver cases.

  3. Rethinking quantum information in gravity and fields

    hep-th 2026-06 unverdicted novelty 2.0

    The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.