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

Overcoming Traditional No-Go Theorems: Quantum Advantage in Multiple Access Channels

Ananya Chakraborty, Sahil Gopalkrishna Naik, Edwin Peter Lobo, Ram Krishna Patra, Samrat Sen, Mir Alimuddin, Amit Mukherjee, Manik Banik

Published Sep 29, 2023• 0 citations
arXivHTMLPDF

Abstract

Extension of point-to-point communication model to the realm of multi-node configurations finds a plethora of applications in internet and telecommunication networks. Here, we establish a novel advantage of quantum communication in a commonly encountered network configuration known as the Multiple Access Channel (MAC). A MAC consists of multiple distant senders aiming to send their respective messages to a common receiver. Unlike the quantum superdense coding protocol, the advantage reported here is realized without invoking entanglement between the senders and the receiver. Notably, such an advantage is unattainable in traditional point-to-point communication involving one sender and one receiver, where the limitations imposed by the Holevo and Frankel Weiner no-go theorems come into play. Within the MAC setup, this distinctive advantage materializes through the receiver's unique ability to simultaneously decode the quantum systems received from multiple senders. Intriguingly, some of our MAC designs draw inspiration from various other constructs in quantum foundations, such as the Pusey-Barrett-Rudolph theorem and the concept of `nonlocality without entanglement', originally explored for entirely different purposes. Beyond its immediate applications in network communication, the presented quantum advantage hints at a profound connection with the concept of `quantum nonlocality without inputs' and holds the potential for semi-device-independent certification of entangled measurements.

DOI
10.48550/arxiv.2309.17263

Related papers

Unlocking the advantage of qubit communication in multi-node network configurations

Ananya Chakraborty, Sahil Gopalkrishna Naik, Edwin Peter Lobo +5 more

Abstract The extension of point-to-point communication to multi-node configurations has significant applications in internet and telecommunication networks. Quantum resources promise notable advantages in such settings. Here, we demonstrate a novel quantum advantage in simulating multiple access channels (MACs)-a common network configuration where multiple distant senders transmit messages to a single receiver (e.g. the uplink from several mobile phones to a server). Specifically, we show that qubit transmission outperforms its classical counterpart, even when the latter is supplemented with classical shared randomness. Remarkably, unlike the seminal quantum superdense coding protocol, this advantage is achieved without any pre-shared entanglement between the senders and the receiver-a feat prohibited by Holevo and Frenkel–Weiner no-go theorems in the one-sender-one-receiver scenario. The receiver’s ability to simultaneously decode quantum systems from multiple senders underpins this distinct advantage in the MAC setup. Some of our MAC designs are inspired by constructs in quantum foundations, such as the Pusey–Barrett–Rudolph theorem and ‘quantum nonlocality without entanglement’. Beyond network applications, this quantum advantage reveals a deeper connection to ‘quantum nonlocality without inputs’ phenomenon and suggests potential for semi-device-independent certification of entangled measurements.

New Journal of Physics•Feb 1, 2025•2 citations

Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels

Haowei Shi, Min-Hsiu Hsieh, Saikat Guha +2 more

Abstract We solve the entanglement-assisted (EA) classical capacity region of quantum multiple-access channels (MACs) with an arbitrary number of senders. As an example, we consider the bosonic thermal-loss MAC and solve the one-shot capacity region enabled by an entanglement source composed of sender-receiver pairwise two-mode squeezed vacuum states. The EA capacity region is strictly larger than the capacity region without entanglement-assistance. With two-mode squeezed vacuum states as the source and phase modulation as the encoding, we also design practical receiver protocols to realize the entanglement advantages. Four practical receiver designs, based on optical parametric amplifiers, are given and analyzed. In the parameter region of a large noise background, the receivers can enable a simultaneous rate advantage of 82.0% for each sender. Due to teleportation and superdense coding, our results for EA classical communication can be directly extended to EA quantum communication at half of the rates. Our work provides a unique and practical network communication scenario where entanglement can be beneficial.

arXiv:2101.12173•npj Quantum Information•May 19, 2021•26 citations

Computation-Aided Classical-Quantum Multiple Access to Boost Network Communication Speeds

Masahito Hayashi, M. A. Vázquez‐Castro

A multiple access channel (MAC) consists of multiple senders simultaneously transmitting their messages to a single receiver. For the classical-quantum case (CQ MAC), achievable rates are known assuming that all the messages are decoded, a common assumption in quantum network design. However, such a conventional design approach ignores the global network structure, i.e., the network topology. When a CQ MAC is given as a part of quantum network communication, this work shows that computation properties can be used to boost communication speeds with code design dependent on the network topology. We quantify achievable quantum communication rates of codes with the computation property for a two-sender CQ MAC. When the two-sender CQ MAC is a boson coherent channel with binary discrete modulation, we show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design. Further, such a rate can be achieved by different detection methods: quantum (with and without quantum memory), on-off photon counting, and homodyne (each at different photon power). Finally, we describe two practical applications, one of which cryptographic.

arXiv:2105.14505•Physical Review Applied•Nov 10, 2021•18 citations

Topology-independent quantum advantage in communication networks

Ankush Pandit, V. N. S. Meghanath Ashtakala, Leon George Padayatty +1 more

Quantum communication can outperform classical communication in a variety of information-processing tasks, but such advantages are typically established for a fixed communication network. Here we introduce topology-independent quantum advantage, in which a quantum protocol outperforms every classical protocol subject to the same communication constraint, irrespective of how the classical communication resource is distributed among the parties or which communication topology is employed, even when the parties may share unlimited classical randomness. We first demonstrate this phenomenon through a simple three-party equality task: two senders receive ternary classical inputs, while an input-free receiver determines whether the inputs are equal. We then formulate a general framework for topology-independent communication and completely characterize the corresponding classical correlation polytope in the minimal three-party scenario. Its facet inequalities reveal several instances of topology-independent quantum advantage. Remarkably, one of these inequalities enables the semi-device-independent certification of a nonunitary quantum channel, while another certifies a sequential quantum network topology without any prior assumption about the network configuration. Finally, we extend the framework to four-party networks, characterize the relevant classical communication structures, and identify a communication task exhibiting quantum advantages against all admissible classical topologies. Our results establish topology independence as a genuine and robust form of quantum advantage in communication networks.

quant-pharXiv:2610.04734•Oct 6, 2026•0 citations

Playing games with multiple access channels

Felix Leditzky, Mohammad A. Alhejji, Joshua Levin +1 more

Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station. The optimal performance of a MAC is quantified by a capacity region of simultaneously achievable communication rates. We study the two-sender classical MAC, the simplest and best-understood network, and find a surprising richness in both a classical and quantum context. First, we find that quantum entanglement shared between senders can substantially boost the capacity of a classical MAC. Second, we find that optimal performance of a MAC with bounded-size inputs may require unbounded amounts of entanglement. Third, determining whether a perfect communication rate is achievable using finite-dimensional entanglement is undecidable. Finally, we show that evaluating the capacity region of a two-sender classical MAC is in fact NP-hard.

arXiv:1909.02479•Nature Communications•Mar 20, 2020•64 citations

Quantum Advantage: A Single Qubit’s Experimental Edge in Classical Data Storage

Chen Ding, Edwin Peter Lobo, Mir Alimuddin +5 more

We implement an experiment on a photonic quantum processor establishing efficacy of the elementary quantum system in classical information storage. The advantage is established by considering a class of simple bipartite games played with the communication resource qubit and classical bit (c bit), respectively. Conventional wisdom, supported by the no-go theorems of Holevo and Frenkel-Weiner, suggests that such a quantum advantage is unattainable when the sender and receiver share randomness or classical correlations. However, our results reveal a quantum advantage in a scenario devoid of any shared randomness. Our experiment involves the development of a variational triangular polarimeter, enabling the realization of positive operator value measurements crucial for establishing the targeted quantum advantage. Beyond showcasing a robust communication advantage with a single qubit, our work paves the way for immediate applications in near-term quantum technologies. It provides a semi-device-independent certification scheme for quantum encoding-decoding systems and offers an efficient method for information loading and transmission in quantum networks.

arXiv:2403.02659•Physical Review Letters•Nov 13, 2024•3 citations
Extension of point-to-point communication model to the realm of multi-node configurations finds a plethora of applications in internet and telecommunication networks. Here, we establish a novel advantage of quantum communication in a commonly encountered network configuration known as the Multiple Access Channel (MAC). A MAC consists of multiple distant senders aiming to send their respective messages to a common receiver. Unlike the quantum superdense coding protocol, the advantage reported here is realized without invoking entanglement between the senders and the receiver. Notably, such an advantage is unattainable in traditional point-to-point communication involving one sender and one receiver, where the limitations imposed by the Holevo and Frankel Weiner no-go theorems come into play. Within the MAC setup, this distinctive advantage materializes through the receiver's unique ability to simultaneously decode the quantum systems received from multiple senders. Intriguingly, some of our MAC designs draw inspiration from various other constructs in quantum foundations, such as the Pusey-Barrett-Rudolph theorem and the concept of nonlocality without entanglement', originally explored for entirely different purposes. Beyond its immediate applications in network communication, the presented quantum advantage hints at a profound connection with the concept of quantum nonlocality without inputs' and holds the potential for semi-device-independent certification of entangled measurements.
Abstract The extension of point-to-point communication to multi-node configurations has significant applications in internet and telecommunication networks. Quantum resources promise notable advantages in such settings. Here, we demonstrate a novel quantum advantage in simulating multiple access channels (MACs)-a common network configuration where multiple distant senders transmit messages to a single receiver (e.g. the uplink from several mobile phones to a server). Specifically, we show that qubit transmission outperforms its classical counterpart, even when the latter is supplemented with classical shared randomness. Remarkably, unlike the seminal quantum superdense coding protocol, this advantage is achieved without any pre-shared entanglement between the senders and the receiver-a feat prohibited by Holevo and Frenkel–Weiner no-go theorems in the one-sender-one-receiver scenario. The receiver’s ability to simultaneously decode quantum systems from multiple senders underpins this distinct advantage in the MAC setup. Some of our MAC designs are inspired by constructs in quantum foundations, such as the Pusey–Barrett–Rudolph theorem and ‘quantum nonlocality without entanglement’. Beyond network applications, this quantum advantage reveals a deeper connection to ‘quantum nonlocality without inputs’ phenomenon and suggests potential for semi-device-independent certification of entangled measurements.
Abstract We solve the entanglement-assisted (EA) classical capacity region of quantum multiple-access channels (MACs) with an arbitrary number of senders. As an example, we consider the bosonic thermal-loss MAC and solve the one-shot capacity region enabled by an entanglement source composed of sender-receiver pairwise two-mode squeezed vacuum states. The EA capacity region is strictly larger than the capacity region without entanglement-assistance. With two-mode squeezed vacuum states as the source and phase modulation as the encoding, we also design practical receiver protocols to realize the entanglement advantages. Four practical receiver designs, based on optical parametric amplifiers, are given and analyzed. In the parameter region of a large noise background, the receivers can enable a simultaneous rate advantage of 82.0% for each sender. Due to teleportation and superdense coding, our results for EA classical communication can be directly extended to EA quantum communication at half of the rates. Our work provides a unique and practical network communication scenario where entanglement can be beneficial.
A multiple access channel (MAC) consists of multiple senders simultaneously transmitting their messages to a single receiver. For the classical-quantum case (CQ MAC), achievable rates are known assuming that all the messages are decoded, a common assumption in quantum network design. However, such a conventional design approach ignores the global network structure, i.e., the network topology. When a CQ MAC is given as a part of quantum network communication, this work shows that computation properties can be used to boost communication speeds with code design dependent on the network topology. We quantify achievable quantum communication rates of codes with the computation property for a two-sender CQ MAC. When the two-sender CQ MAC is a boson coherent channel with binary discrete modulation, we show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design. Further, such a rate can be achieved by different detection methods: quantum (with and without quantum memory), on-off photon counting, and homodyne (each at different photon power). Finally, we describe two practical applications, one of which cryptographic.
Quantum communication can outperform classical communication in a variety of information-processing tasks, but such advantages are typically established for a fixed communication network. Here we introduce topology-independent quantum advantage, in which a quantum protocol outperforms every classical protocol subject to the same communication constraint, irrespective of how the classical communication resource is distributed among the parties or which communication topology is employed, even when the parties may share unlimited classical randomness. We first demonstrate this phenomenon through a simple three-party equality task: two senders receive ternary classical inputs, while an input-free receiver determines whether the inputs are equal. We then formulate a general framework for topology-independent communication and completely characterize the corresponding classical correlation polytope in the minimal three-party scenario. Its facet inequalities reveal several instances of topology-independent quantum advantage. Remarkably, one of these inequalities enables the semi-device-independent certification of a nonunitary quantum channel, while another certifies a sequential quantum network topology without any prior assumption about the network configuration. Finally, we extend the framework to four-party networks, characterize the relevant classical communication structures, and identify a communication task exhibiting quantum advantages against all admissible classical topologies. Our results establish topology independence as a genuine and robust form of quantum advantage in communication networks.
Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station. The optimal performance of a MAC is quantified by a capacity region of simultaneously achievable communication rates. We study the two-sender classical MAC, the simplest and best-understood network, and find a surprising richness in both a classical and quantum context. First, we find that quantum entanglement shared between senders can substantially boost the capacity of a classical MAC. Second, we find that optimal performance of a MAC with bounded-size inputs may require unbounded amounts of entanglement. Third, determining whether a perfect communication rate is achievable using finite-dimensional entanglement is undecidable. Finally, we show that evaluating the capacity region of a two-sender classical MAC is in fact NP-hard.
We implement an experiment on a photonic quantum processor establishing efficacy of the elementary quantum system in classical information storage. The advantage is established by considering a class of simple bipartite games played with the communication resource qubit and classical bit (c bit), respectively. Conventional wisdom, supported by the no-go theorems of Holevo and Frenkel-Weiner, suggests that such a quantum advantage is unattainable when the sender and receiver share randomness or classical correlations. However, our results reveal a quantum advantage in a scenario devoid of any shared randomness. Our experiment involves the development of a variational triangular polarimeter, enabling the realization of positive operator value measurements crucial for establishing the targeted quantum advantage. Beyond showcasing a robust communication advantage with a single qubit, our work paves the way for immediate applications in near-term quantum technologies. It provides a semi-device-independent certification scheme for quantum encoding-decoding systems and offers an efficient method for information loading and transmission in quantum networks.