ﻻ يوجد ملخص باللغة العربية
It has been conjectured that counterfactual communication is impossible, even for post-selected quantum particles. We strongly challenge this by proposing exactly such a counterfactual scheme where---unambiguously---none of Alices photons that contribute to the message from Bob have been to Bob. We demonstrate counterfactuality experimentally by means of weak measurements, as well as conceptually using consistent histories---thus simultaneously closing both loopholes. Importantly, the fidelity of Alice learning Bobs bit can be made arbitrarily close to unity.
A series of recent works has shown that placing communication channels in a coherent superposition of alternative configurations can boost their ability to transmit information. Instances of this phenomenon are the advantages arising from the use of
A $((k,n))$ quantum threshold secret sharing (QTS) scheme is a quantum cryptographic protocol for sharing a quantum secret among $n$ parties such that the secret can be recovered by any $k$ or more parties while $k-1$ or fewer parties have no informa
A recent quantum protocol for counterfactual communication [Y. Aharonov and L. Vaidman, Phys. Rev. A 99, 010103(R), 2019] relies on post-selection to eliminate the weak trace in the transmission channel. We show that the post-selection in this protoc
We consider the problem of transmitting classical and quantum information reliably over an entanglement-assisted quantum channel. Our main result is a capacity theorem that gives a three-dimensional achievable rate region. Points in the region are ra
Given one or more uses of a classical channel, only a certain number of messages can be transmitted with zero probability of error. The study of this number and its asymptotic behaviour constitutes the field of classical zero-error information theory