We present and experimentally demonstrate a communication protocol that employs shared entanglement to reduce errors when sending a bit over a particular noisy classical channel.Specifically, it is shown that given a single use of this channel, one can transmit a bit with higher success probability when the sender and receiver share entanglement compared to the best possible strategy when they do not.The experiment is realized using polarization-entangled photon pairs, whose quantum correlations play a critical role in both the encoding and decoding of the classical message.Experimentally, we find that a bit can be successfully transmitted with probability 0:891 Æ 0:002, which is close to the theoretical maximum of ð2 þ 2 À1=2 Þ=3 % 0:902 and is significantly above the optimal classical strategy, which yields 5=6 % 0:833.We present and experimentally demonstrate a communication protocol that employs shared entanglement to reduce errors when sending a bit over a particular noisy classical channel.Specifically, it is shown that given a single use of this channel, one can transmit a bit with higher success probability when the sender and receiver share entanglement compared to the best possible strategy when they do not.The experiment is realized using polarization-entangled photon pairs, whose quantum correlations play a critical role in both the encoding and decoding of the classical message.Experimentally, we find that a bit can be successfully transmitted with probability 0:891 Æ 0:002, which is close to the theoretical maximum of ð2 þ 2 À1=2 Þ=3 % 0:902 and is significantly above the optimal classical strategy, which yields 5=6 % 0:833.

PhysicsMar 14, 20111 citation

Entanglement enhancement of a noisy classical communication channel

H. T. Williams, Paul Bourdon

We present a formal quantum mechanical analysis of the communication protocol of Prevedel {\it et al.}\ [Phys. Rev. Lett. \textbf{106}, 110505 (2011)], in which entanglement shared by sender and receiver is used to enhance, beyond that achievable via the optimal classical strategy, the probability of successful transmission of a bit through a particular noisy classical channel ${\cal N}$ . We provide a full analysis of this protocol when the shared entanglement resides in a two-qubit system. Our analysis shows the measurement choices specified by the protocol yield the maximum possible enhancement of the probability of successful communication of the bit with one use of the channel ${\cal N}$ . We determine that shared entanglement residing in a two-qudit system with $d > 2$ cannot provide enhancement beyond that produced by entangled qubits. Finally, we show how the protocol should be extended when probability parameters for the channel ${\cal N}$ are allowed to vary.We present a formal quantum mechanical analysis of the communication protocol of Prevedel {\it et al.}\ [Phys. Rev. Lett. \textbf{106}, 110505 (2011)], in which entanglement shared by sender and receiver is used to enhance, beyond that achievable via the optimal classical strategy, the probability of successful transmission of a bit through a particular noisy classical channel ${\cal N}$. We provide a full analysis of this protocol when the shared entanglement resides in a two-qubit system. Our analysis shows the measurement choices specified by the protocol yield the maximum possible enhancement of the probability of successful communication of the bit with one use of the channel ${\cal N}$. We determine that shared entanglement residing in a two-qudit system with $d > 2$ cannot provide enhancement beyond that produced by entangled qubits. Finally, we show how the protocol should be extended when probability parameters for the channel ${\cal N}$ are allowed to vary.

arXiv:1109.1029Sep 5, 20110 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.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 LettersFeb 28, 20253 citations

Optimal entanglement-assisted one-shot classical communication

Brett Hemenway, Carl A. Miller, Yaoyun Shi +1 more

The one-shot success probability of a noisy classical channel for transmitting one classical bit is the optimal probability with which the bit can be successfully sent via a single use of the channel. Prevedel et al. [Phys. Rev. Lett. 106, 110505 (2011)] recently showed that for a specific channel, this quantity can be increased if the parties using the channel share an entangled quantum state. In this paper, we characterize the optimal entanglement-assisted protocols in terms of the radius of a set of operators associated with the channel. This characterization can be used to construct optimal entanglement-assisted protocols for a given classical channel and to prove the limits of such protocols. As an example, we show that the Prevedel et al. protocol is optimal for two-qubit entanglement. We also prove some tight upper bounds on the improvement that can be obtained from quantum and nonsignaling correlations.The one-shot success probability of a noisy classical channel for transmitting one classical bit is the optimal probability with which the bit can be successfully sent via a single use of the channel. Prevedel et al. [Phys. Rev. Lett. 106, 110505 (2011)] recently showed that for a specific channel, this quantity can be increased if the parties using the channel share an entangled quantum state. In this paper, we characterize the optimal entanglement-assisted protocols in terms of the radius of a set of operators associated with the channel. This characterization can be used to construct optimal entanglement-assisted protocols for a given classical channel and to prove the limits of such protocols. As an example, we show that the Prevedel et al. protocol is optimal for two-qubit entanglement. We also prove some tight upper bounds on the improvement that can be obtained from quantum and nonsignaling correlations.

arXiv:1201.1521Physical Review AJun 3, 20135 citations

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.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.17946May 28, 20240 citations

Beating the classical limits of information transmission using a quantum decoder

Robert J. Chapman, Akib Karim, Zixin Huang +3 more

Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance in data transmission by encoding a message in quantum states; however, most proposals to date have focused on the regime of a large number of uses of the noisy channel, which is unfeasible with current quantum technology. We experimentally demonstrate quantum enhanced communication over an amplitude damping noisy channel with only two uses of the channel per bit and a single entangling gate at the decoder. By simulating the channel using a photonic interferometric setup, we experimentally increase the reliability of transmitting a data bit by greater than $20%$ for a certain damping range over classically sending the message twice. We show how our methodology can be extended to larger systems by simulating the transmission of a single bit with up to eight uses of the channel and a two-bit message with three uses of the channel, predicting a quantum enhancement in all cases.Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance in data transmission by encoding a message in quantum states; however, most proposals to date have focused on the regime of a large number of uses of the noisy channel, which is unfeasible with current quantum technology. We experimentally demonstrate quantum enhanced communication over an amplitude damping noisy channel with only two uses of the channel per bit and a single entangling gate at the decoder. By simulating the channel using a photonic interferometric setup, we experimentally increase the reliability of transmitting a data bit by greater than $20%$ for a certain damping range over classically sending the message twice. We show how our methodology can be extended to larger systems by simulating the transmission of a single bit with up to eight uses of the channel and a two-bit message with three uses of the channel, predicting a quantum enhancement in all cases.

arXiv:1704.07036Physical Review AJan 16, 201811 citations

{\cal N}

. We provide a full analysis of this protocol when the shared entanglement resides in a two-qubit system. Our analysis shows the measurement choices specified by the protocol yield the maximum possible enhancement of the probability of successful communication of the bit with one use of the channel

{\cal N}

. We determine that shared entanglement residing in a two-qudit system with

d > 2

cannot provide enhancement beyond that produced by entangled qubits. Finally, we show how the protocol should be extended when probability parameters for the channel

{\cal N}

are allowed to vary.

20%

for a certain damping range over classically sending the message twice. We show how our methodology can be extended to larger systems by simulating the transmission of a single bit with up to eight uses of the channel and a two-bit message with three uses of the channel, predicting a quantum enhancement in all cases.