ترغب بنشر مسار تعليمي؟ اضغط هنا

Triggered qutrits for Quantum Communication protocols

67   0   0.0 ( 0 )
 نشر من قبل Gabriel Molina-Terriza
 تاريخ النشر 2004
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

A general protocol in Quantum Information and Communication relies in the ability of producing, transmitting and reconstructing, in general, qunits. In this letter we show for the first time the experimental implementation of these three basic steps on a pure state in a three dimensional space, by means of the orbital angular momentum of the photons. The reconstruction of the qutrit is performed with tomographic techniques and a Maximum-Likelihood estimation method. In this way we also demonstrate that we can perform any transformation in the three dimensional space.



قيم البحث

اقرأ أيضاً

We point out that realization of quantum communication protocols in programmable quantum computers provides a deep benchmark for capabilities of real quantum hardware. Particularly, it is prospective to focus on measurements of entropy-based characte ristics of the performance and to explore whether a quantum regime is preserved. We perform proof-of-principle implementations of superdense coding and quantum key distribution BB84 using 5- and 16-qubit superconducting quantum processors of IBM Quantum Experience. We focus on the ability of these quantum machines to provide an efficient transfer of information between distant parts of the processors by placing Alice and Bob at different qubits of the devices. We also examine the ability of quantum devices to serve as quantum memory and to store entangled states used in quantum communication. Another issue we address is an error mitigation. Although it is at odds with benchmarking, this problem is nevertheless of importance in a general context of quantum computation with noisy quantum devices. We perform such a mitigation and noticeably improve some results.
The unique features of quantum walk, such as the possibility of the walker to be in superposition ofthe position space and get entangled with the position space, provides inherent advantages that canbe captured to design highly secure quantum communi cation protocols. Here we propose two quan-tum direct communication protocols, a Quantum Secure Direct Communication (QSDC) protocoland a Controlled Quantum Dialogue (CQD) protocol using discrete-time quantum walk on a cycle.The proposed protocols are unconditionally secure against various attacks such as the intercept-resend attack, the denial of service attack, and the man-in-the-middle attack. Additionally, theproposed CQD protocol is shown to be unconditionally secure against an untrusted service providerand both the protocols are shown more secure against the intercept resend attack as compared tothe qubit based LM05/DL04 protocol.
We analyze how the performance of a quantum-repeater network depends on the protocol employed to distribute entanglement, and we find that the choice of repeater-to-repeater link protocol has a profound impact on communication rate as a function of h ardware parameters. We develop numerical simulations of quantum networks using different protocols, where the repeater hardware is modeled in terms of key performance parameters, such as photon generation rate and collection efficiency. These parameters are motivated by recent experimental demonstrations in quantum dots, trapped ions, and nitrogen-vacancy centers in diamond. We find that a quantum-dot repeater with the newest protocol (MidpointSource) delivers the highest communication rate when there is low probability of establishing entanglement per transmission, and in some cases the rate is orders of magnitude higher than other schemes. Our simulation tools can be used to evaluate communication protocols as part of designing a large-scale quantum network.
125 - Dmitry Gavinsky 2008
We study the simultaneous message passing (SMP) model of communication complexity, for the case where one party is quantum and the other is classical. We show that in an SMP protocol that computes some function with the first party sending q qubits a nd the second sending c classical bits, the quantum message can be replaced by a randomized message of O(qc) classical bits, as well as by a deterministic message of O(q c log q) classical bits. Our proofs rely heavily on earlier results due to Scott Aaronson. In particular, our results imply that quantum-classical protocols need to send Omega(sqrt{n/log n}) bits/qubits to compute Equality on n-bit strings, and hence are not significantly better than classical-classical protocols (and are much worse than quantum-quantum protocols such as quantum fingerprinting). This essentially answers a recent question of Wim van Dam. Our results also imply, more generally, that there are no superpolynomial separations between quantum-classical and classical-classical SMP protocols for functional problems. This contrasts with the situation for relational problems, where exponential gaps between quantum-classical and classical-classical SMP protocols are known. We show that this surprising situation cannot arise in purely classical models: there, an exponential separation for a relational problem can be converted into an exponential separation for a functional problem.
We design a quantum repeater architecture using individual $^{167}$Er ions doped into Y$_2$SiO$_5$ crystal. This ion is a promising candidate for a repeater protocol because of its long hyperfine coherence time in addition to its ability to emit phot ons within the telecommunication wavelength range. To distribute entanglement over a long distance, we propose two different swapping gates between nearby ions using the exchange of virtual cavity photons and the electric dipole-dipole interaction. We analyze their expected performance, and discuss their strengths and weaknesses. Then, we show that a post-selection approach can be implemented to improve the gate fidelity of the virtual photon exchange scheme by monitoring cavity emission. Finally, we use our results for the swapping gates to estimate the end-to-end fidelity and distribution rate for the protocol.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا