Conclusive bidirectional quantum teleportation of arbitrary unknown single-particle states in amplitude-damping channel

被引:0
作者
Aisan, Yimamujiang [1 ]
Maihemuti, Nueraminaimu [1 ]
Peng, Jiayin [1 ]
Tang, Jiangang [1 ]
机构
[1] Kashi Univ, Sch Math & Stat, Kashi 844000, Xinjiang, Peoples R China
关键词
Bidirectional quantum teleportation; conclusive; pure entangled state; amplitude damping; ENTANGLED STATE; 2-QUBIT STATE; COMMUNICATION;
D O I
10.1142/S021974992550008X
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, two conclusive bidirectional quantum teleportation (BQT) schemes in an amplitude damping channel are put forward. These schemes, respectively, exchange two arbitrary single-qubit states and two arbitrary single-qutrit states between two users, where both users act as senders and receivers. To achieve this, the detailed procedures for using entanglement compensation in an amplitude damped channel to share pure entangled quantum states between two users are first proposed. Then, using the pure entangled four-qubit (or four-qutrit) state shared between the users as a quantum channel, the secret quantum information of each user, i.e. the single-qubit state (or single-qutrit state), is teleported to the other user. This teleportation is designed in such a way that the information can be probabilistically reconstructed by introducing an auxiliary qubit (or qutrit) and executing proper unitary transformations by the receiver. The research results indicate that, whether in single-qubit or single-qutrit state BQT schemes, the success probability of the receiver restoring secret quantum information is determined only by the smaller absolute value of the coefficients characterizing the quantum channel. Additionally, regardless of the noise intensity in the amplitude damping channel, the fidelity of each quantum state transmitted in our BQT schemes can reach 1, which is unattainable in existing BQT schemes based on noisy environments.
引用
收藏
页数:31
相关论文
共 76 条
[1]   Enhancing quantum teleportation: an enable-based protocol exploiting distributed quantum gates [J].
Ahmadkhaniha, Armin ;
Mafi, Yousef ;
Kazemikhah, Payman ;
Aghababa, Hossein ;
Barati, Masoud ;
Kolahdouz, Mohammadreza .
OPTICAL AND QUANTUM ELECTRONICS, 2023, 55 (12)
[2]   Short-Distance Bidirectional Teleportation of High-Dimensional Arbitrary Single-Qudit States [J].
Aisan, Yimamujiang ;
Peng, Jiayin ;
Maihemuti, Nueraminaimu ;
Tang, Jiangang .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2024, 63 (04)
[3]   TELEPORTING AN UNKNOWN QUANTUM STATE VIA DUAL CLASSICAL AND EINSTEIN-PODOLSKY-ROSEN CHANNELS [J].
BENNETT, CH ;
BRASSARD, G ;
CREPEAU, C ;
JOZSA, R ;
PERES, A ;
WOOTTERS, WK .
PHYSICAL REVIEW LETTERS, 1993, 70 (13) :1895-1899
[4]   Experimental realization of teleporting an unknown pure quantum state via dual classical and Einstein-Podolsky-Rosen channels [J].
Boschi, D ;
Branca, S ;
De Martini, F ;
Hardy, L ;
Popescu, S .
PHYSICAL REVIEW LETTERS, 1998, 80 (06) :1121-1125
[5]   Experimental quantum teleportation [J].
Bouwmeester, D ;
Pan, JW ;
Mattle, K ;
Eibl, M ;
Weinfurter, H ;
Zeilinger, A .
NATURE, 1997, 390 (6660) :575-579
[6]   Teleportation in a noisy environment: A quantum trajectories approach [J].
Carlo, GG ;
Benenti, G ;
Casati, G .
PHYSICAL REVIEW LETTERS, 2003, 91 (25)
[7]   Bidirectional Quantum Controlled Teleportation by Using a Genuine Six-qubit Entangled State [J].
Chen, Yan .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2015, 54 (01) :269-272
[8]   Asymmetric Bidirectional 3 ac" 2 Qubit Teleportation Protocol Between Alice and Bob Via 9-qubit Cluster State [J].
Choudhury, Binayak S. ;
Samanta, Soumen .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2017, 56 (10) :3285-3296
[9]   Improving the security of multiparty quantum secret sharing against Trojan horse attack [J].
Deng, FG ;
Li, XH ;
Zhou, HY ;
Zhang, ZJ .
PHYSICAL REVIEW A, 2005, 72 (04)
[10]   Bidirectional Quantum Teleportation with GHZ States and EPR Pairs via Entanglement Swapping [J].
Du, Zhenlong ;
Li, Xiaoli ;
Liu, Xuejun .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2020, 59 (02) :622-631