scholarly journals Quantum channel of continuous variable teleportation and nonclassicality of quantum states

2002 ◽  
Vol 4 (2) ◽  
pp. 114-122 ◽  
Author(s):  
Masahiro Takeoka ◽  
Masashi Ban ◽  
Masahide Sasaki
2019 ◽  
Vol 33 (05) ◽  
pp. 1950033 ◽  
Author(s):  
Ming-Hui Zhang ◽  
Jin-Ye Peng ◽  
Zheng-Wen Cao

Quantum dialogue can realize the mutual transmission of secret information between two legal users. In most of the existing quantum dialogue protocols, the information carriers applied in quantum dialogue are discrete variable (DV) quantum states. However, there are certain limitations on the preparation and detection of DV quantum states with current techniques. Continuous variable (CV) quantum states can overcome these problems effectively while improving the quantum channel capacity. In this paper, we propose a quantum dialogue protocol with four-mode continuous variable GHZ state. Compared with the existing CV-based quantum dialogue protocols, the protocol allows two users to transmit two groups of secret information with different lengths to each other simultaneously. The channel capacity of the protocol has been improved as each traveling mode carries two- or four-bits of information. In addition, the protocol has been proved to be secure against information leakage problem and some common attacks, such as beam splitter attack and intercept-and-resend attack.


2006 ◽  
Vol 20 (02n03) ◽  
pp. 97-103
Author(s):  
TONG-QIANG SONG

By using the two-mode Einstein–Podolsky–Rosen (EPR) pair eigenstates or the two-mode squeezed vacuum as quantum channel we study the quantum teleportation of any form of single-mode quantum states (which include discrete and continuous variable quantum states). The elegant properties of the EPR pair eigenstates bring much convenience to our discussion.


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.


2011 ◽  
Vol 09 (06) ◽  
pp. 1437-1448
Author(s):  
YI-BAO LI ◽  
KUI HOU ◽  
SHOU-HUA SHI

We propose two kinds of schemes for multiparty remote state preparation (MRSP) of the multiparticle d-dimensional equatorial quantum states by using partial entangled state as the quantum channel. Unlike more remote state preparation scheme which only one sender knows the original state to be remotely prepared, the quantum state is shared by two-party or multiparty in this scheme. We show that if and only if all the senders agree to collaborate with each other, the receiver can recover the original state with certain probability. It is found that the total success probability of MRSP is only by means of the smaller coefficients of the quantum channel and the dimension d.


2019 ◽  
Vol 5 (1) ◽  
Author(s):  
Christa Zoufal ◽  
Aurélien Lucchi ◽  
Stefan Woerner

AbstractQuantum algorithms have the potential to outperform their classical counterparts in a variety of tasks. The realization of the advantage often requires the ability to load classical data efficiently into quantum states. However, the best known methods require $${\mathcal{O}}\left({2}^{n}\right)$$O2n gates to load an exact representation of a generic data structure into an $$n$$n-qubit state. This scaling can easily predominate the complexity of a quantum algorithm and, thereby, impair potential quantum advantage. Our work presents a hybrid quantum-classical algorithm for efficient, approximate quantum state loading. More precisely, we use quantum Generative Adversarial Networks (qGANs) to facilitate efficient learning and loading of generic probability distributions - implicitly given by data samples - into quantum states. Through the interplay of a quantum channel, such as a variational quantum circuit, and a classical neural network, the qGAN can learn a representation of the probability distribution underlying the data samples and load it into a quantum state. The loading requires $${\mathcal{O}}\left(poly\left(n\right)\right)$$Opolyn gates and can thus enable the use of potentially advantageous quantum algorithms, such as Quantum Amplitude Estimation. We implement the qGAN distribution learning and loading method with Qiskit and test it using a quantum simulation as well as actual quantum processors provided by the IBM Q Experience. Furthermore, we employ quantum simulation to demonstrate the use of the trained quantum channel in a quantum finance application.


2020 ◽  
Vol 74 (1) ◽  
Author(s):  
Shao-Hua Xiang ◽  
Yu-Jing Zhao ◽  
Cheng Xiang ◽  
Wei Wen ◽  
Xue-Wen Long

2011 ◽  
Vol 09 (03) ◽  
pp. 993-1003
Author(s):  
YE-QI ZHANG ◽  
JING-BO XU

We investigate the entanglement swapping of the continuous variable states by taking the pair Schrödinger cat states as the input entangled states, in which the two-mode squeezed vacuum and the pair cat states serve as the quantum channel, respectively. The entanglement of the initial states as well as the final states is analyzed by adopting the logarithmic negativity as the measure of entanglement. The quantum teleportation task by exploiting the swapped states as the quantum channel is also considered, where a coherent state serves as the target state and the average fidelity is examined.


Sign in / Sign up

Export Citation Format

Share Document