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

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.

2017 ◽  
Vol 95 (5) ◽  
pp. 498-503
Author(s):  
Syed Tahir Amin ◽  
Aeysha Khalique

We present our model to teleport an unknown quantum state using entanglement between two distant parties. Our model takes into account experimental limitations due to contribution of multi-photon pair production of parametric down conversion source, inefficiency, dark counts of detectors, and channel losses. We use a linear optics setup for quantum teleportation of an unknown quantum state by the sender performing a Bell state measurement. Our theory successfully provides a model for experimentalists to optimize the fidelity by adjusting the experimental parameters. We apply our model to a recent experiment on quantum teleportation and the results obtained by our model are in good agreement with the experimental results.


2007 ◽  
Vol 18 (11) ◽  
pp. 1699-1706 ◽  
Author(s):  
LI DONG ◽  
XIAOMING XIU ◽  
YAJUN GAO

A scheme for quantum state sharing (QSTS) of a one-particle state is proposed for a three-particle GHZ state utilized as a quantum channel. After the sender (Alice) makes Bell-state measurements (BM) on her particles, and the controller (Charlie) performs a computational basis measurement (CM), the recipient (Bob) only needs to carry out a unitary transformation of the classical information from the sender and the controller. Finally, the scheme is generalized to multiparty QSTS of a one-qubit state with n agents and an m-qubit state with n agents.


2012 ◽  
Vol 55 (12) ◽  
pp. 2439-2444 ◽  
Author(s):  
YuGuang Yang ◽  
Juan Xia ◽  
Xin Jia ◽  
Hua Zhang

2003 ◽  
Vol 14 (06) ◽  
pp. 757-763 ◽  
Author(s):  
XIAOYU LI

In this paper we provide a quantum key distribution (QKD) scheme based on the correlations of Einstein–Podolsky–Rosen (EPR) pairs. The scheme uses an auxiliary qubit to interact with the EPR pair and does the Bell state measurement to get the key. It is proved to be secure. All EPR pairs are used in distributing the key except some error-checking bits. So it is efficient. On the other hand there are less classical communications needed in the scheme.


2012 ◽  
Vol 10 (02) ◽  
pp. 1250003 ◽  
Author(s):  
OMAR JIMÉNEZ ◽  
CARLOS MUÑOZ ◽  
ANDREI B. KLIMOV ◽  
ALDO DELGADO

We propose a scheme for the deterministic sharing arbitrary qudit states among three distant parties and characterize the set of ideal quantum channels. We also show that the use of non-ideal quantum channels for quantum state sharing can be related to the problem of quantum state discrimination. This allows us to formulate a protocol which leads to perfect quantum state sharing with a finite success probability.


2016 ◽  
Vol 16 (3&4) ◽  
pp. 271-290
Author(s):  
Parminder S. Bhatia

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.


2009 ◽  
Vol 20 (04) ◽  
pp. 557-564
Author(s):  
GUI-XIA PAN ◽  
YI-MIN LIU ◽  
WEN ZHANG ◽  
ZHAN-JUN ZHANG

A scheme is proposed for remotely preparing a class of three-particle GHZ states by using a Bell state and a three-qubit GHZ state as the quantum channel. In the scheme, a two-qubit collective state measurement is performed and the necessary classical communication cost is 0.25 cbit on average. In general, the target state can be successfully prepared with the probability 1/4. However, if the state belongs to some special classes, the preparation success probability can reach 0.5 or even 1 after consuming a little additional classical resource. Comparing with the recent scheme [Opt. Commun.281, 871 (2008)], the present scheme has some advantages, e.g., the simpler quantum joint measurement and the less classical resource consumption.


2010 ◽  
Vol 10 (5) ◽  
pp. 603-608 ◽  
Author(s):  
Yi-you Nie ◽  
Yuan-hua Li ◽  
Jun-chang Liu ◽  
Ming-huang Sang

Sign in / Sign up

Export Citation Format

Share Document