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 · New Journal of Physics

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

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

Published Feb 1, 2025• 5 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1367-2630/adb174

Related papers

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

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•1 citation

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•70 citations

Classical analogue of quantum superdense coding and communication advantage of a single quantum system

Ram Krishna Patra, Sahil Gopalkrishna Naik, Edwin Peter Lobo +5 more

We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games cannot be won given a noiseless 1 -bit classical channel from the sender to the receiver. Interestingly, the goal can be perfectly achieved if the channel is assisted with classical shared randomness. This resembles an advantage similar to the quantum superdense coding phenomenon where pre-shared entanglement can enhance the communication utility of a perfect quantum communication line. Quite surprisingly, we show that a qubit communication without any assistance of classical shared randomness can achieve the goal, and hence establishes a novel quantum advantage in the simplest communication scenario. In pursuit of a deeper origin of this advantage, we show that an advantageous quantum strategy must invoke quantum interference both at the encoding step by the sender and at the decoding step by the receiver. We also study communication utility of a class of non-classical toy systems described by symmetric polygonal state spaces. We come up with communication tasks that can be achieved neither with 1 -bit of classical communication nor by communicating a polygon system, whereas 1 -qubit communication yields a perfect strategy, establishing quantum advantage over them. To this end, we show that the quantum advantages are robust against imperfect encodings-decodings, making the protocols implementable with presently available quantum technologies.

arXiv:2202.06796•Quantum•Apr 9, 2024•15 citations

Communication Advantages from Quantum Dense Network Coding

Ian George, Brian Doolittle

A central problem in quantum information theory is understanding how quantum resources can be used to communicate information more efficiently than classical resources. We introduce quantum dense network coding -- a protocol that transmits the output of a non-Boolean function to a receiver using provably half as many qubits as bits for each sender by not transmitting the entirety of the function inputs. We show this advantage requires both shared entanglement and quantum communication, is robust to noise, and the gap in success probability between quantum and classical communication can be amplified exponentially in the number of senders. Finally, we show that dense network coding gives rise to a novel, information-theoretically secure, quantum cryptographic protocol, which we call measurement-device-independent quantum key growing.

quant-pharXiv:2607.08133•Jul 10, 2026•1 citation

No-go theorem for generic simulation of qubit channels with finite classical resources

Sahil Gopalkrishna Naik, Mani Zartab, Nicolas Gisin +1 more

Abstract Can quantum processes be simulated using only classical resources? This question delineates the boundary between classical and quantum models and clarifies the origin of quantum advantage in information processing. We address this question through the task of quantum channel simulation, where a sender (Alice) holds the classical description of a quantum state and wishes to transmit it to a receiver (Bob) for measurement. Prior work has shown that, for qubit channels, 2 bits of forward communication with shared randomness suffice to reproduce the statistics of any single-qubit measurement. We argue, however, that true channel simulation requires reproducing statistics of joint measurements—including entangled effects—on Alice’s state and an auxiliary system held by Bob. Such scenarios naturally arise in network communication, where some nodes know the state, while others do not. We prove that a perfect qubit channel cannot be simulated with any finite amount of classical communication, even using the most general multi-round, bidirectional protocols. We further show that this no-go result is rooted in the necessity of reproducing statistics associated with entangled effects. On the other hand, we show that noisy qubit channels, such as depolarizing channels, admit classical simulation, though the required communication diverges as noise decreases.

arXiv:2501.15807•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Mar 1, 2026•1 citation
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.
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.
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 analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games cannot be won given a noiseless 1 -bit classical channel from the sender to the receiver. Interestingly, the goal can be perfectly achieved if the channel is assisted with classical shared randomness. This resembles an advantage similar to the quantum superdense coding phenomenon where pre-shared entanglement can enhance the communication utility of a perfect quantum communication line. Quite surprisingly, we show that a qubit communication without any assistance of classical shared randomness can achieve the goal, and hence establishes a novel quantum advantage in the simplest communication scenario. In pursuit of a deeper origin of this advantage, we show that an advantageous quantum strategy must invoke quantum interference both at the encoding step by the sender and at the decoding step by the receiver. We also study communication utility of a class of non-classical toy systems described by symmetric polygonal state spaces. We come up with communication tasks that can be achieved neither with 1 -bit of classical communication nor by communicating a polygon system, whereas 1 -qubit communication yields a perfect strategy, establishing quantum advantage over them. To this end, we show that the quantum advantages are robust against imperfect encodings-decodings, making the protocols implementable with presently available quantum technologies.
A central problem in quantum information theory is understanding how quantum resources can be used to communicate information more efficiently than classical resources. We introduce quantum dense network coding -- a protocol that transmits the output of a non-Boolean function to a receiver using provably half as many qubits as bits for each sender by not transmitting the entirety of the function inputs. We show this advantage requires both shared entanglement and quantum communication, is robust to noise, and the gap in success probability between quantum and classical communication can be amplified exponentially in the number of senders. Finally, we show that dense network coding gives rise to a novel, information-theoretically secure, quantum cryptographic protocol, which we call measurement-device-independent quantum key growing.
Abstract Can quantum processes be simulated using only classical resources? This question delineates the boundary between classical and quantum models and clarifies the origin of quantum advantage in information processing. We address this question through the task of quantum channel simulation, where a sender (Alice) holds the classical description of a quantum state and wishes to transmit it to a receiver (Bob) for measurement. Prior work has shown that, for qubit channels, 2 bits of forward communication with shared randomness suffice to reproduce the statistics of any single-qubit measurement. We argue, however, that true channel simulation requires reproducing statistics of joint measurements—including entangled effects—on Alice’s state and an auxiliary system held by Bob. Such scenarios naturally arise in network communication, where some nodes know the state, while others do not. We prove that a perfect qubit channel cannot be simulated with any finite amount of classical communication, even using the most general multi-round, bidirectional protocols. We further show that this no-go result is rooted in the necessity of reproducing statistics associated with entangled effects. On the other hand, we show that noisy qubit channels, such as depolarizing channels, admit classical simulation, though the required communication diverges as noise decreases.