Pith. sign in

REVIEW 2 cited by

Capacities of quantum Markovian noise for large times

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 2408.00116 v2 pith:DQEPUWLG submitted 2024-07-31 quant-ph math-phmath.MPmath.OA

classification quant-phmath-phmath.MPmath.OA
keywords quantumcapacitiestimechannelclassicallargemarkoviannoise
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Given a quantum Markovian noise model, we study the maximum dimension of a classical or quantum system that can be stored for arbitrarily large time. We show that, unlike the fixed time setting, in the limit of infinite time, the classical and quantum capacities are characterized by efficiently computable properties of the peripheral spectrum of the quantum channel. In addition, the capacities are additive under tensor product, which implies in the language of Shannon theory that the one-shot and the asymptotic i.i.d. capacities are the same. We also provide an improved algorithm for computing the structure of the peripheral subspace of a quantum channel, which might be of independent interest.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Fixed points in de Finetti hierarchies

    quant-ph 2026-07 accept novelty 7.0 of 10

    Fixed-point constraints on de Finetti hierarchies yield O(√(log n)/n) double-sided rates, block-structured dimension dependence, and poly-time certifiable separable inner approximations for fixed local dimensions.

  2. Sequential transmission at short times

    quant-ph 2025-06 conditional novelty 6.0 of 10

    The paper proves that if each coded channel is epsilon-close to the identity in diamond norm, the n-fold sequential composition has one-shot quantum capacity at least 1 - 2n epsilon minus a small entropy term.

Pith tools