Pith. sign in

REVIEW 3 cited by

Joint State-Channel Decoupling and One-Shot Quantum Coding 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 2409.15149 v1 pith:7PHHB53V submitted 2024-09-23 quant-ph

classification quant-ph
keywords decouplingexponentquantumchannelerrorboundone-shotcoding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work, we consider decoupling a bipartite quantum state via a general quantum channel. We propose a joint state-channel decoupling approach to obtain a one-shot error exponent bound without smoothing, in which trace distance is used to measure how good the decoupling is. The established exponent is expressed in terms of a sum of two sandwiched R{\'e}nyi entropies, one quantifying the amount of initial correlation between the state and environment, while the other characterizing the effectiveness of the quantum channel. This gives an explicit exponential decay of the decoupling error in the whole achievable region, which was missing in the previous results [Commun. Math. Phys. 328, 2014]. Moreover, it strengthens the error exponent bound obtained in a recent work [IEEE Trans. Inf. Theory, 69(12), 2023], for exponent from the channel part. As an application, we establish a one-shot error exponent bound for quantum channel coding given by a sandwiched R\'enyi coherent information.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Error Exponents for Quantum Packing Problems via An Operator Layer Cake Theorem

    quant-ph 2025-07 accept novelty 8.0 of 10

    The authors prove the Burnashev-Holevo conjecture by deriving a finite-blocklength random coding bound with a dimension-independent prefactor for classical-quantum channels, using a new operator layer cake theorem.

  2. Quantum Information Decoupling Beyond Finite Dimensions

    quant-ph 2026-07 accept novelty 7.0 of 10

    Under finite entropy of the manipulated system, infinite-dimensional IID decoupling and quantum state merging achieve the same optimal rates as in finite dimensions (H(A) and 1/2 I(A:R)).

  3. Microscopic Side Information Controls Ordered Hayden--Preskill Recovery

    quant-ph 2026-07 conditional novelty 7.0 of 10

    Without microscopic position labels, Hayden–Preskill recovery of a fixed diary requires Θ(n^{2/3}) output qubits; coarse block labels reduce this to n^{2/3}B^{-1/3} or n/B.

Pith tools