ﻻ يوجد ملخص باللغة العربية
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 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 pm 0.002, which is close to the theoretical maximum of (2 + 2^-1/2)/3 simeq 0.902 and is significantly above the optimal classical strategy, which yields 5/6 simeq 0.833.
We present an experiment demonstrating entanglement-enhanced classical communication capacity of a quantum channel with correlated noise. The channel is modelled by a fiber optic link exhibiting random birefringence that fluctuates on a time scale mu
A long-standing problem on the classical capacity of bosonic Gaussian channels has recently been resolved by proving the minimum output entropy conjecture. It is also known that the ultimate capacity quantified by the Holevo bound can be achieved asy
It is known that the number of different classical messages which can be communicated with a single use of a classical channel with zero probability of decoding error can sometimes be increased by using entanglement shared between sender and receiver
Quantum state verification provides an efficient approach to characterize the reliability of quantum devices for generating certain target states. The figure of merit of a specific strategy is the estimated infidelity $epsilon$ of the tested state to
We present an optimal scheme to realize the transformations between single copies of two bipartite entangled states without classical communication between the sharing parties. The scheme achieves the upper bound for the success probabilities [PRA 63