A General Method of Selecting Quantum Channel for Bidirectional Quantum Teleportation

2014 ◽  
Vol 53 (6) ◽  
pp. 1840-1847 ◽  
Author(s):  
Hong-Zi Fu ◽  
Xiu-Lao Tian ◽  
Yang Hu
2020 ◽  
Vol 34 (28) ◽  
pp. 2050261
Author(s):  
Vikram Verma

We propose a novel scheme for faithful bidirectional quantum teleportation (BQT) in which Alice can transmit an unknown N-qubit entangled state to Bob and at the same time Bob can transmit an unknown M-qubit entangled state to Alice by using a four-qubit entangled G-state as a quantum channel. We also propose a new scheme for cyclic QT of multi-qubit entangled states by using two G-states as a quantum channel. The advantage of our schemes is that it seems to be much simpler and requires reduced number of qubits in quantum channel as compared with the other proposed schemes.


Author(s):  
Jinwei Wang ◽  
Liping Huang

In this paper, an asymmetric bidirectional controlled quantum teleportation via a six-qubit partially entangled state is given, in which Alice wants to transmit a two-qubit entangled state to Bob and Bob wants to transmit a single-qubit state to Alice on the same time. Although the six-qubit state as quantum channel is partially entangled, the teleportation is implemented deterministically. Furthermore, only Bell-state measurements, single-qubit measurements and some unitary operations are needed in the scheme.


2017 ◽  
Vol 64 (15) ◽  
pp. 1495-1500 ◽  
Author(s):  
Cong Liao ◽  
Si-Meng Wang ◽  
Cai-Fang Wang ◽  
Hua-Bo Liu ◽  
Xiu-Lao Tian

2021 ◽  
pp. 2150249
Author(s):  
Vikram Verma

In this paper, by utilizing a nine-qubit entangled state as a quantum channel, we propose new schemes for symmetric and asymmetric cyclic controlled quantum teleportation (CYCQT). In our proposed schemes, four participants Alice, Bob, Charlie and David teleport their unknown quantum states cyclically among themselves with the help of a controller Eve. No participants can reconstruct the original states sent from the respective senders without the permission of the controller. Also, by considering same nine-qubit entangled state as a quantum channel, we propose a generalized scheme for CYCQT of multi-qubit states. In contrast to the previous CYCQT schemes involving three communicators and a controller, there are four communicators and a controller in the proposed schemes. Also, compared with previous CYCQT schemes, our proposed CYCQT schemes require less consumption of quantum resource and the intrinsic efficiency of the generalized scheme increases with the increase of number of qubits in the information states.


Entropy ◽  
2019 ◽  
Vol 21 (4) ◽  
pp. 352 ◽  
Author(s):  
Zhan-Yun Wang ◽  
Yi-Tao Gou ◽  
Jin-Xing Hou ◽  
Li-Ke Cao ◽  
Xiao-Hui Wang

We explicitly present a generalized quantum teleportation of a two-qubit entangled state protocol, which uses two pairs of partially entangled particles as quantum channel. We verify that the optimal probability of successful teleportation is determined by the smallest superposition coefficient of these partially entangled particles. However, the two-qubit entangled state to be teleported will be destroyed if teleportation fails. To solve this problem, we show a more sophisticated probabilistic resumable quantum teleportation scheme of a two-qubit entangled state, where the state to be teleported can be recovered by the sender when teleportation fails. Thus the information of the unknown state is retained during the process. Accordingly, we can repeat the teleportion process as many times as one has available quantum channels. Therefore, the quantum channels with weak entanglement can also be used to teleport unknown two-qubit entangled states successfully with a high number of repetitions, and for channels with strong entanglement only a small number of repetitions are required to guarantee successful teleportation.


Sign in / Sign up

Export Citation Format

Share Document