ترغب بنشر مسار تعليمي؟ اضغط هنا

Entanglement-Enhanced Classical Communication over a Noisy Classical Channel

177   0   0.0 ( 0 )
 نشر من قبل William Matthews
 تاريخ النشر 2010
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

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 ch longer than the temporal separation between consecutive uses of the channel. In this setting, introducing entanglement between two photons travelling down the fiber allows one to encode reliably up to one bit of information into their joint polarization degree of freedom. When no quantum correlations between two separate uses of the channel are allowed, this capacity is reduced by a factor of more than three. We demonstrated this effect using a fiber-coupled source of entagled photon pairs based on spontaneous parametric down-conversion, and a linear-optics Bell state measurement.
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 mptotically by using an infinite number of channels. However, it is less understood to what extent the communication capacity can be reached if one uses a finite number of channels, which is a topic of practical importance. In this paper, we study the capacity of Gaussian communication, i.e., employing Gaussian states and Gaussian measurements to encode and decode information under a single-channel use. We prove that the optimal capacity of single-channel Gaussian communication is achieved by one of two well-known protocols, i.e., coherent-state communication or squeezed-state communication, depending on the energy (number of photons) as well as the characteristics of the channel. Our result suggests that the coherent-state scheme known to achieve the ultimate information-theoretic capacity is not a practically optimal scheme for the case of using a finite number of channels. We find that overall the squeezed-state communication is optimal in a small-photon-number regime whereas the coherent-state communication performs better in a large-photon-number regime.
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 . It has been an open question to determine whether entanglement can ever increase the zero-error communication rates achievable in the limit of many channel uses. In this paper we show, by explicit examples, that entanglement can indeed increase asymptotic zero-error capacity, even to the extent that it is equal to the normal capacity of the channel. Interestingly, our examples are based on the exceptional simple root systems E7 and E8.
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 the target state, given a certain number of performed measurements n. Entangled measurements constitute the globally optimal strategy and achieve the scaling that epsilon is inversely proportional to n. Recent advances show that it is possible to achieve the same scaling simply with non-adaptive local measurements, however, the performance is still worse than the globally optimal bound up to a constant factor. In this work, by introducing classical communication, we experimentally implement an adaptive quantum state verification. The constant-factor is minimized from ~2.5 to 1.5 in this experiment, which means that only 60% measurements are required to achieve a certain value of epsilon compared to optimal non-adaptive local strategy. Our results indicate that classical communication significantly enhances the performance of quantum state verification, and leads to an efficiency that further approaches the globally optimal bound.
493 - Bing He , Janos A. Bergou 2008
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 , 022301 (2001), PRL 83, 1455 (1999)] of generating maximally entangled states if applied to entanglement concentration. Such strategy also dispenses with the interaction with an ancilla system in the implementation. We also show that classical communications are indispensable in realizing the deterministic transformations of a single bipartite entangled state. With a finite number of identical pairs of two entangled bosons, on the other hand, we can realize the deterministic transformation to any target entangled state of equal or less Schmidt rank through an extension of the scheme.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا