Rational proofs for quantum computing

04/24/2018
by   Tomoyuki Morimae, et al.
Kyoto University
0

It is an open problem whether a classical client (verifier) can delegate quantum computing to a remote quantum server (prover) in such a way that the correctness of quantum computing is somehow guaranteed. We show that such a delegation is possible if the prover is rational. More precisely, we introduce the following protocol. The BQP prover first sends the BPP verifier a single bit allegedly equal to the solution of the BQP decision problem that the verifier wants to solve. The verifier then gives the prover a reward whose amount is determined by the bit sent from the prover and some random numbers the verifier samples from certain probability distributions. The reward function is constructed in such a way that the rational prover, who wants to maximize the expected profit, has to send the correct bit to the verifier.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/12/2019

Sumcheck-based delegation of quantum computing to rational server

Delegated quantum computing enables a client with a weak computational p...
12/10/2018

Impossibility of blind quantum sampling for classical client

Blind quantum computing enables a client, who can only generate or measu...
09/07/2021

QEnclave – A practical solution for secure quantum cloud computing

We introduce a secure hardware device named a QEnclave that can secure t...
02/23/2018

Delegated Pseudo-Secret Random Qubit Generator

We define the functionality of delegated pseudo-secret random qubit gene...
11/28/2019

Expected Runtime of Quantum Programs

Building upon recent work on probabilistic programs, we formally define ...
01/10/2022

Private Set Intersection with Delegated Blind Quantum Computing

Private set intersection is an important problem with implications in ma...
05/24/2019

Quantum Period Finding with a Single Output Qubit -- Factoring n-bit RSA with n/2 Qubits

We study quantum period finding algorithms such as Simon, Shor, and Eker...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

References