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:2610.15955

Quantum simultaneous decoding via pretty-good measurements of tilted states

Mark M. Wilde

quant-phcs.ITSubmitted Oct 11, 2026• Announced Oct 13, 2026• 1 citation
arXivHTMLPDF

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.

Some signs of AI-generated text

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

Comments
92 pages, 18 figures

Related papers

A multi-sender decoupling theorem and simultaneous decoding for the quantum MAC

Sayantan Chakraborty, Aditya Nema, Pranab Sen

In this work, we prove a novel one-shot ‘multi-sender’ decoupling theorem generalising Dupuis' seminal single sender decoupling theorem. We start off with a multipartite quantum state, say on$A_{1}A_{2}R$, where$A_{1}, A_{2}$are treated as the two ‘sender’ systems and$R$is the reference system. We apply independent Haar random unitaries in tensor product on$A_{1}$and$A_{2}$and then send the resulting systems through a quantum channel. We want the channel output$B$to be almost in tensor with the untouched reference$R$. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over a$k$-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard et al. [20] in the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.

IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•3 citations

One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC

Chakraborty, Sayantan, Aditya Nema, Sen, Pranab

In this work, we prove a novel one-shot multi-sender decoupling theorem generalising Dupuis result. We start off with a multipartite quantum state, say on A1 A2 R, where A1, A2 are treated as the two sender systems and R is the reference system. We apply independent Haar random unitaries in tensor product on A1 and A2 and then send the resulting systems through a quantum channel. We want the channel output B to be almost in tensor with the untouched reference R. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over a k-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard, Dein the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.

arXiv:2102.02187•Feb 3, 2021•4 citations

From Quantum Decoding to Sharp Subset Bounds: A Use Case for Extracted Mathematical Instruments

Ying Xie

Quantum communication requires a receiver to distinguish several, generally mixed, signal states. A useful theoretical question is whether errors on smaller signal alphabets can certify the error of a decoder for the full alphabet. We study this question for the pretty good measurement and present it as a use case for the programme of extracting reusable mathematical instruments from a large collection of research manuscripts. A constrained spectral optimization mechanism identified in that collection leads to the sharp pairwise coefficient (1 + sqrt(1 - 2/N))^2 for all equally likely pure ensembles. A separate matrix analysis proves the sharp coefficient (1 + sqrt(1 - k/N))^2 for every subset size when the average state is maximally mixed on its support, allowing arbitrary mixed signals. For general mixed ensembles, the sharp leave-one coefficient (1 + 1/sqrt(N))^2 holds whenever the normalized full error is at least 1/N; consequently it holds for all equally likely ensembles in dimension at most N - 1. We give a noisy qutrit decoding example, an unrestricted bound for nearly full subsets, and an exact polynomial certificate for a further four-signal family. The account separates the extracted mechanisms, their classical antecedents, and the additional arguments needed for the quantum problem. These results provide conditional error certificates, while the unrestricted sharp mixed-state subset problem and improvements to operational communication rates remain open.

•Oct 17, 2026•0 citations

Applications of position-based coding to classical communication over quantum channels

Haoyu Qi, Qingle Wang, Mark M. Wilde

Abstract Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in the entanglement-assisted setting in order to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds. We also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine achievable rate regions for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Rényi-two entropies and conditional quantum entropies.

arXiv:1704.01361•Journal of Physics A Mathematical and Theoretical•Sep 19, 2018•54 citations

Applications of position-based coding to classical communication over quantum channels

Haoyu Qi, Qingle Wang, Mark M. Wilde

We exploit a coding technique called position-based coding in the entanglement-assisted setting to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds, and we also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine an achievable rate region for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Rényi-two entropies and conditional quantum entropies.

IEEE Information Theory Workshop (ITW)•Nov 1, 2017•10 citations

Sharp pairwise reduction for quantum hypothesis testing

Kuan-Yi Lee, Ludovico Lami

We determine the optimal universal coefficient in a reduction of multiple to binary quantum hypothesis testing. Specifically, for every finite ensemble in any Hilbert space dimension (finite or infinite), we prove that the error probability of the global pretty good measurement (PGM) is at most four times the sum of the optimal binary error probabilities. By constructing a family of regular-simplex ensembles, we further show that the coefficient four is optimal, even for arbitrary global measurements. This result improves on the pairwise bounds established by Cheng and Liu [arXiv:2606.06246 (2026)] and entails an explicit, sharp guarantee for the standard PGM itself. Our proof is also simpler: rather than constructing sequential measurements and applying a union bound, our proof relies on purely matrix-analytic techniques, combining a direct block Gram matrix analysis of the PGM error and a refined inequality between quantum Hellinger distance and Bures $χ^2$-divergence. Our analysis also yields a refined, one-shot pairwise Chernoff bound and explicit sufficient number of copies for a desired discrimination error.

quant-pharXiv:2609.28440•Sep 24, 2026•2 citations
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.
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 kkk 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 Pe≤dk(δ)+Ck(δ)a+bP_e\le d_k(\delta)+C_k(\delta)a+bPe​≤dk​(δ)+Ck​(δ)a+b, where aaa sums correct-message rejection probabilities, bbb sums competing-message acceptance probabilities, dk(δ)=1−(1−δ)kd_k(\delta)=\sqrt{1-(1-\delta)^k}dk​(δ)=1−(1−δ)k​, and Ck(δ)=(1−1−δ)−kC_k(\delta)=(1-\sqrt{1-\delta})^{-k}Ck​(δ)=(1−1−δ​)−k. Constants are independent of output dimension and message sizes. Holding label-removal error fixed gives a rejection coefficient scaling as 2O(klog⁡k)2^{O(k\log k)}2O(klogk), 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 kkk, 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.
In this work, we prove a novel one-shot ‘multi-sender’ decoupling theorem generalising Dupuis' seminal single sender decoupling theorem. We start off with a multipartite quantum state, say onA1A2RA_{1}A_{2}RA1​A2​R, whereA1,A2A_{1}, A_{2}A1​,A2​are treated as the two ‘sender’ systems andRRRis the reference system. We apply independent Haar random unitaries in tensor product onA1A_{1}A1​andA2A_{2}A2​and then send the resulting systems through a quantum channel. We want the channel outputBBBto be almost in tensor with the untouched referenceRRR. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over akkk-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard et al. [20] in the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.
In this work, we prove a novel one-shot multi-sender decoupling theorem generalising Dupuis result. We start off with a multipartite quantum state, say on A1 A2 R, where A1, A2 are treated as the two sender systems and R is the reference system. We apply independent Haar random unitaries in tensor product on A1 and A2 and then send the resulting systems through a quantum channel. We want the channel output B to be almost in tensor with the untouched reference R. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over a k-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard, Dein the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.
Quantum communication requires a receiver to distinguish several, generally mixed, signal states. A useful theoretical question is whether errors on smaller signal alphabets can certify the error of a decoder for the full alphabet. We study this question for the pretty good measurement and present it as a use case for the programme of extracting reusable mathematical instruments from a large collection of research manuscripts. A constrained spectral optimization mechanism identified in that collection leads to the sharp pairwise coefficient (1 + sqrt(1 - 2/N))^2 for all equally likely pure ensembles. A separate matrix analysis proves the sharp coefficient (1 + sqrt(1 - k/N))^2 for every subset size when the average state is maximally mixed on its support, allowing arbitrary mixed signals. For general mixed ensembles, the sharp leave-one coefficient (1 + 1/sqrt(N))^2 holds whenever the normalized full error is at least 1/N; consequently it holds for all equally likely ensembles in dimension at most N - 1. We give a noisy qutrit decoding example, an unrestricted bound for nearly full subsets, and an exact polynomial certificate for a further four-signal family. The account separates the extracted mechanisms, their classical antecedents, and the additional arguments needed for the quantum problem. These results provide conditional error certificates, while the unrestricted sharp mixed-state subset problem and improvements to operational communication rates remain open.
Abstract Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in the entanglement-assisted setting in order to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds. We also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine achievable rate regions for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Rényi-two entropies and conditional quantum entropies.
We exploit a coding technique called position-based coding in the entanglement-assisted setting to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds, and we also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine an achievable rate region for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Rényi-two entropies and conditional quantum entropies.
We determine the optimal universal coefficient in a reduction of multiple to binary quantum hypothesis testing. Specifically, for every finite ensemble in any Hilbert space dimension (finite or infinite), we prove that the error probability of the global pretty good measurement (PGM) is at most four times the sum of the optimal binary error probabilities. By constructing a family of regular-simplex ensembles, we further show that the coefficient four is optimal, even for arbitrary global measurements. This result improves on the pairwise bounds established by Cheng and Liu [arXiv:2606.06246 (2026)] and entails an explicit, sharp guarantee for the standard PGM itself. Our proof is also simpler: rather than constructing sequential measurements and applying a union bound, our proof relies on purely matrix-analytic techniques, combining a direct block Gram matrix analysis of the PGM error and a refined inequality between quantum Hellinger distance and Bures χ2χ^2χ2-divergence. Our analysis also yields a refined, one-shot pairwise Chernoff bound and explicit sufficient number of copies for a desired discrimination error.