اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCan non-private channels transmit quantum information?
403
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the power of quantum channels with little or no capacity for private communication. Because privacy is a necessary condition for quantum communication, one might expect that such channels would be of little use for transmitting quantum states. Nevertheless, we find strong evidence that there are pairs of such channels that, when used together, can transmit far more quantum information than the sum of their individual private capacities. Because quantum transmissions are necessarily private, this would imply a large violation of additivity for the private capacity. Specifically, we present channels which display either (1) A large joint quantum capacity but very small individual private capacities or (2) a severe violation of additivity for the Holevo information.
قيم البحث
اقرأ أيضاً
Quantum Private Comparison (QPC) allows us to protect private information during its comparison. In the past various three-party quantum protocols have been proposed that claim to work well under noisy conditions. Here we tackle the problem of QPC un
der noise. We analyze the EPR-based protocol under depolarizing noise, bit flip and phase flip noise. We show how noise affects the robustness of the EPR-based protocol. We then present a straightforward protocol based on CSS codes to perform QPC which is robust against noise and secure under general attacks.
We prove a regularized formula for the secret key-assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak on entanglement assisted quantum communication capacity cite{DHW
05RI}. This formula provides a new family protocol, the private father protocol, under the resource inequality framework that includes private classical communication it{without} secret key assistance as a child protocol.
Werner states have a host of interesting properties, which often serve to illuminate the unusual properties of quantum information. Starting from these states, one may define a family of quantum channels, known as the Holevo-Werner channels, which th
emselves afford several unusual properties. In this paper we use the teleportation covariance of these channels to upper bound their two-way assisted quantum and secret-key capacities. This bound may be expressed in terms of relative entropy distances, such as the relative entropy of entanglement, and also in terms of the squashed entanglement. Most interestingly, we show that the relative entropy bounds are strictly sub-additive for a sub-class of the Holevo-Werner channels, so that their regularisation provides a tighter performance. These information-theoretic results are first found for point-to-point communication and then extended to repeater chains and quantum networks, under different types of routing strategies.
We study the possibility of realizing perfect quantum state transfer in mesoscopic devices. We discuss the case of the Fano-Anderson model extended to two impurities. For a channel with an infinite number of degrees of freedom, we obtain coherent beh
avior in the case of strong coupling or in weak coupling off-resonance. For a finite number of degrees of freedom, coherent behavior is associated to weak coupling and resonance conditions.
We study quantum teleportation with the resource of non-orthogonal qubit states. We first extend the standard teleportation protocol to the case of such states. We investigate how the loss of teleportation fidelity resulting for the use of non-orthog
onal states compares to a similar loss of fidelity when noisy or non-maximally entangled states as used as teleportation resource. Our analysis leads to certain interesting results on the teleportation efficiency of both pure and mixed non-orthgonal states compared to that of non-maximally entangled and mixed states.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
