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.29954

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

Kaito Watanabe, Takaya Matsuura, Ryuji Takagi

quant-phSubmitted Sep 24, 2026• Announced Sep 25, 2026• 2 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether correlation testing can replace channel-dependent decoding in communication protocols over unknown memoryless quantum channels. It constructs tests distinguishing $\rho_{AB}^{\otimes n}$ from $\rho_A^{\otimes n}\otimes\rho_B^{\otimes n}$ using only one known marginal. For classical–quantum states, the test requires no state information, including the classical distribution; this test was previously introduced in another setting. For every threshold $a<I(A:B)_\rho$, the tests have vanishing type-I error and type-II error bounded by $\operatorname{poly}(n)2^{-na}$, recovering the state-aware first-order Stein rate. The constructions use Schur–Weyl universal symmetric states, polynomial domination bounds, and Rényi-information estimates. Combining these tests with position-based decoding and convex splitting gives channel-independent protocols for shared-randomness-assisted cq communication and wiretap coding, one-way key distillation from cqq states, and entanglement-assisted communication. Achievable rates include $I(X:B)$, $I(X:B)-I(X:E)$, and, for a fixed auxiliary state, the Gel’fand–Pinsker expression $I(B:C)-I(S:C)$. For an $L$-receiver entanglement-assisted broadcast channel, the construction achieves Marton-type constraints $\sum_{l\in S}R_l<\sum_{l\in S}I(B_l:C_l)-I[S]$ for every nonempty receiver subset $S$. Universality generally holds for fixed input or auxiliary states, not channel-dependent optimizations. The broadcast result assumes known mutual-information values; key distillation requires the classical marginal; Gel’fand–Pinsker coding requires known channel-state information. The detectors do not establish optimal error exponents. Position-based schemes consume exponentially many shared resource copies, and universal optimal preprocessing and two-way key distillation remain open.

Little sign of AI-generated textAI use disclosedOverclaimsStrong assumptionsPossible error
ChatGPT 5.6 Sol and 6 Astra were used to search for previous papers, assist in preparing the manuscript, and finding technical mistakes. The idea originated with the authors.

Error found: The abstract's capacity-achieving language exceeds the fixed-length cq and entanglement-assisted theorems, which achieve rates for specified input distributions or resource states without universally optimizing those choices. The broadcast application achieves a Marton-type inner bound and requires exact channel-dependent mutual informations, rather than establishing fully channel-information-independent achievement of the general capacity region. Both detector proofs incorrectly turn a polynomial domination constant into an inverse-polynomial type-I error prefactor; a positive polynomial prefactor repairs the argument without changing its first-order asymptotic conclusion. The Gel'fand–Pinsker and broadcast proofs incorrectly complete their pretty-good measurements with (I-sum Gamma)^0, which generally fails to produce normalized POVMs.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
29 pages, 2 figures

Related papers

Universal quantum coding

Jacopo Rizzo, Filippo Girardi, Ludovico Lami +2 more

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.

quant-pharXiv:2609.38038•Sep 30, 2026•2 citations

Building Blocks for Communication Over Noisy Quantum Nerworks

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the channel. An important scenario, both from practical and conceptual point of view, is when the channel can be used only once. This is known as the one-shot channel coding problem. We provide a tight characterization of the one-shot entanglement assisted classical capacity of a quantum channel. We arrive at our result by introducing a simple decoding technique which we refer to as position-based decoding. We also consider two other important quantum network scenarios: quantum channel with a jammer and quantum broadcast channel. For these problems, we use the recently introduced convex split technique [1] in addition to position based decoding. Our approach exhibits that the simultaneous use of these two techniques provides a uniform and conceptually simple framework for designing communication protocols for quantum networks.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•0 citations

Building Blocks for Communication Over Noisy Quantum Networks

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

A capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information-theoretic question is very well studied specially in the setting of many independent uses of the channel. An important scenario, both from practical and conceptual point of view, is when the channel can be used only once. This is known as the one-shot channel coding problem. We provide a tight characterization of the one-shot entanglement-assisted classical capacity of a quantum channel. We arrive at our result by introducing a simple decoding technique which we refer to as position-based decoding. We also consider two other important quantum network scenarios: quantum channel with a jammer and quantum broadcast channel. For these problems, we use the recently introduced convex split technique in addition to position-based decoding. Our approach exhibits that the simultaneous use of these two techniques provides a uniform and conceptually simple framework for designing communication protocols for quantum networks.

arXiv:1702.01940•IEEE Transactions on Information Theory•Jun 28, 2018•97 citations

Quantum umlaut information

Filippo Girardi, Aadil Oufkir, Bartosz Regula +3 more

We study the quantum umlaut information, a correlation measure defined for bipartite quantum states $ρ_{AB}$ as a reversed variant of the quantum mutual information: $U(A;B)_ρ= \min_{σ_B} D(ρ_A\otimes σ_B\|ρ_{AB})$ in terms of the quantum relative entropy $D$. As in the classical case [Girardi et al., arXiv:2503.18910], this definition allows for a closed-form expression and has an operational interpretation as the asymptotic error exponent in the hypothesis testing task of deciding whether a given bipartite state is product or not. We generalise the umlaut information to quantum channels, where it also extends the notion of `oveloh information' [Nuradha et al., arXiv:2404.16101]. We prove that channel umlaut information is additive for classical-quantum channels, while we observe additivity violations for fully quantum channels. Inspired by recent results in entanglement theory, we then show as our main result that the regularised umlaut information constitutes a fundamental measure of the quality of classical information transmission over a quantum channel -- as opposed to the capacity, which quantifies the quantity of information that can be sent. This interpretation applies to coding assisted by activated non-signalling correlations, and the channel umlaut information is in general larger than the corresponding expression for unassisted communication as obtained by Dalai for the classical-quantum case [IEEE Trans. Inf. Theory 59, 8027 (2013)]. Combined with prior works on non-signalling--assisted zero-error channel capacities, our findings imply a dichotomy between the settings of zero-rate error exponents and zero-error communication. While our results are single-letter only for classical-quantum channels, we also give a single-letter bound for fully quantum channels in terms of the `geometric' version of umlaut information.

arXiv:2503.21479•Mar 27, 2025•6 citations

Universal entanglement-inspired correlations

Elizabeth Agudelo, Laura Ares, Jan Sperling

Quantum correlations, crucial for the advantage and advancement of quantum science and technology, arise from the impossibility of expressing a quantum state as a tensor product over a given set of parties. In this work, a generalized notion of correlations via arbitrary products is formulated. Remarkably, as a universal property, the connection between such general products and tensor products is established, allowing one to relate generic non-product states to the common notion of entangled states. We construct the set of free operations for general types of products by extending the local-operation-and-classical-communication paradigm, familiar from standard entanglement theory, thereby establishing a resource theory of correlations for general products. A generalization is provided beyond two factors that can be universally related to multipartite entanglement. Applications that highlight the usefulness of the approach are discussed, such as the factorization of fermionic states, the non-local factorization of multi-photon states into single-photon states, and the interesting possibility of understanding prime numbers as a form of single-party entanglement.

quant-pharXiv:2602.15520•Feb 18, 2026•0 citations

Universality Sacrifices Reliability in Classical-Quantum Channel Coding

Kaito Watanabe, Masahito Hayashi, Takaya Matsuura +1 more

Universal channel coding enables communication without a complete description of the channel. For classical channels, universal codes can attain both capacity and the optimal high-rate reliability. We show that this compatibility fails for classical-quantum channels in general; that is, the optimal reliability in the channel-aware scenario is not always achievable with universal coding due to the ignorance of the unitary rotation of the output system. We exhibit a family of classical-quantum channels for which one cannot achieve the channel-aware optimal reliability by a fixed coding scheme. We further derive a converse bound on the reliability for unitary-invariant decoders, a natural assumption for the universal coding scheme, that can be strictly smaller than the optimal channel-aware error exponent. Conversely, we construct a channel-independent encoder-decoder pair and establish a universally achievable bound on the reliability that matches this converse bound in the high-rate regime, thereby characterizing the optimal universal reliability. Specifically, the channel-aware and universal exponents are governed by the Petz and sandwiched Rényi divergences, respectively. These divergences coincide for commuting outputs but differ for noncommuting ones, explaining why universality preserves optimal reliability classically but can reduce it quantumly. Our results showcase the fundamental reliability cost of performing the classical-quantum channel coding task universally.

quant-pharXiv:2610.01941•Oct 2, 2026•0 citations
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 paper asks whether correlation testing can replace channel-dependent decoding in communication protocols over unknown memoryless quantum channels. It constructs tests distinguishing ρAB⊗n\rho_{AB}^{\otimes n}ρAB⊗n​ from ρA⊗n⊗ρB⊗n\rho_A^{\otimes n}\otimes\rho_B^{\otimes n}ρA⊗n​⊗ρB⊗n​ using only one known marginal. For classical–quantum states, the test requires no state information, including the classical distribution; this test was previously introduced in another setting. For every threshold a<I(A:B)ρa<I(A:B)_\rhoa<I(A:B)ρ​, the tests have vanishing type-I error and type-II error bounded by poly⁡(n)2−na\operatorname{poly}(n)2^{-na}poly(n)2−na, recovering the state-aware first-order Stein rate.
The constructions use Schur–Weyl universal symmetric states, polynomial domination bounds, and Rényi-information estimates. Combining these tests with position-based decoding and convex splitting gives channel-independent protocols for shared-randomness-assisted cq communication and wiretap coding, one-way key distillation from cqq states, and entanglement-assisted communication. Achievable rates include I(X:B)I(X:B)I(X:B), I(X:B)−I(X:E)I(X:B)-I(X:E)I(X:B)−I(X:E), and, for a fixed auxiliary state, the Gel’fand–Pinsker expression I(B:C)−I(S:C)I(B:C)-I(S:C)I(B:C)−I(S:C). For an LLL-receiver entanglement-assisted broadcast channel, the construction achieves Marton-type constraints ∑l∈SRl<∑l∈SI(Bl:Cl)−I[S]\sum_{l\in S}R_l<\sum_{l\in S}I(B_l:C_l)-I[S]∑l∈S​Rl​<∑l∈S​I(Bl​:Cl​)−I[S] for every nonempty receiver subset SSS.
Universality generally holds for fixed input or auxiliary states, not channel-dependent optimizations. The broadcast result assumes known mutual-information values; key distillation requires the classical marginal; Gel’fand–Pinsker coding requires known channel-state information. The detectors do not establish optimal error exponents. Position-based schemes consume exponentially many shared resource copies, and universal optimal preprocessing and two-way key distillation remain open.
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.
Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the channel. An important scenario, both from practical and conceptual point of view, is when the channel can be used only once. This is known as the one-shot channel coding problem. We provide a tight characterization of the one-shot entanglement assisted classical capacity of a quantum channel. We arrive at our result by introducing a simple decoding technique which we refer to as position-based decoding. We also consider two other important quantum network scenarios: quantum channel with a jammer and quantum broadcast channel. For these problems, we use the recently introduced convex split technique [1] in addition to position based decoding. Our approach exhibits that the simultaneous use of these two techniques provides a uniform and conceptually simple framework for designing communication protocols for quantum networks.
A capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information-theoretic question is very well studied specially in the setting of many independent uses of the channel. An important scenario, both from practical and conceptual point of view, is when the channel can be used only once. This is known as the one-shot channel coding problem. We provide a tight characterization of the one-shot entanglement-assisted classical capacity of a quantum channel. We arrive at our result by introducing a simple decoding technique which we refer to as position-based decoding. We also consider two other important quantum network scenarios: quantum channel with a jammer and quantum broadcast channel. For these problems, we use the recently introduced convex split technique in addition to position-based decoding. Our approach exhibits that the simultaneous use of these two techniques provides a uniform and conceptually simple framework for designing communication protocols for quantum networks.
We study the quantum umlaut information, a correlation measure defined for bipartite quantum states ρABρ_{AB}ρAB​ as a reversed variant of the quantum mutual information: U(A;B)ρ=min⁡σBD(ρA⊗σB∥ρAB)U(A;B)_ρ= \min_{σ_B} D(ρ_A\otimes σ_B\|ρ_{AB})U(A;B)ρ​=minσB​​D(ρA​⊗σB​∥ρAB​) in terms of the quantum relative entropy DDD. As in the classical case [Girardi et al., arXiv:2503.18910], this definition allows for a closed-form expression and has an operational interpretation as the asymptotic error exponent in the hypothesis testing task of deciding whether a given bipartite state is product or not. We generalise the umlaut information to quantum channels, where it also extends the notion of `oveloh information' [Nuradha et al., arXiv:2404.16101]. We prove that channel umlaut information is additive for classical-quantum channels, while we observe additivity violations for fully quantum channels. Inspired by recent results in entanglement theory, we then show as our main result that the regularised umlaut information constitutes a fundamental measure of the quality of classical information transmission over a quantum channel -- as opposed to the capacity, which quantifies the quantity of information that can be sent. This interpretation applies to coding assisted by activated non-signalling correlations, and the channel umlaut information is in general larger than the corresponding expression for unassisted communication as obtained by Dalai for the classical-quantum case [IEEE Trans. Inf. Theory 59, 8027 (2013)]. Combined with prior works on non-signalling--assisted zero-error channel capacities, our findings imply a dichotomy between the settings of zero-rate error exponents and zero-error communication. While our results are single-letter only for classical-quantum channels, we also give a single-letter bound for fully quantum channels in terms of the `geometric' version of umlaut information.
Quantum correlations, crucial for the advantage and advancement of quantum science and technology, arise from the impossibility of expressing a quantum state as a tensor product over a given set of parties. In this work, a generalized notion of correlations via arbitrary products is formulated. Remarkably, as a universal property, the connection between such general products and tensor products is established, allowing one to relate generic non-product states to the common notion of entangled states. We construct the set of free operations for general types of products by extending the local-operation-and-classical-communication paradigm, familiar from standard entanglement theory, thereby establishing a resource theory of correlations for general products. A generalization is provided beyond two factors that can be universally related to multipartite entanglement. Applications that highlight the usefulness of the approach are discussed, such as the factorization of fermionic states, the non-local factorization of multi-photon states into single-photon states, and the interesting possibility of understanding prime numbers as a form of single-party entanglement.
Universal channel coding enables communication without a complete description of the channel. For classical channels, universal codes can attain both capacity and the optimal high-rate reliability. We show that this compatibility fails for classical-quantum channels in general; that is, the optimal reliability in the channel-aware scenario is not always achievable with universal coding due to the ignorance of the unitary rotation of the output system. We exhibit a family of classical-quantum channels for which one cannot achieve the channel-aware optimal reliability by a fixed coding scheme. We further derive a converse bound on the reliability for unitary-invariant decoders, a natural assumption for the universal coding scheme, that can be strictly smaller than the optimal channel-aware error exponent. Conversely, we construct a channel-independent encoder-decoder pair and establish a universally achievable bound on the reliability that matches this converse bound in the high-rate regime, thereby characterizing the optimal universal reliability. Specifically, the channel-aware and universal exponents are governed by the Petz and sandwiched Rényi divergences, respectively. These divergences coincide for commuting outputs but differ for noncommuting ones, explaining why universality preserves optimal reliability classically but can reduce it quantumly. Our results showcase the fundamental reliability cost of performing the classical-quantum channel coding task universally.