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:2012.15459 · PRX Quantum

Random-Receiver Quantum Communication

Some Sankar Bhattacharya, Ananda G. Maity, Tamal Guha, Giulio Chiribella, Manik Banik

Published Jun 30, 2021• 27 citations
arXivHTMLPDF

Abstract

We introduce the task of random-receiver quantum communication, in which a sender transmits a quantum message to a receiver selected from a list of n spatially separated parties.At the moment of transmission, the choice of receiver is unknown to the sender.Later, it becomes known to the n parties, who coordinate their actions by exchanging classical messages.In normal conditions, random-receiver quantum communication requires a noiseless quantum communication channel between the sender and each of the n receivers.In contrast, we show that random-receiver quantum communication can take place through noisy, entanglement-breaking channels if the order of such channels is coherently controlled by a quantum bit that is accessible through measurements.While this phenomenon is achieved with a single control qubit, it cannot be mimicked by adding a noiseless qubit channel from the sender to any of the receivers, or more generally, from the sender to any subset of k < n parties.

DOI
10.1103/prxquantum.2.020350

Related papers

The communication power of a noisy qubit

Giulio Chiribella, Saptarshi Roy, Tamal Guha +1 more

A fundamental limitation of quantum communication is that a single qubit can carry at most 1 bit of classical information. For an important class of quantum communication channels, known as entanglement-breaking, this limitation holds even if the sender and receiver share entangled particles. But does this mean that, for the purpose of communicating classical messages, a noisy entanglement-breaking qubit channel can be replaced by a noisy bit channel? Here we answer the question in the negative. We introduce a game, similar to the Monty Hall problem in classical statistics, where a sender assists a receiver in finding a valuable item (the prize) hidden into one of four possible boxes, while avoiding a hazardous item (the bomb) hidden in one of the remaining three boxes. We show that no classical strategy using a noisy bit channel can ensure that the bomb is avoided, even if the sender and receiver share arbitrary amounts of randomness. In contrast, communication of a qubit through a class of noisy entanglement-breaking channels, which we call quantum NOT channels, allows the players to deterministically avoid the bomb and to find the prize with a guaranteed nonzero probability. Our findings show that the communication of classical messages through a noisy entanglement-breaking qubit channel assisted by quantum entanglement cannot, in general, be simulated by communication through a noisy bit channel assisted by classical correlations.

arXiv:2405.17946•May 28, 2024•0 citations

Communication Power of a Noisy Qubit

Giulio Chiribella, Saptarshi Roy, Tamal Guha +1 more

A fundamental limitation of quantum communication is that a single qubit can carry at most one bit of classical information. For an important class of quantum communication channels, known as entanglement breaking, this limitation holds even if the sender and receiver share entangled particles. But does this mean that, for the purpose of communicating classical messages, a noisy entanglement-breaking qubit channel can be replaced by a noisy bit channel? Here we answer the question in the negative. We introduce a game, similar to the Monty Hall problem in classical statistics, where a sender assists a receiver in finding a valuable item (the "prize") hidden in one of four possible boxes, while avoiding a hazardous item (the "bomb") hidden in one of the remaining three boxes. We show that no classical strategy using a noisy bit channel can ensure that the bomb is avoided, even if the sender and receiver share arbitrary amounts of randomness. In contrast, communication of a qubit through a class of noisy entanglement-breaking channels, which we call quantum not channels, allows the players to deterministically avoid the bomb and to find the prize with a guaranteed nonzero probability. Our findings show that the communication of classical messages through a noisy entanglement-breaking qubit channel assisted by quantum entanglement cannot, in general, be simulated by communication through a noisy bit channel assisted by classical correlations.

Physical Review Letters•Feb 28, 2025•3 citations

Quantum networks boosted by entanglement with a control system

Tamal Guha, Saptarshi Roy, Giulio Chiribella

Networks of quantum devices with coherent control over their configuration offer promising advantages in quantum information processing, including quantum communication, computation, and sensing. So far, the investigation of these advantages assumed that the control system was initially uncorrelated with the data processed by the network. Here, we explore the power of quantum correlations between data and control, showing two communication tasks that can be accomplished with information-erasing channels if and only if the sender shares prior entanglement with a third party (the ``controller'') controlling the network configuration. The first task is to transmit classical messages without leaking information to the controller. The second task is to establish bipartite entanglement with a receiver, or, more generally, to establish multipartite entanglement with a number of spatially separated receivers.

arXiv:2206.05247•Physical Review Research•Sep 26, 2023•9 citations

Deterministic secure quantum communication with double-encoded single photons

Yu-Yan Wei, Zikai Gao, Siying Wang +2 more

Quantum communication is an important branch of quantum technology. It can safely transmit private information between legitimate parties and its unconditional security is guaranteed by quantum physics. So far, deterministic secure quantum communication without entanglement usually transmits single photons in two-way quantum channels. We propose a deterministic secure quantum communication proposal, and it requires a one-way quantum channel and a classical channel. In our protocol, a sender encodes logical bits by using two conjugate bases consisting of the polarization and time-bin degrees of freedom of a photon and transmits it to a receiver over a quantum channel. Upon receiving this photon, the receiver measures it randomly in two bases and can decode the bit deterministically with the help of the sender. Any attack from eavesdroppers will be detected by the legitimate parties. Furthermore, this protocol can be implemented with linear-optic elements and single-photon detectors.

Acta Physica Sinica•Jan 1, 2022•5 citations

Efficient quantum broadcast for an arbitrary number of receivers in noisy channels

Mohammad Bolokian, Ali A. Orouji, Monireh Houshmand

Abstract Quantum broadcast is a method for distributing known quantum information to multiple recipients at once. Although the no-cloning theorem prohibits copying unknown quantum states, it is still possible to transmit the same known state to different destinations. This research introduces two new approaches. The first approach allows a sender to broadcast a single qubit to n receivers using a specialized entangled state known as a 2 n -qubit cluster state. The paper illustrates this method with a detailed example for four receivers ( n = 4 ) and demonstrates its validity through implementation on the Qiskit platform. The second protocol, builds upon the first protocol and allows for broadcasting a particular class of n-qubit state to n receivers. The effects of different quantum noise types on the protocol are investigated, with the fidelity metric used to quantify the quality of broadcasted states over a noisy quantum channel. These new protocols offer more efficient ways to share quantum information, potentially paving the way for improved quantum communication networks and internet.

Journal of Physics A Mathematical and Theoretical•Aug 26, 2025•1 citation

Quantum communication in a superposition of causal orders

Sina Salek, Daniel Ebler, Giulio Chiribella

Quantum mechanics allows for situations where the relative order between two processes is entangled with a quantum degree of freedom. Here we show that such entanglement can enhance the ability to transmit quantum information over noisy communication channels. We consider two completely dephasing channels, which in normal conditions are unable to transmit any quantum information. We show that, when the two channels are traversed in an indefinite order, a quantum bit sent through them has a 25% probability to reach the receiver without any error. For partially dephasing channels, a similar advantage takes place deterministically: the amount of quantum information that can travel through two channels in a superposition of orders can be larger than the amount of quantum information that can travel through each channel individually.

arXiv:1809.06655•Sep 18, 2018•47 citations
We introduce the task of random-receiver quantum communication, in which a sender transmits a quantum message to a receiver selected from a list of n spatially separated parties.At the moment of transmission, the choice of receiver is unknown to the sender.Later, it becomes known to the n parties, who coordinate their actions by exchanging classical messages.In normal conditions, random-receiver quantum communication requires a noiseless quantum communication channel between the sender and each of the n receivers.In contrast, we show that random-receiver quantum communication can take place through noisy, entanglement-breaking channels if the order of such channels is coherently controlled by a quantum bit that is accessible through measurements.While this phenomenon is achieved with a single control qubit, it cannot be mimicked by adding a noiseless qubit channel from the sender to any of the receivers, or more generally, from the sender to any subset of k < n parties.
A fundamental limitation of quantum communication is that a single qubit can carry at most 1 bit of classical information. For an important class of quantum communication channels, known as entanglement-breaking, this limitation holds even if the sender and receiver share entangled particles. But does this mean that, for the purpose of communicating classical messages, a noisy entanglement-breaking qubit channel can be replaced by a noisy bit channel? Here we answer the question in the negative. We introduce a game, similar to the Monty Hall problem in classical statistics, where a sender assists a receiver in finding a valuable item (the prize) hidden into one of four possible boxes, while avoiding a hazardous item (the bomb) hidden in one of the remaining three boxes. We show that no classical strategy using a noisy bit channel can ensure that the bomb is avoided, even if the sender and receiver share arbitrary amounts of randomness. In contrast, communication of a qubit through a class of noisy entanglement-breaking channels, which we call quantum NOT channels, allows the players to deterministically avoid the bomb and to find the prize with a guaranteed nonzero probability. Our findings show that the communication of classical messages through a noisy entanglement-breaking qubit channel assisted by quantum entanglement cannot, in general, be simulated by communication through a noisy bit channel assisted by classical correlations.
A fundamental limitation of quantum communication is that a single qubit can carry at most one bit of classical information. For an important class of quantum communication channels, known as entanglement breaking, this limitation holds even if the sender and receiver share entangled particles. But does this mean that, for the purpose of communicating classical messages, a noisy entanglement-breaking qubit channel can be replaced by a noisy bit channel? Here we answer the question in the negative. We introduce a game, similar to the Monty Hall problem in classical statistics, where a sender assists a receiver in finding a valuable item (the "prize") hidden in one of four possible boxes, while avoiding a hazardous item (the "bomb") hidden in one of the remaining three boxes. We show that no classical strategy using a noisy bit channel can ensure that the bomb is avoided, even if the sender and receiver share arbitrary amounts of randomness. In contrast, communication of a qubit through a class of noisy entanglement-breaking channels, which we call quantum not channels, allows the players to deterministically avoid the bomb and to find the prize with a guaranteed nonzero probability. Our findings show that the communication of classical messages through a noisy entanglement-breaking qubit channel assisted by quantum entanglement cannot, in general, be simulated by communication through a noisy bit channel assisted by classical correlations.
Networks of quantum devices with coherent control over their configuration offer promising advantages in quantum information processing, including quantum communication, computation, and sensing. So far, the investigation of these advantages assumed that the control system was initially uncorrelated with the data processed by the network. Here, we explore the power of quantum correlations between data and control, showing two communication tasks that can be accomplished with information-erasing channels if and only if the sender shares prior entanglement with a third party (the ``controller'') controlling the network configuration. The first task is to transmit classical messages without leaking information to the controller. The second task is to establish bipartite entanglement with a receiver, or, more generally, to establish multipartite entanglement with a number of spatially separated receivers.
Quantum communication is an important branch of quantum technology. It can safely transmit private information between legitimate parties and its unconditional security is guaranteed by quantum physics. So far, deterministic secure quantum communication without entanglement usually transmits single photons in two-way quantum channels. We propose a deterministic secure quantum communication proposal, and it requires a one-way quantum channel and a classical channel. In our protocol, a sender encodes logical bits by using two conjugate bases consisting of the polarization and time-bin degrees of freedom of a photon and transmits it to a receiver over a quantum channel. Upon receiving this photon, the receiver measures it randomly in two bases and can decode the bit deterministically with the help of the sender. Any attack from eavesdroppers will be detected by the legitimate parties. Furthermore, this protocol can be implemented with linear-optic elements and single-photon detectors.
Abstract Quantum broadcast is a method for distributing known quantum information to multiple recipients at once. Although the no-cloning theorem prohibits copying unknown quantum states, it is still possible to transmit the same known state to different destinations. This research introduces two new approaches. The first approach allows a sender to broadcast a single qubit to n receivers using a specialized entangled state known as a 2 n -qubit cluster state. The paper illustrates this method with a detailed example for four receivers ( n = 4 ) and demonstrates its validity through implementation on the Qiskit platform. The second protocol, builds upon the first protocol and allows for broadcasting a particular class of n-qubit state to n receivers. The effects of different quantum noise types on the protocol are investigated, with the fidelity metric used to quantify the quality of broadcasted states over a noisy quantum channel. These new protocols offer more efficient ways to share quantum information, potentially paving the way for improved quantum communication networks and internet.
Quantum mechanics allows for situations where the relative order between two processes is entangled with a quantum degree of freedom. Here we show that such entanglement can enhance the ability to transmit quantum information over noisy communication channels. We consider two completely dephasing channels, which in normal conditions are unable to transmit any quantum information. We show that, when the two channels are traversed in an indefinite order, a quantum bit sent through them has a 25% probability to reach the receiver without any error. For partially dephasing channels, a similar advantage takes place deterministically: the amount of quantum information that can travel through two channels in a superposition of orders can be larger than the amount of quantum information that can travel through each channel individually.