scholarly journals Semi-loss-tolerant strong coin flipping protocol using EPR pairs

2012 ◽  
Vol 12 (5&6) ◽  
pp. 490-501
Author(s):  
Jia-Jun Ma ◽  
Fen-Zhuo Guo ◽  
Qian Yang ◽  
Yan-Bing Li ◽  
Qiao-Yan Wen

In this paper, we present a quantum strong coin flipping protocol. In this protocol, an EPR pair and a quantum memory storage are made use of, and losses in the quantum communication channel and quantum memory storage are all analyzed. We obtain the bias in the fair scenario as a function of $p$, where $p$ is the probability that the particle in Bob's quantum memory storage is lost, which means our bias varies as the degree of losses in the quantum memory storage changes. Therefore we call our protocol semi-loss-tolerant. We also show that the bias decreases with decreasing $p$. When $p$ approaches $0$, the bias approaches 0.3536, which is less than that of all the previous loss-tolerant protocols. Details of both parties' optimal cheating strategies are also given and analyzed. What's more, experimental feasibility is discussed and demonstrated. Compared with previous qubit-based loss-tolerant SCF protocols, we introduce the EPR pair to keep our protocol loss-tolerant while trying to push down the bias. In addition, a quantum memory storage is used and the losses in it has been taken into account. We obtain the bias in the fair scenario as a function of $p$, where $p$ is the probability that the particle in Bob's quantum memory storage is lost, which means our bias varies as the degree of losses in the quantum memory storage changes. We also show that the bias decreases with decreasing $p$. When $p$ approaches $0$, the bias approaches 0.3536, which is less than that of all the previous loss-tolerant protocols. Details of both parties' optimal cheating strategies are also given and analyzed. Besides, experimental feasibility is discussed and demonstrated.

Author(s):  
Phillip Kaye ◽  
Raymond Laflamme ◽  
Michele Mosca

We are now ready to look at our first protocols for quantum information. In this section, we examine two communication protocols which can be implemented using the tools we have developed in the preceding sections. These protocols are known as superdense coding and quantum teleportation. Both are inherently quantum: there are no classical protocols which behave in the same way. Both involve two parties who wish to perform some communication task between them. In descriptions of such communication protocols (especially in cryptography), it is very common to name the two parties ‘Alice’ and ‘Bob’, for convenience. We will follow this tradition. We will repeatedly refer to communication channels. A quantum communication channel refers to a communication line (e.g. a fiberoptic cable), which can carry qubits between two remote locations. A classical communication channel is one which can carry classical bits (but not qubits).1 The protocols (like many in quantum communication) require that Alice and Bob initially share an entangled pair of qubits in the Bell state The above Bell state is sometimes referred to as an EPR pair. Such a state would have to be created ahead of time, when the qubits are in a lab together and can be made to interact in a way which will give rise to the entanglement between them. After the state is created, Alice and Bob each take one of the two qubits away with them. Alternatively, a third party could create the EPR pair and give one particle to Alice and the other to Bob. If they are careful not to let them interact with the environment, or any other quantum system, Alice and Bob’s joint state will remain entangled. This entanglement becomes a resource which Alice and Bob can use to achieve protocols such as the following. Suppose Alice wishes to send Bob two classical bits of information. Superdense coding is a way of achieving this task over a quantum channel, requiring only that Alice send one qubit to Bob. Alice and Bob must initially share the Bell state Suppose Alice is in possession of the first qubit and Bob the second qubit.


Author(s):  
Евгений Викторович Василиу ◽  
Иван Романович Гулаков ◽  
Андрей Олегович Зеневич ◽  
Александр Михалович Тимофеев ◽  
Сергей Валентинович Николаенко

2007 ◽  
Vol 17 (03) ◽  
pp. 323-335 ◽  
Author(s):  
NAYA NAGY ◽  
SELIM G. AKL

The aim of quantum key distribution protocols is to establish a secret key among two parties with high security confidence. Such algorithms generally require a quantum channel and an authenticated classical channel. This paper presents a totally new perception of communication in such protocols. The quantum communication alone satisfies all needs of array communication between the two parties. Even so, the quantum communication channel does not need to be protected or authenticated whatsoever. As such, our algorithm is a purely quantum key distribution algorithm. The only certain identification of the two parties is through public keys.


2014 ◽  
Vol 571-572 ◽  
pp. 469-472
Author(s):  
Xin Hua Cai ◽  
Jian Jun Nie

Base on the dispersive atom-cavity field interaction, the scheme for preparing the entangled coherent state is discussed. An experimentally feasible protocol for realizing entanglement concentration of the entangled coherent states by using a two-level atom interacting with caving fields is proposed. In this protocol, the entanglement between two coherent states, and , with the same amplitude but a phase difference is utilized as the quantum communication channel. The process of the entanglement concentration is implemented by using a two-level atom interacting with caving fields and two-modes orthogonal states measurement. With the present development of cavity quantum electrodynamics (QED) techniques, the scheme can be achieved.


Sign in / Sign up

Export Citation Format

Share Document