اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum network coding for quantum repeaters
63
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 potential 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.
قيم البحث
اقرأ أيضاً
Optical telecommunication is at the heart of todays internet and is currently enabled by the transmission of intense optical signals between remote locations. As we look to the future of telecommunication, quantum mechanics promise new ways to be abl
e to transmit and process that information. Demonstrations of quantum key distribution and quantum teleportation using multi-photon states have been performed, but only over ranges limited to one hundred kilometers. To go beyond this, we need repeaters that are compatible with these quantum multi-photon continuous variables pulses. Here we present a design for a continuous variable quantum repeaters that can distribute entangled and pure two-mode squeezed states over arbitrarily long distances with a success probability that scales only polynomially with distance. The proposed quantum repeater is composed from several basic known building blocks such as non-Gaussian operations for entanglement distillation and an iterative Gaussification protocol (for retaining the Gaussian character of the final state), but complemented with a heralded non-Gaussian entanglement swapping protocol, which allows us to avoid extensive iterations of quantum Gaussification. We characterize the performance of this scheme in terms of key rates for quantum key distribution and show a secure key can be generated over thousands of kilometers.
We introduce measurement-based quantum repeaters, where small-scale measurement-based quantum processors are used to perform entanglement purification and entanglement swapping in a long-range quantum communication protocol. In the scheme, pre-prepar
ed entangled states stored at intermediate repeater stations are coupled with incoming photons by simple Bell-measurements, without the need of performing additional quantum gates or measurements. We show how to construct the required resource states, and how to minimize their size. We analyze the performance of the scheme under noise and imperfections, with focus on small-scale implementations involving entangled states of few qubits. We find measurement-based purification protocols with significantly improved noise thresholds. Furthermore we show that already resource states of small size suffice to significantly increase the maximal communication distance. We also discuss possible advantages of our scheme for different set-ups.
Quantum repeater networks have attracted attention for the implementation of long-distance and large-scale sharing of quantum states. Recently, researchers extended classical network coding, which is a technique for throughput enhancement, into quant
um information. The utility of quantum network coding (QNC) has been shown under ideal conditions, but it has not been studied previously under conditions of noise and shortage of quantum resources. We analyzed QNC on a butterfly network, which can create end-to-end Bell pairs at twice the rate of the standard quantum network repeater approach. The joint fidelity of creating two Bell pairs has a small penalty for QNC relative to entanglement swapping. It will thus be useful when we care more about throughput than fidelity. We found that the output fidelity drops below 0.5 when the initial Bell pairs have fidelity F < 0.90, even with perfect local gates. Local gate errors have a larger impact on quantum network coding than on entanglement swapping.
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.
We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process and present its solution for different repeaters sizes. Based on this, we are able to demonstrate that the commonly
used doubling scheme for performing probabilistic entanglement swapping of probabilistically distributed entangled qubit pairs in quantum repeaters does not always produce the best possible raw rate. Focussing on this figure of merit, without considering additional probabilistic elements for error suppression such as entanglement distillation on higher nesting levels, our approach reveals that a power-of-two number of segments has no privileged position in quantum repeater theory; the best scheme can be constructed for any number of segments. Moreover, classical communication can be included into our scheme, and we show how this influences the raw waiting time for different number of segments, confirming again the optimality of non-doubling in some relevant parameter regimes. Thus, our approach provides the minimal possible waiting time of quantum repeaters in a fairly general physical setting.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
