scholarly journals Probabilistic Teleportation of Arbitrary Two-Qubit Quantum State via Non-Symmetric Quantum Channel

Entropy ◽  
2018 ◽  
Vol 20 (4) ◽  
pp. 238 ◽  
Author(s):  
Kan Wang ◽  
Xu-Tao Yu ◽  
Xiao-Fei Cai ◽  
Zai-Chen Zhang
Keyword(s):  
Quantum State ◽  
Quantum Channel ◽  
Probabilistic Teleportation ◽  
Symmetric Quantum

Probabilistic teleportation of an arbitrary GHZ-class state with a pure entangled two-particle quantum channel and its application in quantum state sharing

2007 ◽  
Vol 16 (10) ◽  
pp. 2867-2874 ◽  
Author(s):  
Zhou Ping ◽  
Li Xi-Han ◽  
Deng Fu-Guo ◽  
Zhou Hong-Yu
Keyword(s):  
Quantum State ◽  
Quantum Channel ◽  
Quantum State Sharing ◽  
Probabilistic Teleportation

scholarly journals Approximate quantum state reconstruction without a quantum channel

2018 ◽  
Vol 98 (6) ◽  
Author(s):  
Zichen Yang ◽  
Ze-Yang Fan ◽  
Liang-Zhu Mu ◽  
Heng Fan
Keyword(s):  
Quantum State ◽  
Quantum Channel ◽  
State Reconstruction ◽  
Quantum State Reconstruction

Information Leakage in Quantum Dialogue by Using Non-Symmetric Quantum Channel

2017 ◽  
Vol 67 (5) ◽  
pp. 507 ◽  
Author(s):  
Gan Gao ◽  
Wei-Yan Li ◽  
Yue Wang
Keyword(s):  
Quantum Channel ◽  
Information Leakage ◽  
Quantum Dialogue ◽  
Symmetric Quantum

MULTIPARTY REMOTELY PREPARING MULTIPARTITE EQUATORIAL ENTANGLED STATES IN HIGH DIMENSIONS

2011 ◽  
Vol 09 (06) ◽  
pp. 1437-1448
Author(s):  
YI-BAO LI ◽  
KUI HOU ◽  
SHOU-HUA SHI
Keyword(s):  
Quantum State ◽  
Quantum Channel ◽  
Success Probability ◽  
Quantum States ◽  
Remote State Preparation ◽  
Entangled States ◽  
Entangled State ◽  
High Dimensions ◽  
Original State ◽  
State Preparation

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.

scholarly journals Quantum Generative Adversarial Networks for learning and loading random distributions

2019 ◽  
Vol 5 (1) ◽  
Author(s):  
Christa Zoufal ◽  
Aurélien Lucchi ◽  
Stefan Woerner
Keyword(s):  
Quantum State ◽  
Quantum Channel ◽  
Quantum Algorithms ◽  
Probability Distributions ◽  
Quantum Algorithm ◽  
Quantum Circuit ◽  
Quantum Simulation ◽  
Quantum States ◽  
Generative Adversarial Networks ◽  
Adversarial Networks

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.

TRANSFORMATION FROM PROBABILISTIC CHANNEL TO DETERMINISTIC CHANNEL BASED ON EIGHT-QUBIT QUANTUM CHANNEL

2013 ◽  
Vol 27 (04) ◽  
pp. 1350030 ◽  
Author(s):  
MING-QIANG BAI ◽  
JIA-YIN PENG ◽  
ZHI-WEN MO
Keyword(s):  
Quantum Channel ◽  
Quantum Teleportation ◽  
Bell State ◽  
High Dimensional ◽  
General Quantum ◽  
Probabilistic Teleportation ◽  
Physics Experiments ◽  
Bell State Measurements

In physics experiments, it is very difficult to realize directly using high-dimensional unitary operations. In order to decrease or avoid the shortage during the teleportation process based on probabilistic channel, we propose a new scheme to reconstruct a deterministic teleportation eight-qubit channel using Bell-state measurements based on the probabilistic channel, which replaces high-dimensional unitary operations. In our scheme, a new quantum channel without alterable parameters replaces the general quantum channel with parameters as probabilistic teleportation. It shows that if we choose an eight-qubit probabilistic channel to construct deterministic channel, the relevant parameters of the eight-qubit probabilistic channel can be avoided. Thus, in quantum teleportation process, quantum channel can be chosen as a deterministic channel. This shows that our scheme makes real experiments more suitable.

scholarly journals Quantum key distribution with mismatched measurements over arbitrary channels

2017 ◽  
Vol 17 (3&4) ◽  
pp. 209-241
Author(s):  
Walter O. Krawec
Keyword(s):  
Quantum Channel ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Rate Equations ◽  
Quantum Channels ◽  
Multiple Channel ◽  
Symmetric Quantum ◽  
Channel Statistics ◽  
Quantum Protocol ◽  
Measurement Bases

In this paper, we derive key-rate expressions for different quantum key distribution protocols. Our key-rate equations utilize multiple channel statistics, including those gathered from mismatched measurement bases - i.e., when Alice and Bob choose incompatible bases. In particular, we will consider an Extended B92 and a two-way semi-quantum protocol. For both these protocols, we demonstrate that their tolerance to noise is higher than previously thought - in fact, we will show the semi-quantum protocol can actually tolerate the same noise level as the fully quantum BB84 protocol. Along the way, we will also consider an optimal QKD protocol for various quantum channels. Finally, all the key-rate expressions which we derive in this paper are applicable to any arbitrary, not necessarily symmetric, quantum channel.

Quantum Dialogue by Using Non-Symmetric Quantum Channel

2010 ◽  
Vol 53 (4) ◽  
pp. 648-652 ◽  
Author(s):  
Zhan You-Bang ◽  
Zhang Ling-Ling ◽  
Wang Yu-Wu ◽  
Zhang Qun-Yong
Keyword(s):  
Quantum Channel ◽  
Quantum Dialogue ◽  
Symmetric Quantum

scholarly journals Probabilistic Teleportation via Quantum Channel with Partial Information

Entropy ◽  
2015 ◽  
Vol 17 (6) ◽  
pp. 3621-3630 ◽  
Author(s):  
Desheng Liu ◽  
Zhiping Huang ◽  
Xiaojun Guo
Keyword(s):  
Quantum Channel ◽  
Partial Information ◽  
Probabilistic Teleportation
Sign in / Sign up

Export Citation Format

Share Document