scholarly journals Multi-Party Quantum Summation Based on Quantum Teleportation

Entropy ◽  
2019 ◽  
Vol 21 (7) ◽  
pp. 719 ◽  
Author(s):  
Cai Zhang ◽  
Mohsen Razavi ◽  
Zhiwei Sun ◽  
Qiong Huang ◽  
Haozhen Situ

We present a secure multi-party quantum summation protocol based on quantum teleportation, in which a malicious, but non-collusive, third party (TP) helps compute the summation. In our protocol, TP is in charge of entanglement distribution and Bell states are shared between participants. Users encode the qubits in their hand according to their private bits and perform Bell-state measurements. After obtaining participants’ measurement results, TP can figure out the summation. The participants do not need to send their encoded states to others, and the protocol is therefore congenitally free from Trojan horse attacks. In addition, our protocol can be made secure against loss errors, because the entanglement distribution occurs only once at the beginning of our protocol. We show that our protocol is secure against attacks by the participants as well as the outsiders.

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Chia-Wei Tsai ◽  
Chun-Wei Yang

AbstractThe mediated semi-quantum key distribution (MSQKD) protocol is an important research issue that lets two classical participants share secret keys securely between each other with the help of a third party (TP). However, in the existing MSQKD protocols, there are two improvable issues, namely (1) the classical participants must be equipped with expensive detectors to avoid Trojan horse attacks and (2) the trustworthiness level of TP must be honest. To the best of our knowledge, none of the existing MSQKD protocols can resolve both these issues. Therefore, this study takes Bell states as the quantum resource to propose a MSQKD protocol, in which the classical participants do not need a Trojan horse detector and the TP is dishonest. Furthermore, the proposed protocol is shown to be secure against well-known attacks and the classical participants only need two quantum capabilities. Therefore, in comparison to the existing MSQKD protocols, the proposed protocol is better practical.


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.


2013 ◽  
Vol 27 (04) ◽  
pp. 1350030 ◽  
Author(s):  
MING-QIANG BAI ◽  
JIA-YIN PENG ◽  
ZHI-WEN MO

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.


Author(s):  
Jinwei Wang ◽  
Liping Huang

In this paper, an asymmetric bidirectional controlled quantum teleportation via a six-qubit partially entangled state is given, in which Alice wants to transmit a two-qubit entangled state to Bob and Bob wants to transmit a single-qubit state to Alice on the same time. Although the six-qubit state as quantum channel is partially entangled, the teleportation is implemented deterministically. Furthermore, only Bell-state measurements, single-qubit measurements and some unitary operations are needed in the scheme.


2015 ◽  
Vol 13 (02) ◽  
pp. 1550011 ◽  
Author(s):  
Cai Zhang ◽  
Zhi-Wei Sun ◽  
Xiang Huang ◽  
Dong-Yang Long

In this paper, we propose a quantum summation protocol, in which the genuinely maximally entangled six-qubit states found by Borras et al., are employed. Because of the excellent properties of the genuinely maximally entangled six-qubit states, the presented protocol allows three participants to compute the summation of their inputs without the help of a trusted third party and preserve the privacy of their inputs, respectively. The participants do not need any unitary operations. In addition, the proposed protocol utilizes the one-step quantum transmission and therefore is congenitally free from Trojan horse attacks. We have also shown that our protocol is secure against other well-known attacks over lossy and noisy quantum channels.


2012 ◽  
Vol 26 (31) ◽  
pp. 1250208 ◽  
Author(s):  
MING-QIANG BAI ◽  
ZHI-WEN MO

In this paper, by using a proper positive operator-valued measurement, we propose a new tripartite scheme for probabilistically implementing quantum state sharing of an arbitrary unknown three-qubit state with two non-maximally entangled states, one is four-qubit state, another is three-qubit state. In the scheme, the Boss Alice partitions her unknown original state with two Bell-state measurements and a single-qubit projective measurement. Then she publishes her measurement results via a classical channel. With an agent Charlie's help, another agent Bob can recover the original state in probabilistic manner by performing a proper POVM.


2011 ◽  
Vol 09 (01) ◽  
pp. 571-581 ◽  
Author(s):  
ZHANG-YIN WANG ◽  
XING-QIANG YANG

By using a proper positive operator-valued measure (POVM), we present a new scheme for probabilistically implementing quantum state sharing of an arbitrary unknown two-qubit state with two non-maximally entangled three-qubit states. In this paper, the sender Alice averagely partitions its unknown original state with two Bell-state measurements and publishes her measurement results via a classical channel. Then by performing a proper POVM, it is shown that either of the two agents Bob or Charlie can recover the original state in a probabilistic manner provided that he/she gets another one's help. Lastly, we concisely generalize the tripartite scheme to a multi-party case.


2021 ◽  
Vol 7 (1) ◽  
Author(s):  
F. Basso Basset ◽  
F. Salusti ◽  
L. Schweickert ◽  
M. B. Rota ◽  
D. Tedeschi ◽  
...  

AbstractEfficient all-photonic quantum teleportation requires fast and deterministic sources of highly indistinguishable and entangled photons. Solid-state-based quantum emitters—notably semiconductor quantum dots—are a promising candidate for the role. However, despite the remarkable progress in nanofabrication, proof-of-concept demonstrations of quantum teleportation have highlighted that imperfections of the emitter still place a major roadblock in the way of applications. Here, rather than focusing on source optimization strategies, we deal with imperfections and study different teleportation protocols with the goal of identifying the one with maximal teleportation fidelity. Using a quantum dot with sub-par values of entanglement and photon indistinguishability, we show that the average teleportation fidelity can be raised from below the classical limit to 0.842(14), adopting a polarization-selective Bell state measurement and moderate spectral filtering. Our results, which are backed by a theoretical model that quantitatively explains the experimental findings, loosen the very stringent requirements set on the ideal entangled-photon source and highlight that imperfect quantum dots can still have a say in teleportation-based quantum communication architectures.


Sign in / Sign up

Export Citation Format

Share Document