arXiv:2609.38038
Universal quantum coding
Jacopo Rizzo, Filippo Girardi, Ludovico Lami, Jens Eisert, Lorenzo Leone
Abstract
Entanglement distillation from noisy bipartite states and reliable quantum communication over noisy channels are fundamental tasks in quantum information theory. Yet existing coding schemes typically require prior knowledge of the underlying state or channel, or assume independent or weakly correlated quantum information sources. Here, using Schur-Weyl duality, we establish a universal quantum error-correction principle that overcomes these limitations. We show that the irreducible permutation spaces arising from the local Schur-Weyl decomposition of multiple copies of an unknown bipartite mixed state form maximally entangled quantum code spaces whose error structure is governed entirely by representation theory. Correcting these symmetry-resolved errors yields protocols for entanglement distillation and quantum communication that achieve coherent-information rates with exponentially vanishing error and optimal second-order corrections, even in the case of almost i.i.d. resources. Our approach also provides sharp finite-copy guarantees that are worst-case optimal at every finite block length, including in the sample-efficient regime, where the number of copies scales only polynomially with the number of qubits. Together, these results establish Schur-Weyl duality as a general mechanism for universal, robust, and optimal quantum coding, unifying entanglement distillation, quantum error correction, and quantum communication within a common representation-theoretic framework.
AI Summary
The paper asks whether entanglement distillation and quantum communication can attain coherent-information rates without knowing the source state or channel, using a recovery rule independent of that unknown resource. It constructs randomized one-way LOCC distillation protocols and communication codes from local Schur–Weyl decompositions. Permutation registers support the codes; Clebsch–Gordan intertwiners specify the errors, while state dependence enters through positive weights and coherences. Random-subspace encoding and polar recovery for a fixed reference channel yield the guarantees. The finite-copy distillation bound is $\varepsilon_k\le p_k+(1-p_k)/L$, where $p_k=\Pr[J_k<\log_2K+\log_2L]$ and $J_k$ measures Bob’s register dimension relative to a cumulative representation-theoretic error volume. At fixed ranks, the protocol achieves coherent information with exponentially decreasing infidelity below that rate, and fixed-error yield $\log_2K\ge kI(A\rangle B)+\sqrt{kV}\,\Phi^{-1}(\varepsilon)-O(\log k)$. A matching second-order converse applies to maximally correlated states with positive variance, not arbitrary mixed states. Petz–Rényi tail bounds give sample-complexity guarantees, including $\widetilde O(r_A r_B r_{AB}/\delta^2)$ copies to approach coherent information within $\delta$. Conditional Rényi promises give global-rank-only bounds and polynomial-copy regimes. Channel codes attain coherent-information thresholds and recover compound-channel capacity via block inputs. After permutation randomization, correlated resources satisfying an averaged two-position marginal condition have error $O(a_k+k^{-1})$; persistent discrepancy therefore need not yield vanishing error. Efficient decoding remains unresolved. Distillation seed guarantees are inputwise; unrestricted correlated-channel guarantees average over a channel-independent seed rather than provide simultaneous success for one seed.
Central claim may not hold: The abstract's exponential-error guarantee for almost-i.i.d. resources is false for the stated class: an inverse-polynomial admixture of a separable source satisfies the two-marginal assumption but forces inverse-polynomial infidelity for fixed-target LOCC distillation. The abstract overstates second-order optimality: general mixed states receive an achievability bound, while the matching converse identified in the body is restricted to maximally correlated states with positive variance. The claim of worst-case optimality at every finite block length is not established by the supplied finite-copy achievability theorem or the restricted asymptotic converse.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- added implications on almost i.i.d. states and channels