scholarly journals BLIND QUANTUM COMPUTATION

2006 ◽  
Vol 04 (05) ◽  
pp. 883-898 ◽  
Author(s):  
PABLO ARRIGHI ◽  
LOUIS SALVAIL
Keyword(s):  
Quantum Theory ◽  
Quantum Computation ◽  
Security Analysis ◽  
Input Output ◽  
Random Input ◽  
Efficient Procedure ◽  
Computational Resources ◽  
Class Of Functions ◽  
Blind Quantum Computation

We investigate the possibility of having someone carry out the work of executing a function for you, but without letting him learn anything about your input. Say Alice wants Bob to compute some known function f upon her input x, but wants to prevent Bob from learning anything about x. The situation arises for instance if client Alice has limited computational resources in comparison with mistrusted server Bob, or if x is an inherently mobile piece of data. Could there be a protocol whereby Bob is forced to compute ,f(x)blindly, i.e. without observing x? We provide such a blind computation protocol for the class of functions which admit an efficient procedure to generate random input–output pairs, e.g. factorization. The cheat-sensitive security achieved relies only upon quantum theory being true. The security analysis carried out assumes the eavesdropper performs individual attacks.

scholarly journals Universal single-server blind quantum computation for classical clients

2021 ◽  
Vol 19 (1) ◽  
pp. 015202
Author(s):  
Hai-Ru Xu ◽  
Bang-Hai Wang
Keyword(s):  
Quantum Computation ◽  
Single Server ◽  
Input Output ◽  
Certificate Authority ◽  
Blind Quantum Computation

Abstract Blind quantum computation (BQC) allows a client without enough quantum technologies to delegate her quantum computation to a remote quantum server, while keeping her input, output and algorithm secure. In this paper, we propose a universal single-server and almost-classical-client BQC protocol. In this protocol, the client interfaces with only one server and the only ability of the client required is to get particles from the trusted center and forward them to the server. We present an analysis of this protocol and modify it to a universal single-server and fully-classical-client BQC protocol by improving the ability of the trusted center. Based on our protocols and recent works, a new ‘Cloud + Certificate Authority (CA)’ style is proposed for the BQC.

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 Universal remote quantum computation assisted by the cavity input–output process

2015 ◽  
Vol 471 (2184) ◽  
pp. 20150274 ◽  
Author(s):  
Ming-Xing Luo ◽  
Xiaojun Wang
Keyword(s):  
Quantum Computation ◽  
Quantum Electrodynamics ◽  
Cavity Quantum Electrodynamics ◽  
Output Process ◽  
Input Output ◽  
Toffoli Gate ◽  
Classical Communication ◽  
Optical Cavities ◽  
Proposed Model ◽  
Einstein Podolsky Rosen

Quantum computing may provide potential superiority to solve some difficult problems. We propose a scheme for scalable remote quantum computation based on an interface between the photon and the spin of an electron confined in a quantum dot embedded in a microcavity. By successively interacting auxiliary photon pulses with spins charged in optical cavities, a prototypical quantum controlled–controlled flip gate (Toffoli gate) is achieved on a remote three-spin system using only one Einstein–Podolsky–Rosen entanglement, and local operations and classical communication. Our proposed model is shown to be robust to practical noise and experimental imperfections in current cavity–quantum electrodynamics techniques.

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
Sign in / Sign up

Export Citation Format

Share Document