Pith. sign in

REVIEW 1 cited by

Strong converse rates for quantum communication

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 1406.2946 v4 pith:QKYSXZEN submitted 2014-06-11 quant-ph cs.ITmath.IT

classification quant-phcs.ITmath.IT
keywords quantuminformationchannelconversestrongchannelscommunicationrains
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We revisit a fundamental open problem in quantum information theory, namely whether it is possible to transmit quantum information at a rate exceeding the channel capacity if we allow for a non-vanishing probability of decoding error. Here we establish that the Rains information of any quantum channel is a strong converse rate for quantum communication: For any sequence of codes with rate exceeding the Rains information of the channel, we show that the fidelity vanishes exponentially fast as the number of channel uses increases. This remains true even if we consider codes that perform classical post-processing on the transmitted quantum data. As an application of this result, for generalized dephasing channels we show that the Rains information is also achievable, and thereby establish the strong converse property for quantum communication over such channels. Thus we conclusively settle the strong converse question for a class of quantum channels that have a non-trivial quantum capacity.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Sharp Quantum Capacity Thresholds: Exponential Strong Converses for Degradable and Antidegradable Channels

    quant-ph 2026-08 accept novelty 8.0 of 10

    Every finite-dimensional degradable or antidegradable quantum channel has an exponential strong converse: above capacity, all coding schemes have fidelity decaying exponentially in the number of channel uses.

Pith tools