اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLong-distance quantum communication with polarization maximally entangled states
119
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose a scheme for long-distance quantum communication where the elementary entanglement is generated through two-photon interference and quantum swapping is performed through one-photon interference. Local polarization maximally entangled states of atomic ensembles are generated by absorbing a single photon from on-demand single-photon sources. This scheme is robust against phase fluctuations in the quantum channels, moreover speeds up long-distance high-fidelity entanglement generation rate.
قيم البحث
اقرأ أيضاً
The architecture proposed by Duan, Lukin, Cirac, and Zoller (DLCZ) for long-distance quantum communication with atomic ensembles is analyzed. Its fidelity and throughput in entanglement distribution, entanglement swapping, and quantum teleportation i
s derived within a framework that accounts for multiple excitations in the ensembles as well as loss and asymmetries in the channel. The DLCZ performance metrics that are obtained are compared to the corresponding results for the trapped-atom quantum communication architecture that has been proposed by a team from the Massachusetts Institute of Technology and Northwestern University (MIT/NU). Both systems are found to be capable of high-fidelity entanglement distribution. However, the DLCZ scheme only provides conditional teleportation and repeater operation, whereas the MIT/NU architecture affords full Bell-state measurements on its trapped atoms. Moreover, it is shown that achieving unity conditional fidelity in DLCZ teleportation and repeater operation requires ideal photon-number resolving detectors. The maximum conditional fidelities for DLCZ teleportation and repeater operation that can be realized with non-resolving detectors are 1/2 and 2/3, respectively.
Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (>1000km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication distance.
Quantum repeaters, as a promising approach, can overcome both photon loss and operation errors, and hence significantly speedup the communication rate. Depending on the methods used to correct loss and operation errors, all the proposed QR schemes can be classified into three categories (generations). Here we present the first systematic comparison of three generations of quantum repeaters by evaluating the cost of both temporal and physical resources, and identify the optimized quantum repeater architecture for a given set of experimental parameters. Our work provides a roadmap for the experimental realizations of highly efficient quantum networks over transcontinental distances.
Pure multipartite quantum states of n parties and local dimension q are called k-uniform if all reductions to k parties are maximally mixed. These states are relevant for our understanding of multipartite entanglement, quantum information protocols,
and the construction of quantum error correction codes. To our knowledge, the only known systematic construction of these quantum states is based on classical error correction codes. We present a systematic method to construct other examples of k-uniform states and show that the states derived through our construction are not equivalent to any k-uniform state constructed from the so-called maximum distance separable error correction codes. Furthermore, we use our method to construct several examples of absolutely maximally entangled states whose existence was open so far.
High-quality long-distance entanglement is essential for both quantum communication and scalable quantum networks. Entanglement purification is to distill high-quality entanglement from low-quality entanglement in a noisy environment and it plays a k
ey role in quantum repeaters. The previous significant entanglement purification experiments require two pairs of low-quality entangled states and were demonstrated in table-top. Here we propose and report a high-efficiency and long-distance entanglement purification using only one pair of hyperentangled states. We also demonstrate its practical application in entanglement-based quantum key distribution (QKD). One pair of polarization spatial-mode hyperentanglement was distributed over 11 km multicore fiber (noisy channel). After purification, the fidelity of polarization entanglement arises from 0.771 to 0.887 and the effective key rate in entanglement-based QKD increases from 0 to 0.332. The values of Clauser-Horne-Shimony-Holt (CHSH) inequality of polarization entanglement arises from 1.829 to 2.128. Moreover, by using one pair of hyperentanglement and deterministic controlled-NOT gate, the total purification efficiency can be estimated as 6.6x10^3 times than the experiment using two pairs of entangled states with spontaneous parametric down-conversion (SPDC) sources. Our results offer the potential to be implemented as part of a full quantum repeater and large scale quantum network.
This paper considers a special class of nonlocal games $(G,psi)$, where $G$ is a two-player one-round game, and $psi$ is a bipartite state independent of $G$. In the game $(G,psi)$, the players are allowed to share arbitrarily many copies of $psi$. T
he value of the game $(G,psi)$, denoted by $omega^*(G,psi)$, is the supremum of the winning probability that the players can achieve with arbitrarily many copies of preshared states $psi$. For a noisy maximally entangled state $psi$, a two-player one-round game $G$ and an arbitrarily small precision $epsilon>0$, this paper proves an upper bound on the number of copies of $psi$ for the players to win the game with a probability $epsilon$ close to $omega^*(G,psi)$. Hence, it is feasible to approximately compute $omega^*(G,psi)$ to an arbitrarily precision. Recently, a breakthrough result by Ji, Natarajan, Vidick, Wright and Yuen showed that it is undecidable to approximate the values of nonlocal games to a constant precision when the players preshare arbitrarily many copies of perfect maximally entangled states, which implies that $mathrm{MIP}^*=mathrm{RE}$. In contrast, our result implies the hardness of approximating nonlocal games collapses when the preshared maximally entangled states are noisy. The paper develops a theory of Fourier analysis on matrix spaces by extending a number of techniques in Boolean analysis and Hermitian analysis to matrix spaces. We establish a series of new techniques, such as a quantum invariance principle and a hypercontractive inequality for random operators, which we believe have further applications.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
