اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTwo-way quantum communication channels
117
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel.
قيم البحث
اقرأ أيضاً
Communication over a noisy quantum channel introduces errors in the transmission that must be corrected. A fundamental bound on quantum error correction is the quantum capacity, which quantifies the amount of quantum data that can be protected. We sh
ow theoretically that two quantum channels, each with a transmission capacity of zero, can have a nonzero capacity when used together. This unveils a rich structure in the theory of quantum communications, implying that the quantum capacity does not uniquely specify a channels ability for transmitting quantum information.
We present methods to strictly calculate the finite-key effects in quantum key distribution (QKD) with error rejection through two-way classical communication (TWCC) for the sending-or-not-sending twin-field protocol. Unlike the normal QKD without TW
CC, here the probability of tagging or untagging for each two-bit random group is not independent. We rigorously solve this problem by imagining a virtual set of bits where every bit is independent and identical. We show the relationship between the outcome starting from this imagined set containing independent and identical bits and the outcome starting with the real set of non-independent bits. With explicit formulas, we show that simply applying Chernoff bound in the calculation gives correct key rate, but the failure probability changes a little bit.
The power of a quantum circuit is determined through the number of two-qubit entangling gates that can be performed within the coherence time of the system. In the absence of parallel quantum gate operations, this would make the quantum simulators li
mited to shallow circuits. Here, we propose a protocol to parallelize the implementation of two-qubit entangling gates between multiple users which are spatially separated, and use a commonly shared spin chain data-bus. Our protocol works through inducing effective interaction between each pair of qubits without disturbing the others, therefore, it increases the rate of gate operations without creating crosstalk. This is achieved by tuning the Hamiltonian parameters appropriately, described in the form of two different strategies. The tuning of the parameters makes different bilocalized eigenstates responsible for the realization of the entangling gates between different pairs of distant qubits. Remarkably, the performance of our protocol is robust against increasing the length of the data-bus and the number of users. Moreover, we show that this protocol can tolerate various types of disorders and is applicable in the context of superconductor-based systems. The proposed protocol can serve for realizing two-way quantum communication.
A completely depolarising quantum channel always outputs a fully mixed state and thus cannot transmit any information. In a recent Letter [D. Ebler et al., Phys. Rev. Lett. 120, 120502 (2018)], it was however shown that if a quantum state passes thro
ugh two such channels in a quantum superposition of different orders - a setup known as the quantum switch - then information can nevertheless be transmitted through the channels. Here, we show that a similar effect can be obtained when one coherently controls between sending a target system through one of two identical depolarising channels. Whereas it is tempting to attribute this effect in the quantum switch to the indefinite causal order between the channels, causal indefiniteness plays no role in this new scenario. This raises questions about its role in the corresponding effect in the quantum switch. We study this new scenario in detail and we see that, when quantum channels are controlled coherently, information about their specific implementation is accessible in the output state of the joint control-target system. This allows two different implementations of what is usually considered to be the same channel to therefore be differentiated. More generally, we find that to completely describe the action of a coherently controlled quantum channel, one needs to specify not only a description of the channel (e.g., in terms of Kraus operators), but an additional transformation matrix depending on its implementation.
Unambiguous state discrimination (USD) is one of the major obstacles for practical quantum key distribution (QKD). Often overlooked, it allows efficient eavesdropping in majority of practical systems, provided the overall channel loss is above a cert
ain threshold. Thus, to remain secure all such systems must not only monitor the actual loss, but also possess a comprehensive information on the safe loss vs. BER levels, which is often well beyond currently known security analyses. The more advanced the protocol the tougher it becomes to find and prove corresponding bounds. To get out of this vicious circle and solve the problem outright, we demonstrate a so called relativistic QKD system, which uses causality to become inherently immune to USD-based attacks. The system proves to be practical in metropolitan line-of-sight arrangements. At the same time it has a very basic structure that allows for a straightforward and comprehensive security analysis.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
