اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum Correlations over Long-distances Using Noisy Quantum Repeaters
142
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum correlations as the resource for quantum communication can be distributed over long distances by quantum repeaters. In this Letter, we introduce the notion of a noisy quantum repeater, and examine its role in quantum communication. Quantum correlations shared through noisy quantum repeaters are then characterized and their secrecy properties are studied. Remarkably, noisy quantum repeaters naturally introduce private states in the key distillation scenario, and consequently key distillation protocols are demonstrated to be more tolerant.
قيم البحث
اقرأ أيضاً
A feasible route towards implementing long-distance quantum key distribution (QKD) systems relies on probabilistic schemes for entanglement distribution and swapping as proposed in the work of Duan, Lukin, Cirac, and Zoller (DLCZ) [Nature 414, 413 (2
001)]. Here, we calculate the conditional throughput and fidelity of entanglement for DLCZ quantum repeaters, by accounting for the DLCZ self-purification property, in the presence of multiple excitations in the ensemble memories as well as loss and other sources of inefficiency in the channel and measurement modules. We then use our results to find the generation rate of secure key bits for QKD systems that rely on DLCZ quantum repeaters. We compare the key generation rate per logical memory employed in the two cases of with and without a repeater node. We find the cross-over distance beyond which the repeater system outperforms the non-repeater one. That provides us with the optimum inter-node distancing in quantum repeater systems. We also find the optimal excitation probability at which the QKD rate peaks. Such an optimum probability, in most regimes of interest, is insensitive to the total distance.
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 argue that long optical storage times are required to establish entanglement at high rates over large distances using memory-based quantum repeaters. Triggered by this conclusion, we investigate the $^3$H$_6$ $leftrightarrow$ $^3$H$_4$ transition
at 795.325 nm of Tm:Y$_3$Ga$_5$O$_{12}$ (Tm:YGG). Most importantly, we show that the optical coherence time can reach 1.1 ms, and, using laser pulses, we demonstrate optical storage based on the atomic frequency comb protocol up to 100 $mu$s as well as a memory decay time T$_M$ of 13.1 $mu$s. Possibilities of how to narrow the gap between the measured value of T$_m$ and its maximum of 275 $mu$s are discussed. In addition, we demonstrate quantum state storage using members of non-classical photon pairs. Our results show the potential of Tm:YGG for creating quantum memories with long optical storage times, and open the path to building extended quantum networks.
We consider the hypothesis that quantum mechanics is not fundamental, but instead emerges from a theory with less computational power, such as classical mechanics. This hypothesis makes the prediction that quantum computers will not be capable of suf
ficiently complex quantum computations. Utilizing this prediction, we outline a proposal to test for such a breakdown of quantum mechanics using near-term noisy intermediate-scale quantum (NISQ) computers. Our procedure involves simulating a non-Clifford random circuit, followed by its inverse, and then checking that the resulting state is the same as the initial state. We show that quantum mechanics predicts that the fidelity of this procedure decays exponentially with circuit depth (due to noise in NISQ computers). However, if quantum mechanics emerges from a theory with significantly less computational power, then we expect the fidelity to decay significantly more rapidly than the quantum mechanics prediction for sufficiently deep circuits, which is the experimental signature that we propose to search for. Useful experiments can be performed with 80 qubits and gate infidelity $10^{-3}$, while highly informative experiments should require only 1000 qubits and gate infidelity $10^{-5}$.
This paper considers quantum network coding, which is a recent technique that enables quantum information to be sent on complex networks at higher rates than by using straightforward routing strategies. Kobayashi et al. have recently showed the poten
tial of this technique by demonstrating how any classical network coding protocol gives rise to a quantum network coding protocol. They nevertheless primarily focused on an abstract model, in which quantum resource such as quantum registers can be freely introduced at each node. In this work, we present a protocol for quantum network coding under weaker (and more practical) assumptions: our new protocol works even for quantum networks where adjacent nodes initially share one EPR-pair but cannot add any quantum registers or send any quantum information. A typically example of networks satisfying this assumption is {emph{quantum repeater networks}}, which are promising candidates for the implementation of large scale quantum networks. Our results thus show, for the first time, that quantum network coding techniques can increase the transmission rate in such quantum networks as well.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
