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

IEEE Information Theory Workshop (ITW)

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

Haoyu Qi, Qingle Wang, Mark M. Wilde

Published Nov 1, 2017• 10 citations
Publisher

Abstract

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.

DOI
10.1109/itw.2017.8277938

Related papers

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

On the near-optimality of one-shot classical communication over quantum channels

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum channel, the quantum multiple-access channel, the quantum channel with a state, and the quantum broadcast channel. We show that it is possible to near-optimally characterize the amount of communication that can be transmitted in these scenarios, using the position-based decoding strategy introduced in a prior study (A. Anshu, R. Jain, and N. Warsi, https://ieee.org/document/8399830). In the process, we provide a short and elementary proof of the converse for entanglement-assisted quantum channel coding in terms of the quantum hypothesis testing divergence [obtained earlier in the work of W. Matthews and S. Wehner, IEEE Trans. Inf. Theory 60, 7317–7329 (2014)]. Our proof has the additional utility that it naturally extends to various network scenarios mentioned above. Furthermore, none of our achievability results require a simultaneous decoding strategy, existence of which is an important open question in quantum Shannon theory.

arXiv:1804.09644•Journal of Mathematical Physics•Jan 1, 2019•25 citations

Entanglement-Assisted Classical-Quantum Multiple Access Wiretap Channel: One-shot Achievable Rate Region

Hadi Aghaee, Bahareh Akhbari

In this paper, the problem of secure communication over an entanglement-assisted classical-quantum multiple access channel is studied under one-shot setting. The main employed approach to this end, is combination of simultaneous decoding and position-based decoding techniques while a recently introduced approach is used to calculate leaked information.

Iranian Conference on Electrical Engineering•May 17, 2022•2 citations

A Hypothesis Testing Approach for Communication Over Entanglement Assisted Compound Quantum Channel

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

We study the problem of communication over compound quantum channel in the presence of entanglement. Classically such channels are modeled as a collection of conditional probability distributions wherein neither the sender nor the receiver is aware of the channel being used for transmission, except for the fact that it belongs to this collection. We provide achievability and converse bounds for this problem in the one shot quantum setting in terms of quantum hypothesis testing relative-entropy. Our achievability proof is similar in spirit to its classical counterpart. To arrive at our result, we use the technique of position based decoding along with a new approach for constructing a union of two projectors, which can be of independent interest.

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

A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

We study the problem of communication over a compound quantum channel in the presence of entanglement. Classically, such a channel is modeled as a collection of conditional probability distributions wherein neither the sender nor the receiver is aware of the channel being used for transmission, except for the fact that it belongs to this collection. We provide near optimal achievability and converse bounds for this problem in the one-shot quantum setting in terms of the quantum hypothesis testing divergence. We also consider the case of informed sender, showing a one-shot achievability result that converges appropriately in the asymptotic and independent and identically distributed setting. Our achievability proof is similar in spirit to its classical counterpart. To arrive at our result, we use the technique of position-based decoding along with a new approach for constructing a union of two projectors, which might be of independent interest. We give another application of the union of projectors to the problem of testing composite quantum hypotheses.

arXiv:1706.08286•IEEE Transactions on Information Theory•Oct 16, 2018•12 citations

Computable limits of optical multiple-access communications

Haowei Shi, Quntao Zhuang

Entanglement is a valuable quantum resource in quantum information processing. In classical communication over quantum channels, it is known to boost the communication rate drastically. To generalize such a boost to more general scenarios, we provide computable limits on the communication over optical multiple-access channels (MACs) for both the entanglement-assisted and unassisted communication. For the unassisted case, we generalize the coherent-state achievable rate region and outer bound known for the thermal-loss case [B. J. Yen and J. H. Shapiro, Phys. Rev. A 72, 062312 (2005)] to general bosonic Gaussian MACs. For the assisted case, we generalize the two-mode squeezed vacuum rate region and the outer bound for the thermal-loss case [H. Shi et al., npj Quantum Inf. 7, 74 (2021)] to general bosonic MACs. In terms of the total communication rate of all senders, we prove additivity for general MACs, generalizing the two-sender version in M.-H. Hsieh et al., IEEE Trans. Inf. Theory 54, 3078 (2008). Furthermore, for optical communication modeled as phase-insensitive bosonic Gaussian MACs, we prove that the optimal total rate is achieved by Gaussian entanglement and therefore can be efficiently evaluated. The computable limits confirm entanglement's boosts in optical multiple-access communications. Finally, we formulate an entanglement-assisted version of minimum entropy conjecture, which leads to the additivity of the capacity region of phase-insensitive bosonic Gaussian MACs if it is true.

arXiv:2110.01681•Physical Review A•Feb 22, 2022•4 citations
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.
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 study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum channel, the quantum multiple-access channel, the quantum channel with a state, and the quantum broadcast channel. We show that it is possible to near-optimally characterize the amount of communication that can be transmitted in these scenarios, using the position-based decoding strategy introduced in a prior study (A. Anshu, R. Jain, and N. Warsi, https://ieee.org/document/8399830). In the process, we provide a short and elementary proof of the converse for entanglement-assisted quantum channel coding in terms of the quantum hypothesis testing divergence [obtained earlier in the work of W. Matthews and S. Wehner, IEEE Trans. Inf. Theory 60, 7317–7329 (2014)]. Our proof has the additional utility that it naturally extends to various network scenarios mentioned above. Furthermore, none of our achievability results require a simultaneous decoding strategy, existence of which is an important open question in quantum Shannon theory.
We study the problem of communication over compound quantum channel in the presence of entanglement. Classically such channels are modeled as a collection of conditional probability distributions wherein neither the sender nor the receiver is aware of the channel being used for transmission, except for the fact that it belongs to this collection. We provide achievability and converse bounds for this problem in the one shot quantum setting in terms of quantum hypothesis testing relative-entropy. Our achievability proof is similar in spirit to its classical counterpart. To arrive at our result, we use the technique of position based decoding along with a new approach for constructing a union of two projectors, which can be of independent interest.
We study the problem of communication over a compound quantum channel in the presence of entanglement. Classically, such a channel is modeled as a collection of conditional probability distributions wherein neither the sender nor the receiver is aware of the channel being used for transmission, except for the fact that it belongs to this collection. We provide near optimal achievability and converse bounds for this problem in the one-shot quantum setting in terms of the quantum hypothesis testing divergence. We also consider the case of informed sender, showing a one-shot achievability result that converges appropriately in the asymptotic and independent and identically distributed setting. Our achievability proof is similar in spirit to its classical counterpart. To arrive at our result, we use the technique of position-based decoding along with a new approach for constructing a union of two projectors, which might be of independent interest. We give another application of the union of projectors to the problem of testing composite quantum hypotheses.
Entanglement is a valuable quantum resource in quantum information processing. In classical communication over quantum channels, it is known to boost the communication rate drastically. To generalize such a boost to more general scenarios, we provide computable limits on the communication over optical multiple-access channels (MACs) for both the entanglement-assisted and unassisted communication. For the unassisted case, we generalize the coherent-state achievable rate region and outer bound known for the thermal-loss case [B. J. Yen and J. H. Shapiro, Phys. Rev. A 72, 062312 (2005)] to general bosonic Gaussian MACs. For the assisted case, we generalize the two-mode squeezed vacuum rate region and the outer bound for the thermal-loss case [H. Shi et al., npj Quantum Inf. 7, 74 (2021)] to general bosonic MACs. In terms of the total communication rate of all senders, we prove additivity for general MACs, generalizing the two-sender version in M.-H. Hsieh et al., IEEE Trans. Inf. Theory 54, 3078 (2008). Furthermore, for optical communication modeled as phase-insensitive bosonic Gaussian MACs, we prove that the optimal total rate is achieved by Gaussian entanglement and therefore can be efficiently evaluated. The computable limits confirm entanglement's boosts in optical multiple-access communications. Finally, we formulate an entanglement-assisted version of minimum entropy conjecture, which leads to the additivity of the capacity region of phase-insensitive bosonic Gaussian MACs if it is true.