Succinct Blind Quantum Computation Using a Random Oracle

04/27/2020
by   Jiayu Zhang, et al.
0

In the universal blind quantum computation problem, a client wants to make use of a single quantum server to evaluate C|0〉 where C is an arbitrary quantum circuit while keeping C secret. The client's goal is to use as few resources as possible. This problem, first raised by Broadbent, Fitzsimons and Kashefi [FOCS09, arXiv:0807.4154], has become fundamental to the study of quantum cryptography, not only because of its own importance, but also because it provides a testbed for new techniques that can be later applied to related problems (for example, quantum computation verification). Known protocols on this problem are mainly either information-theoretically (IT) secure or based on trapdoor assumptions (public key encryptions). In this paper we study how the availability of symmetric-key primitives, modeled by a random oracle, changes the complexity of universal blind quantum computation. We give a new universal blind quantum computation protocol. Similar to previous works on IT-secure protocols (for example, BFK [FOCS09, arXiv:0807.4154]), our protocol can be divided into two phases. In the first phase the client prepares some quantum gadgets with relatively simple quantum gates and sends them to the server, and in the second phase the client is entirely classical – it does not even need quantum storage. Crucially, the protocol's first phase is succinct, that is, its complexity is independent of the circuit size. Given the security parameter κ, its complexity is only a fixed polynomial of κ, and can be used to evaluate any circuit (or several circuits) of size up to a subexponential of κ. In contrast, known schemes either require the client to perform quantum computations that scale with the size of the circuit [FOCS09, arXiv:0807.4154], or require trapdoor assumptions [Mahadev, FOCS18, arXiv:1708.02130].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2022

Classical Verification of Quantum Computations in Linear Time

In the quantum computation verification problem, a quantum server wants ...
research
02/02/2020

Full-Blind Delegating Private Quantum Computation

The delegating private quantum computation (DQC) protocol with the unive...
research
02/23/2018

Delegated Pseudo-Secret Random Qubit Generator

We define the functionality of delegated pseudo-secret random qubit gene...
research
12/09/2020

Constant-round Blind Classical Verification of Quantum Sampling

In a recent breakthrough, Mahadev constructed a classical verification o...
research
06/27/2022

Multi-agent blind quantum computation without universal cluster state

Blind quantum computation (BQC) protocols enable quantum algorithms to b...
research
10/22/2021

On the Connection Between Quantum Pseudorandomness and Quantum Hardware Assumptions

This paper, for the first time, addresses the questions related to the c...
research
12/25/2022

Simulation of Networked Quantum Computing on Encrypted Data

Due to the limited availability of quantum computing power in the near f...

Please sign up or login with your details

Forgot password? Click here to reset