Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.38038

Universal quantum coding

Jacopo Rizzo, Filippo Girardi, Ludovico Lami, Jens Eisert, Lorenzo Leone

quant-phSubmitted Sep 29, 2026• Announced Sep 30, 2026• 2 citations• Revised Oct 23, 2026 (v2)
v1 · Sep 29, 2026v2 · Oct 23, 2026
arXivHTMLPDF

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.

Little sign of AI-generated textOverclaims

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

Related papers

All you need is the universal correlation detector: A unified approach to universalize communication protocols over quantum channels

Kaito Watanabe, Takaya Matsuura, Ryuji Takagi

Constructing optimal quantum information protocols without complete knowledge of the underlying states or channels is a central challenge. We address this challenge by developing universal correlation detection as a common building block for quantum communication. Our detectors distinguish a bipartite state from the product of its marginals and attain the same first-order asymptotic performance as optimal tests constructed with complete state information. For general bipartite quantum states, knowledge of a single marginal suffices: a detector depending only on that marginal is first-order optimal for every compatible state. For classical-quantum states, the detector is fully universal and requires no prior state information. By combining these detectors with position-based decoding and convex splitting, we construct channel-independent coding schemes that achieve capacity for a range of communication tasks. These results turn universal correlation detection into a systematic tool for universal protocol design, providing a unified route to designing capacity-achieving protocols for many communication tasks over unknown quantum channels.

quant-pharXiv:2609.29954•Sep 25, 2026•2 citations

Computational entanglement distillation beyond pure states: efficient protocols and fundamental limitations

Takeru Utsumi, Jacopo Rizzo, Ryuji Takagi +1 more

The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.

quant-pharXiv:2610.06787•Oct 6, 2026•0 citations

Mixed-state entanglement and quantum error correction

Charles H. Bennett, David Peter Divincenzo, John A. Smolin +1 more

Entanglement purification protocols (EPPs) and quantum error-correcting codes (QECCs) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a mixed state M shared by two parties; with a QECC, an arbitrary quantum state |\ensuremath{\xi}〉 can be transmitted at some rate Q through a noisy channel \ensuremath{\chi} without degradation. We prove that an EPP involving one-way classical communication and acting on mixed state M^(\ensuremath{\chi}) (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel \ensuremath{\chi}) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa. We compare the amount of entanglement E(M) required to prepare a mixed state M by local actions with the amounts ${\mathit{D}}_{1}$(M) and ${\mathit{D}}_{2}$(M) that can be locally distilled from it by EPPs using one- and two-way classical communication, respectively, and give an exact expression for E(M) when M is Bell diagonal. While EPPs require classical communication, QECCs do not, and we prove Q is not increased by adding one-way classical communication. However, both D and Q can be increased by adding two-way communication. We show that certain noisy quantum channels, for example a 50% depolarizing channel, can be used for reliable transmission of quantum states if two-way communication is available, but cannot be used if only one-way communication is available. We exhibit a family of codes based on universal hashing able to achieve an asymptotic Q (or D) of 1-S for simple noise models, where S is the error entropy. We also obtain a specific, simple 5-bit single-error-correcting quantum block code. We prove that iff a QECC results in high fidelity for the case of no error then the QECC can be recast into a form where the encoder is the matrix inverse of the decoder. \textcopyright{} 1996 The American Physical Society.

arXiv:quant-ph/9604024•Physical Review A•Nov 1, 1996•5,363 citations

Universal Entanglement Distillation

Salvatore Tirone, Francesco Anna Mele, Vittorio Giovannetti +1 more

We present a universal entanglement distillation protocol that asymptotically achieves the distillable entanglement of any unknown bipartite state in a fixed finite dimension. That is, its ebit yield attains every rate below the optimum that would be available if the state were known, with vanishing trace-distance error. Our approach combines tomography by local operations and classical communication with an adaptive distillation routine, using a local robustness lemma to control finite-sample estimation errors. We also characterize worst-case distillation from a family of states: the optimal uniform rate is the minimum distillable entanglement on the family's closure. These results show that ignorance of the state need not incur an asymptotic rate penalty.

quant-pharXiv:2609.40080•Oct 1, 2026•2 citations

Universal distillation of quantum entanglement

Ryuji Takagi, Kaito Watanabe, Takaya Matsuura +2 more

Distillable entanglement---the maximum rate of Bell states extractable from the given noisy entangled states via local operations and classical communication (LOCC)---has been a central quantity to characterize the operational value of entangled states. However, this operational meaning had been known to be valid only under a crucial assumption: both parties know the description of the input state and can choose the protocol tailored to it, which does not necessarily reflect the natural operational setting. Here, we show that the distillable entanglement is the fundamental operational quantity even without this assumption. We present a universal LOCC protocol---whose description does not depend on the input state and thus works universally for any input---that achieves the distillable entanglement of an arbitrary unknown input state. Our result therefore lifts the distillable entanglement to a robust notion of an operationally meaningful quantity and clarifies that input-state knowledge is not necessary to achieve the optimal rate of entanglement distillation. Our protocol is based on state merging for compound states, together with the uniform convergence property of the finite-block quantity toward distillable entanglement.

quant-pharXiv:2609.40215•Oct 1, 2026•2 citations

A Code-Centric Design Space for Error Management over Quantum Network Links

Huiping Lin, Kai Zhang, Jianxin Chen +1 more

Abstract Quantum networks are expected to form a foundational infrastructure for quantum communication and distributed quantum computation, and their central challenge is reliable transmission of quantum states across noisy links. In classical networks this reliability is the job of the link layer, a role expected to be more critical for quantum networks, whose states cannot be copied or amplified. While quantum error correction (QEC) offers a powerful theory for protecting quantum information, the protocols that manage errors over quantum links, such as entanglement distillation, encoded-entanglement distribution, and direct encoded transmission, have evolved as separate families, obscuring their common coding structure and limiting cross-level optimization. Here we establish a unified, code-centric framework for error management over quantum network links. We prove that, with noise-free local operations, these protocol families are equivalent realizations of one underlying process: applying a quantum error-correcting code and extracting an error syndrome, differing only in what is encoded and how the syndrome is used. This equivalence induces a design space organized along two orthogonal axes, the encoding paradigm and the error management strategy, which exposes design choices and engineering optimizations, including localized preparation of logical entanglement and pipelined classical signaling. Within this design space, error detection and error correction emerge as two extreme modes of syndrome usage, naturally introducing hybrid error management strategies that interpolate between them. Through circuit-level simulations, we show that hybrid error management can reduce logical error rates by one to two orders of magnitude compared with pure error detection or pure error correction for small surface codes, while enabling explicit trade-offs between logical fidelity and acceptance probability. By reframing quantum-link error management as a quantum error correction problem, this work unifies previously disparate protocols, pushes the boundaries of performance, and lays a principled foundation for the quantum-network link layer.

Quantum Science and Technology•Nov 5, 2026•0 citations
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.
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 εk≤pk+(1−pk)/L\varepsilon_k\le p_k+(1-p_k)/Lεk​≤pk​+(1−pk​)/L, where pk=Pr⁡[Jk<log⁡2K+log⁡2L]p_k=\Pr[J_k<\log_2K+\log_2L]pk​=Pr[Jk​<log2​K+log2​L] and JkJ_kJk​ 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≥kI(A⟩B)+kV Φ−1(ε)−O(log⁡k)\log_2K\ge kI(A\rangle B)+\sqrt{kV}\,\Phi^{-1}(\varepsilon)-O(\log k)log2​K≥kI(A⟩B)+kV​Φ−1(ε)−O(logk). 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 O~(rArBrAB/δ2)\widetilde O(r_A r_B r_{AB}/\delta^2)O(rA​rB​rAB​/δ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(ak+k−1)O(a_k+k^{-1})O(ak​+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.
Constructing optimal quantum information protocols without complete knowledge of the underlying states or channels is a central challenge. We address this challenge by developing universal correlation detection as a common building block for quantum communication. Our detectors distinguish a bipartite state from the product of its marginals and attain the same first-order asymptotic performance as optimal tests constructed with complete state information. For general bipartite quantum states, knowledge of a single marginal suffices: a detector depending only on that marginal is first-order optimal for every compatible state. For classical-quantum states, the detector is fully universal and requires no prior state information. By combining these detectors with position-based decoding and convex splitting, we construct channel-independent coding schemes that achieve capacity for a range of communication tasks. These results turn universal correlation detection into a systematic tool for universal protocol design, providing a unified route to designing capacity-achieving protocols for many communication tasks over unknown quantum channels.
The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.
Entanglement purification protocols (EPPs) and quantum error-correcting codes (QECCs) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a mixed state M shared by two parties; with a QECC, an arbitrary quantum state |\ensuremath{\xi}〉 can be transmitted at some rate Q through a noisy channel \ensuremath{\chi} without degradation. We prove that an EPP involving one-way classical communication and acting on mixed state M^(\ensuremath{\chi}) (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel \ensuremath{\chi}) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa. We compare the amount of entanglement E(M) required to prepare a mixed state M by local actions with the amounts D1{\mathit{D}}_{1}D1​(M) and D2{\mathit{D}}_{2}D2​(M) that can be locally distilled from it by EPPs using one- and two-way classical communication, respectively, and give an exact expression for E(M) when M is Bell diagonal. While EPPs require classical communication, QECCs do not, and we prove Q is not increased by adding one-way classical communication. However, both D and Q can be increased by adding two-way communication. We show that certain noisy quantum channels, for example a 50% depolarizing channel, can be used for reliable transmission of quantum states if two-way communication is available, but cannot be used if only one-way communication is available. We exhibit a family of codes based on universal hashing able to achieve an asymptotic Q (or D) of 1-S for simple noise models, where S is the error entropy. We also obtain a specific, simple 5-bit single-error-correcting quantum block code. We prove that iff a QECC results in high fidelity for the case of no error then the QECC can be recast into a form where the encoder is the matrix inverse of the decoder. \textcopyright{} 1996 The American Physical Society.
We present a universal entanglement distillation protocol that asymptotically achieves the distillable entanglement of any unknown bipartite state in a fixed finite dimension. That is, its ebit yield attains every rate below the optimum that would be available if the state were known, with vanishing trace-distance error. Our approach combines tomography by local operations and classical communication with an adaptive distillation routine, using a local robustness lemma to control finite-sample estimation errors. We also characterize worst-case distillation from a family of states: the optimal uniform rate is the minimum distillable entanglement on the family's closure. These results show that ignorance of the state need not incur an asymptotic rate penalty.
Distillable entanglement---the maximum rate of Bell states extractable from the given noisy entangled states via local operations and classical communication (LOCC)---has been a central quantity to characterize the operational value of entangled states. However, this operational meaning had been known to be valid only under a crucial assumption: both parties know the description of the input state and can choose the protocol tailored to it, which does not necessarily reflect the natural operational setting. Here, we show that the distillable entanglement is the fundamental operational quantity even without this assumption. We present a universal LOCC protocol---whose description does not depend on the input state and thus works universally for any input---that achieves the distillable entanglement of an arbitrary unknown input state. Our result therefore lifts the distillable entanglement to a robust notion of an operationally meaningful quantity and clarifies that input-state knowledge is not necessary to achieve the optimal rate of entanglement distillation. Our protocol is based on state merging for compound states, together with the uniform convergence property of the finite-block quantity toward distillable entanglement.
Abstract Quantum networks are expected to form a foundational infrastructure for quantum communication and distributed quantum computation, and their central challenge is reliable transmission of quantum states across noisy links. In classical networks this reliability is the job of the link layer, a role expected to be more critical for quantum networks, whose states cannot be copied or amplified. While quantum error correction (QEC) offers a powerful theory for protecting quantum information, the protocols that manage errors over quantum links, such as entanglement distillation, encoded-entanglement distribution, and direct encoded transmission, have evolved as separate families, obscuring their common coding structure and limiting cross-level optimization. Here we establish a unified, code-centric framework for error management over quantum network links. We prove that, with noise-free local operations, these protocol families are equivalent realizations of one underlying process: applying a quantum error-correcting code and extracting an error syndrome, differing only in what is encoded and how the syndrome is used. This equivalence induces a design space organized along two orthogonal axes, the encoding paradigm and the error management strategy, which exposes design choices and engineering optimizations, including localized preparation of logical entanglement and pipelined classical signaling. Within this design space, error detection and error correction emerge as two extreme modes of syndrome usage, naturally introducing hybrid error management strategies that interpolate between them. Through circuit-level simulations, we show that hybrid error management can reduce logical error rates by one to two orders of magnitude compared with pure error detection or pure error correction for small surface codes, while enabling explicit trade-offs between logical fidelity and acceptance probability. By reframing quantum-link error management as a quantum error correction problem, this work unifies previously disparate protocols, pushes the boundaries of performance, and lays a principled foundation for the quantum-network link layer.