arXiv:2610.15955
Quantum simultaneous decoding via pretty-good measurements of tilted states
Mark M. Wilde
Abstract
A multiple-access channel transmits messages from several senders to one receiver. For quantum outputs, the receiver must distinguish states depending on all messages, while tests for different decoding errors may not commute. In this paper, we give a self-contained account of simultaneous decoding, in which one joint measurement recovers the messages at the established achievable rates using independent codebooks. The proof combines Sen's tilted-subspace method with Cheng's analysis of the pretty-good measurement, a standard measurement for distinguishing quantum states. Auxiliary labels close to a common reference state separate the geometric directions associated with different errors. A Gram-matrix bound then allows separately chosen binary tests to certify the performance of one measurement. The labels are removed from the completed decoder, leading to a deterministic packing theorem that applies to finite state ensembles, including unequal priors. We develop the two-sender case first, with worked examples and figures, before treating any fixed number of senders. Sharper finite-error guarantees for the same decoder are developed separately, with sharp bounds for two specified steps of the analysis rather than a claim of globally optimal decoding. Applications recover known achievable rates for unassisted and entanglement-assisted classical communication, distributed classical compression with quantum side information, and coherent-state communication through a beamsplitter or passive multiport device. The common proof makes the geometric mechanism and its quantitative consequences available without repeating the construction for each application.
AI Summary
The paper revisits quantum simultaneous decoding for multiple-access channels: independently generated, unsplit codebooks must be decoded jointly despite noncommuting tests for different error patterns. The general problem is already resolved; the focus here is a self-contained deterministic packing formulation combining Sen’s tilted-subspace geometry with Cheng’s analysis of the state-based pretty-good measurement (PGM). For arbitrary finite ensembles indexed by $k$ message coordinates, separately chosen binary tests certify one decoder. Weak, injective message labels produce exact error-pattern directions; a Gram-matrix estimate controls the span of labeled rejection subspaces. The PGM is constructed from the tagged states, rather than the tests, and the completed measurement is compressed against a fixed reference label. The basic bound is $P_e\le d_k(\delta)+C_k(\delta)a+b$, where $a$ sums correct-message rejection probabilities, $b$ sums competing-message acceptance probabilities, $d_k(\delta)=\sqrt{1-(1-\delta)^k}$, and $C_k(\delta)=(1-\sqrt{1-\delta})^{-k}$. Constants are independent of output dimension and message sizes. Holding label-removal error fixed gives a rejection coefficient scaling as $2^{O(k\log k)}$, avoiding the doubly exponential factor in the compared general joint-typicality estimate. Refinements establish sharpness for two specified analysis steps, not globally optimal decoding. Binary Stein tests recover known simultaneous-decoding rate constraints. Further reductions recover established entanglement-assisted communication, distributed compression, and coherent-state optical achievable regions. Limitations include average rather than maximal error, fixed $k$, finite-dimensional packing, and no efficient receiver implementation. The construction does not replace general joint-typicality union, covering, decoupling, or dependent-codebook results, nor uniformly improve prior bounds at every tolerance.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 92 pages, 18 figures