Dense quantum communication using single- and two-particle operations on six-particle cluster state

2016 ◽  
Vol 16 (3&4) ◽  
pp. 271-290
Author(s):  
Parminder S. Bhatia
Keyword(s):  
Single Particle ◽  
Fault Tolerant ◽  
Cluster State ◽  
Success Probability ◽  
Bell State ◽  
Dense Coding ◽  
Quantum Dense Coding ◽  
Long Distance ◽  
Coding Scheme ◽  
Bell State Measurements

Theory of controlled tripartite quantum dense coding for the transmission of four-binary bits between two distinct locations is presented. The entanglement resource for this transmission is provided by a six-qubit cluster state. Theoretical detail of an encoder that can encode sixteen different operations and a four-bit binary decoder required for this transmission is discussed. We show that in the absence of availability of any four-state analyzer decoding can be reduced to single-particle and two-particle Bell-state measurements ( BSM ). In our scheme, Bell-state measurements ( BSM ) performed during decoding, result in Bell-pairs, which along with single-particle projections are used to unambiguously discriminate all sixteen encoding operations. Proposed experiment to verify theory of tripartite quantum dense coding scheme, using photonic entanglement, is also briefly discussed. Success probability of the scheme is determined. In addition, long-distance implementation of this tripartite quantum dense coding scheme is discussed. Fault-tolerant quantum repeaters used in this long-distance scheme are based on quantum errorcorrection, which is achieved with the aid of Calderbank-Shor-Steane ( CSS ) encoding.

scholarly journals FAULT TOLERANT QUANTUM KEY DISTRIBUTION BASED ON QUANTUM DENSE CODING WITH COLLECTIVE NOISE

2009 ◽  
Vol 07 (08) ◽  
pp. 1479-1489 ◽  
Author(s):  
XI-HAN LI ◽  
BAO-KUI ZHAO ◽  
YU-BO SHENG ◽  
FU-GUO DENG ◽  
HONG-YU ZHOU
Keyword(s):  
Quantum Key Distribution ◽  
Fault Tolerant ◽  
Single Photon ◽  
Bell State ◽  
Key Distribution ◽  
Secret Message ◽  
Noisy Channel ◽  
Collective Noise ◽  
Dense Coding ◽  
Quantum Dense Coding

We present two robust quantum key distribution protocols against two kinds of collective noise, following some ideas in quantum dense coding. Three-qubit entangled states are used as quantum information carriers, two of which form the logical qubit, which is invariant with a special type of collective noise. The information is encoded on logical qubits with four unitary operations, which can be read out faithfully with Bell-state analysis on two physical qubits and a single-photon measurement on the other physical qubit, not three-photon joint measurements. Two bits of information are exchanged faithfully and securely by transmitting two physical qubits through a noisy channel. When the losses in the noisy channel is low, these protocols can be used to transmit a secret message directly in principle.

Deterministic quantum dense coding with cluster state in optical systems

2011 ◽  
Vol 284 (1) ◽  
pp. 510-514 ◽  
Author(s):  
Qing-Min Song ◽  
Bao-Long Fang ◽  
Liu Ye
Keyword(s):  
Cluster State ◽  
Optical Systems ◽  
Dense Coding ◽  
Quantum Dense Coding

CONDITIONS FOR BIPARTITE GENERAL BELL STATES

2010 ◽  
Vol 08 (07) ◽  
pp. 1213-1217 ◽  
Author(s):  
ZHEN WANG ◽  
LI-JIE TIAN ◽  
WENZHEN CAO
Keyword(s):  
Bell State ◽  
Bell States ◽  
Dense Coding ◽  
Quantum Dense Coding ◽  
Complete Set

Utilizing the notation in Refs. 10 and 11, we revisit general bipartite Bell state for any (d × d) dimensional systems. In particular, we bring out the conditions for general bipartite Bell state and find out the relation between general Bell states and the u(d) group. Furthermore, we construct local unitary complete set for quantum dense coding based on general Bell states.

scholarly journals High success perfect transmission of 1-qubit information using purposefully delayed sharing of non-maximally entangled 2-qubit resource and repeated generalized Bell-state measurements

2021 ◽  
pp. 2150015
Author(s):  
Shamiya Javed ◽  
Ranjana Prakash ◽  
Hari Prakash
Keyword(s):  
Success Probability ◽  
Bell State ◽  
Average Fidelity ◽  
Information State ◽  
The Third ◽  
Repeated Attempt ◽  
Bell Basis ◽  
Maximal Average ◽  
Collapsed States ◽  
Bell State Measurements

We propose a new scheme in which perfect transmission of 1-qubit information is achieved with high success using purposefully delayed sharing of non-maximally entangled 2-qubit resource and repeated generalized Bell-state measurements (GBSM). Alice possesses initially all qubits and she makes repeated GBSM on the pair of qubits, consisting of (1) the qubit of information state and (2) one of the two entangled resource qubits (taken alternately) until transmission with perfect fidelity is indicated. Alice then sends to Bob, the qubit not used in the last GBSM and also the result of this GBSM and Bob applies a suitable unitary transformation to replicate exactly the information state. Continued probabilistic transmission with unit fidelity is achieved by changing continuously the generalized Bell basis and also the pair of measured qubits of the collapsed states. We calculate the success probability up to the third repeated attempt of GBSM and plot it with concurrence of the entangled resource state. We also discuss the maximal average fidelity.

HIERARCHICAL AND PROBABILISTIC QUANTUM STATE SHARING WITH A NONMAXIMALLY FOUR-QUBIT CLUSTER STATE

2013 ◽  
Vol 11 (01) ◽  
pp. 1350004 ◽  
Author(s):  
JIA-YIN PENG ◽  
ZHI-WEN MO
Keyword(s):  
Quantum State ◽  
Cluster State ◽  
Success Probability ◽  
Bell State ◽  
The Other ◽  
Lower Grade ◽  
Quantum State Sharing ◽  
Projective Measurement ◽  
Two Agents ◽  
State Measurement

A scheme that probabilistically realizing hierarchical quantum state sharing of an arbitrary unknown qubit state with a nonmaximally four-qubit cluster state is presented in this paper. In the scheme, the sender Alice distributes a quantum secret with a Bell-state measurement and publishes her measurement outcomes via a classical channel to three agents who are divided into two grades. One agent is in the upper grade while other two agents are in the lower grade. Then introducing an ancillary qubit, the agent of the upper grade only needs the assistance of any one of the other two agents for probabilistically getting the secret, while an agent of the lower grade needs the help of all the other two agents by implementing a controlled-NOT operation and a proper positive operator-valued measurement instead of usual projective measurement. In other words, the agents of two different grades have different authorities to reconstruct Alice's secret by a probabilistic manner. Moreover, the total success probability and the maximum success probability of the scheme are also worked out.

PROBABILISTIC TELEPORTATION OF AN ARBITRARY TWO-QUBIT STATE VIA ONE-DIMENSIONAL FOUR-QUBIT CLUSTER-CLASS STATE

2008 ◽  
Vol 06 (05) ◽  
pp. 1093-1099 ◽  
Author(s):  
LIAN-FANG HAN ◽  
HAO YUAN
Keyword(s):  
Success Probability ◽  
Bell State ◽  
Qubit State ◽  
Classical Communication ◽  
Present Scheme ◽  
One Dimensional ◽  
Classical Communication Cost ◽  
Probabilistic Teleportation ◽  
Cluster Class ◽  
Bell State Measurements

An explicit scheme for probabilistically teleporting an arbitrary two-qubit state is proposed by using a one-dimensional four-qubit cluster-class state as the quantum channel. In the scheme, the sender first performs two Bell state measurements (BSMs). Then with the sender's help, the receiver can reconstruct the original state probabilistically by introducing an auxiliary qubit and making appropriate unitary operations. Moreover, the total success probability and classical communication cost of the present scheme are also calculated.

scholarly journals Hyperentanglement concentration of nonlocal two-photon six-qubit systems via the cross-Kerr nonlinearity

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Qian Liu ◽  
Guo-Zhu Song ◽  
Tian-Hui Qiu ◽  
Xiao-Min Zhang ◽  
Hong-Yang Ma ◽  
...  
Keyword(s):  
Degrees Of Freedom ◽  
Success Probability ◽  
Bell State ◽  
Kerr Nonlinearity ◽  
Longitudinal Momentum ◽  
Unknown Parameters ◽  
Long Distance ◽  
Two Photon ◽  
Quantum Nondemolition ◽  
The Cross

AbstractWe present an efficient hyperentanglement concentration protocol (hyper-ECP) for two-photon six-qubit systems in nonlocal partially hyperentangled Bell states with unknown parameters. In our scheme, we use two identical partially hyperentangled states which are simultaneously entangled in polarization and two different longitudinal momentum degrees of freedom (DOFs) to distill the maximally hyperentangled Bell state. The quantum nondemolition detectors based on the cross-Kerr nonlinearity are used to realize the parity checks of two-photon systems in three DOFs. The hyper-ECP can extract all the useful entanglement source, and the success probability can reach the theory limit with the help of iteration. All these advantages make our hyper-ECP useful in long-distance quantum communication in the future.

Quantum information processing with hyperentangled photon states

2006 ◽  
Vol 6 (4&5) ◽  
pp. 336-350
Author(s):  
S. P. Walborn ◽  
M. P. Almeida ◽  
P. H. Souto Ribeiro ◽  
C. H. Monken
Keyword(s):  
Information Processing ◽  
Quantum Information ◽  
Degrees Of Freedom ◽  
Quantum Information Processing ◽  
Success Probability ◽  
Bell State ◽  
Multiple Degrees Of Freedom ◽  
Photon States ◽  
Probabilistic Nature ◽  
Bell State Measurements

We discuss quantum information processing with hyperentangled photon states - states entangled in multiple degrees of freedom. Using an additional entangled degree of freedom as an ancilla space, it has been shown that it is possible to perform efficient Bell-state measurements. We briefly review these results and present a novel deterministic quantum key distribution protocol based on Bell-state measurements of hyperentangled photons. In addition, we propose a scheme for a probabilistic controlled-not gate which operates with a 50% success probability. We also show that despite its probabilistic nature, the controlled-not gate can be used for an efficient, nonlocal demonstration of the Deutsch algorithm using two separate photons.

Sign in / Sign up

Export Citation Format

Share Document