scholarly journals Blind quantum computation where a user only performs single-qubit gates

2021 ◽  
Vol 142 ◽  
pp. 107190
Author(s):  
Qin Li ◽  
Chengdong Liu ◽  
Yu Peng ◽  
Fang Yu ◽  
Cai Zhang
Keyword(s):  
Quantum Computation ◽  
Single Qubit ◽  
Blind Quantum Computation

scholarly journals Improved Resource State for Verifiable Blind Quantum Computation

Entropy ◽  
2020 ◽  
Vol 22 (9) ◽  
pp. 996
Author(s):  
Qingshan Xu ◽  
Xiaoqing Tan ◽  
Rui Huang
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Fault Tolerant ◽  
Maximal Degree ◽  
Recent Advances ◽  
Quantum Computations ◽  
Blind Quantum Computation ◽  
Computation Graph ◽  
Resource State

Recent advances in theoretical and experimental quantum computing raise the problem of verifying the outcome of these quantum computations. The recent verification protocols using blind quantum computing are fruitful for addressing this problem. Unfortunately, all known schemes have relatively high overhead. Here we present a novel construction for the resource state of verifiable blind quantum computation. This approach achieves a better verifiability of 0.866 in the case of classical output. In addition, the number of required qubits is 2N+4cN, where N and c are the number of vertices and the maximal degree in the original computation graph, respectively. In other words, our overhead is less linear in the size of the computational scale. Finally, we utilize the method of repetition and fault-tolerant code to optimise the verifiability.

scholarly journals Exact dynamics of single-qubit-gate fidelities under the measurement-based quantum computation scheme

2012 ◽  
Vol 86 (4) ◽  
Author(s):  
L. G. E. Arruda ◽  
F. F. Fanchini ◽  
R. d. J. Napolitano ◽  
J. E. M. Hornos ◽  
A. O. Caldeira
Keyword(s):  
Quantum Computation ◽  
Single Qubit ◽  
Computation Scheme ◽  
Qubit Gate

Universal blind quantum computation via Pauli eigenstates

2017 ◽  
Author(s):  
Leonardo Disilvestro ◽  
Theodoros Kapourniotis ◽  
Elham Kashefi ◽  
Damian Markham
Keyword(s):  
Quantum Computation ◽  
Blind Quantum Computation

scholarly journals APPLICATIONS OF ATOMIC ENSEMBLES IN DISTRIBUTED QUANTUM COMPUTING

2010 ◽  
Vol 08 (01n02) ◽  
pp. 181-218 ◽  
Author(s):  
MARCIN ZWIERZ ◽  
PIETER KOK
Keyword(s):  
Quantum Information ◽  
Quantum Computation ◽  
Quantum Computer ◽  
Success Probability ◽  
Quantum Memory ◽  
Quantum Network ◽  
Atomic Ensembles ◽  
Cluster States ◽  
Ghz States ◽  
Single Qubit

Thesis chapter. The fragility of quantum information is a fundamental constraint faced by anyone trying to build a quantum computer. A truly useful and powerful quantum computer has to be a robust and scalable machine. In the case of many qubits which may interact with the environment and their neighbors, protection against decoherence becomes quite a challenging task. The scalability and decoherence issues are the main difficulties addressed by the distributed model of quantum computation. A distributed quantum computer consists of a large quantum network of distant nodes — stationary qubits which communicate via flying qubits. Quantum information can be transferred, stored, processed and retrieved in decoherence-free fashion by nodes of a quantum network realized by an atomic medium — an atomic quantum memory. Atomic quantum memories have been developed and demonstrated experimentally in recent years. With the help of linear optics and laser pulses, one is able to manipulate quantum information stored inside an atomic quantum memory by means of electromagnetically induced transparency and associated propagation phenomena. Any quantum computation or communication necessarily involves entanglement. Therefore, one must be able to entangle distant nodes of a distributed network. In this article, we focus on the probabilistic entanglement generation procedures such as well-known DLCZ protocol. We also demonstrate theoretically a scheme based on atomic ensembles and the dipole blockade mechanism for generation of inherently distributed quantum states so-called cluster states. In the protocol, atomic ensembles serve as single qubit systems. Hence, we review single-qubit operations on qubit defined as collective states of atomic ensemble. Our entangling protocol requires nearly identical single-photon sources, one ultra-cold ensemble per physical qubit, and regular photodetectors. The general entangling procedure is presented, as well as a procedure that generates in a single stepQ-qubit GHZ states with success probability psuccess ~ ηQ/2, where η is the combined detection and source efficiency. This is significantly more efficient than any known robust probabilistic entangling operation. The GHZ states form the basic building block for universal cluster states, a resource for the one-way quantum computer.

scholarly journals Fault-Tolerant Operations for Universal Blind Quantum Computation

2015 ◽  
Vol 12 (1) ◽  
pp. 1-26 ◽  
Author(s):  
Chia-Hung Chien ◽  
Rodney Van Meter ◽  
Sy-Yen Kuo
Keyword(s):  
Quantum Computation ◽  
Fault Tolerant ◽  
Blind Quantum Computation

scholarly journals ON THE POWER QUANTUM COMPUTATION OVER REAL HILBERT SPACES

2013 ◽  
Vol 11 (01) ◽  
pp. 1350001 ◽  
Author(s):  
MATTHEW McKAGUE
Keyword(s):  
Hilbert Space ◽  
Quantum Computation ◽  
Hilbert Spaces ◽  
Quantum Circuit ◽  
Complex Hilbert Space ◽  
Complexity Classes ◽  
Complex Numbers ◽  
Real Numbers ◽  
Single Qubit ◽  
Quantum Complexity

We consider the power of various quantum complexity classes with the restriction that states and operators are defined over a real, rather than complex, Hilbert space. It is well known that a quantum circuit over the complex numbers can be transformed into a quantum circuit over the real numbers with the addition of a single qubit. This implies that BQP retains its power when restricted to using states and operations over the reals. We show that the same is true for QMA (k), QIP (k), QMIP and QSZK.

Sign in / Sign up

Export Citation Format

Share Document