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