Simultaneous Teleportation of Arbitrary Two-qubit and Two Arbitrary Single-qubit States Using A Single Quantum Resource

2017 ◽  
Vol 57 (1) ◽  
pp. 1-8 ◽  
Author(s):  
Binayak S. Choudhury ◽  
Arpan Dhara
Keyword(s):  
Single Quantum ◽  
Single Qubit ◽  
Qubit States

Quantum Merlin-Arthur with Clifford Arthur

2015 ◽  
Vol 15 (15&16) ◽  
pp. 1420-1430 ◽  
Author(s):  
Tomoyuki Morimae ◽  
Masahito Hayashi ◽  
Harumichi Nishimura ◽  
Keisuke Fujii
Keyword(s):  
Quantum Computing ◽  
Computational Power ◽  
Xor Gate ◽  
Single Qubit ◽  
Qubit States

We show that the class QMA does not change even if we restrict Arthur’s computing ability to only Clifford gate operations (plus classical XOR gate). The idea is to use the fact that the preparation of certain single-qubit states, so called magic states, plus any Clifford gate operations are universal for quantum computing. If Merlin is honest, he sends the witness plus magic states to Arthur. If Merlin is malicious, he might send other states to Arthur, but Arthur can verify the correctness of magic states by himself. We also generalize the result to QIP(3): we show that the class QIP(3) does not change even if the computational power of the verifier is restricted to only Clifford gate operations (plus classical XOR gate).

scholarly journals Measuring the Tangle of Three-Qubit States

Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 436 ◽  
Author(s):  
Adrián Pérez-Salinas ◽  
Diego García-Martín ◽  
Carlos Bravo-Prieto ◽  
José Latorre
Keyword(s):  
Direct Measurement ◽  
Canonical Form ◽  
Quantum Circuit ◽  
Quantum Gates ◽  
Tripartite Entanglement ◽  
Single Qubit ◽  
Optimal Values ◽  
Random States ◽  
Qubit States ◽  
Computational Basis

We present a quantum circuit that transforms an unknown three-qubit state into its canonical form, up to relative phases, given many copies of the original state. The circuit is made of three single-qubit parametrized quantum gates, and the optimal values for the parameters are learned in a variational fashion. Once this transformation is achieved, direct measurement of outcome probabilities in the computational basis provides an estimate of the tangle, which quantifies genuine tripartite entanglement. We perform simulations on a set of random states under different noise conditions to asses the validity of the method.

Cyclic quantum teleportation via GHZ-like state

2020 ◽  
pp. 2050333
Author(s):  
Vikram Verma
Keyword(s):  
Quantum Teleportation ◽  
The Other ◽  
Single Qubit ◽  
Bidirectional Quantum Teleportation ◽  
Other Hand ◽  
Qubit States

Following the work of Chen et al. [Quantum Inf. Process. 16, 201 (2017)] and Zhang [Mod. Phys. Lett. A 34, 1950290 (2019)], we propose a scheme for cyclic quantum teleportation (CYQT) in which three participants Alice, Bob and Charlie can teleport three arbitrary single-qubit information states cyclically among themselves by using GHZ-like states. Chen et al. and Zhang proposed schemes for CYQT and bidirectional quantum teleportation (BQT) involving three participants, respectively. In the scheme of Chen et al., the quantum teleportation (QT) can be realized successfully between any two participants without the help of third participants and in Zhang’s scheme, two unknown single-qubit states are teleported bidirectionally between two participants with the help of a third participant. On the other hand, in our proposed scheme, all the three participants are controller as well as sender and receiver. The teleportation processes Alice [Formula: see text] Bob, Bob [Formula: see text] Charlie and Charlie [Formula: see text] Alice are controlled by Charlie, Alice and Bob, respectively, and hence the CYQT could not be realized successfully without the cooperation of all three participants. If any one participant denies to cooperate with other two participants, then the CYQT cannot be realized successfully.

Quantum Private Comparison of Arbitrary Single Qubit States Based on Swap Test

2021 ◽  
Author(s):  
Xi Huang ◽  
Yan Chang ◽  
Wen Cheng ◽  
Min Hou ◽  
Shi-Bin Zhang
Keyword(s):  
Quantum State ◽  
Private Information ◽  
Security Analysis ◽  
Entanglement Swapping ◽  
Third Party ◽  
Quantum Private Comparison ◽  
Single Qubit ◽  
Private Comparison ◽  
Comparison Results ◽  
Qubit States

Abstract In this paper, by using swap test, a quantum private comparison (QPC) protocol of arbitrary single qubit states with a semi-honest third party is proposed. The semi-honest third party (TP) is required to help two participants perform the comparison. She can record intermediate results and do some calculations in the whole process of the protocol execution, but she cannot conspire with any participants. In the process of comparison, TP cannot get two participants' private information except the comparison results. According to the security analysis, the proposed protocol can resist both outsider attacks and participant attacks. Compared with the existing QPC protocols, the proposed one does not require any entanglement swapping technology, and it can compare two participants' qubits by performing swap test, which is easier to implement with current technology. Meanwhile, the proposed protocol can compare secret integers. It encodes secret integers into the amplitude of quantum state rather than transfer them as binary representations, and the encoded quantum state is compared by performing swap test. Additionally, the proposed QPC protocol is extended to the QPC of arbitrary single qubit states by using multi-qubit swap test.

scholarly journals Statistical mixtures of states can be more quantum than their superpositions: Comparison of nonclassicality measures for single-qubit states

2015 ◽  
Vol 91 (4) ◽  
Author(s):  
Adam Miranowicz ◽  
Karol Bartkiewicz ◽  
Anirban Pathak ◽  
Jan Peřina ◽  
Yueh-Nan Chen ◽  
...  
Keyword(s):  
Single Qubit ◽  
Qubit States

scholarly journals Impossibility of blind quantum sampling for classical client

2019 ◽  
Vol 19 (9&10) ◽  
pp. 793-806
Author(s):  
Tomoyuki Morimae ◽  
Harumichi Nishimura ◽  
Yuki Takeuch ◽  
Seiichiro Tani
Keyword(s):  
Quantum Computing ◽  
Polynomial Time ◽  
Open Problem ◽  
Input Output ◽  
Information Theoretic ◽  
Single Qubit ◽  
The Third ◽  
The One ◽  
Qubit States ◽  
Polynomial Time Hierarchy

Blind quantum computing enables a client, who can only generate or measure single-qubit states, to delegate quantum computing to a remote quantum server in such a way that the input, output, and program are hidden from the server. It is an open problem whether a completely classical client can delegate quantum computing blindly (in the information theoretic sense). In this paper, we show that if a completely classical client can blindly delegate sampling of subuniversal models, such as the DQC1 model and the IQP model, then the polynomial-time hierarchy collapses to the third level. Our delegation protocol is the one where the client first sends a polynomial-length bit string to the server and then the server returns a single bit to the client. Generalizing the no-go result to more general setups is an open problem.

scholarly journals State-independent quantum key distribution with two-way classical communication

2019 ◽  
Vol 19 (15&16) ◽  
pp. 1279-1293
Author(s):  
Radha Pyari Sandhir
Keyword(s):  
Quantum Key Distribution ◽  
Type Inequality ◽  
Key Distribution ◽  
Key Generation ◽  
Classical Communication ◽  
Single Qubit ◽  
Chsh Inequality ◽  
Qubit States ◽  
Quantum Key Distribution Protocol ◽  
Sequential Measurements

A quantum key distribution protocol is proposed that is a variation of BB84 that provides raw key generation from correlations that violate a Bell-type inequality for single qubit systems and not entangled pairs. Additionally, it 1) is state-independent, 2) involves two-way classical communication, and 3) does not require basis matching between the two parties. The Brukner-Taylor-Cheung-Vedral (BTCV) time-like form of the Bell-CHSH inequality by Bruk and by Tay is employed as an eavesdropping check; sequential measurements lead to an inequality identical in form to the Bell-CHSH inequality, which relies only on the measurements performed with no regard for the qubit states. We show that this form manifests naturally from the non-commutativity of observables.

Optimization of coherent attacks in generalizations of the BB84 quantum bit commitment protocol

2002 ◽  
Vol 2 (1) ◽  
pp. 66-96
Author(s):  
R.W. Spekkens ◽  
T. Rudolph
Keyword(s):  
State Estimation ◽  
Quantum State ◽  
Upper Bound ◽  
Upper Bounds ◽  
Entangled State ◽  
Quantum State Estimation ◽  
Quantum Bit ◽  
Bit Commitment ◽  
Single Qubit ◽  
Qubit States

It is well known that no quantum bit commitment protocol is unconditionally secure. Nonetheless, there can be non-trivial upper bounds on both Bob's probability of correctly estimating Alice's commitment and Alice's probability of successfully unveiling whatever bit she desires. In this paper, we seek to determine these bounds for generalizations of the BB84 bit commitment protocol. In such protocols, an honest Alice commits to a bit by randomly choosing a state from a specified set and submitting this to Bob, and later unveils the bit to Bob by announcing the chosen state, at which point Bob measures the projector onto the state. Bob's optimal cheating strategy can be easily deduced from well known results in the theory of quantum state estimation. We show how to understand Alice's most general cheating strategy, (which involves her submitting to Bob one half of an entangled state) in terms of a theorem of Hughston, Jozsa and Wootters. We also show how the problem of optimizing Alice's cheating strategy for a fixed submitted state can be mapped onto a problem of state estimation. Finally, using the Bloch ball representation of qubit states, we identify the optimal coherent attack for a class of protocols that can be implemented with just a single qubit. These results provide a tight upper bound on Alice's probability of successfully unveiling whatever bit she desires in the protocol proposed by Aharonov et al., and lead us to identify a qubit protocol with even greater security.

Sign in / Sign up

Export Citation Format

Share Document