Impossibility of perfectly-secure one-round delegated quantum computing for classical client

Tomoyuki Morimae, Takeshi Koshiba

Research output: Contribution to journalArticle

Abstract

Blind quantum computing protocols enable a client, who can generate or measure single-qubit states, to delegate quantum computing to a remote quantum server protecting the client’s privacy (i.e., input, output, and program). With current technologies, generations or measurements of single-qubit states are not too much burden for the client. In other words, secure delegated quantum computing is possible for \almost classical” clients. However, is it possible for a \completely classical” client? Here we consider a one-round perfectly-secure delegated quantum computing, and show that the protocol cannot satisfy both the correctness (i.e., the correct result is obtained when the server is honest) and the perfect blindness (i.e., the client’s privacy is completely protected) simultaneously unless BQP is in NP. Since BQP is not believed to be in NP, the result suggests the impossibility of the one-round perfectly-secure delegated quantum computing.

Original languageEnglish
Pages (from-to)214-221
Number of pages8
JournalQuantum Information and Computation
Volume19
Issue number3-4
Publication statusPublished - 2019 Mar 1

Fingerprint

Quantum Computing
quantum computation
Servers
Network protocols
privacy
Qubit
Privacy
Server
blindness
Correctness
output
Output

Keywords

  • Blind
  • Computing
  • Quantum

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistical and Nonlinear Physics
  • Nuclear and High Energy Physics
  • Mathematical Physics
  • Physics and Astronomy(all)
  • Computational Theory and Mathematics

Cite this

Impossibility of perfectly-secure one-round delegated quantum computing for classical client. / Morimae, Tomoyuki; Koshiba, Takeshi.

In: Quantum Information and Computation, Vol. 19, No. 3-4, 01.03.2019, p. 214-221.

Research output: Contribution to journalArticle

@article{f5dbad34419c4e7dbf1b8d136266694d,
title = "Impossibility of perfectly-secure one-round delegated quantum computing for classical client",
abstract = "Blind quantum computing protocols enable a client, who can generate or measure single-qubit states, to delegate quantum computing to a remote quantum server protecting the client’s privacy (i.e., input, output, and program). With current technologies, generations or measurements of single-qubit states are not too much burden for the client. In other words, secure delegated quantum computing is possible for \almost classical” clients. However, is it possible for a \completely classical” client? Here we consider a one-round perfectly-secure delegated quantum computing, and show that the protocol cannot satisfy both the correctness (i.e., the correct result is obtained when the server is honest) and the perfect blindness (i.e., the client’s privacy is completely protected) simultaneously unless BQP is in NP. Since BQP is not believed to be in NP, the result suggests the impossibility of the one-round perfectly-secure delegated quantum computing.",
keywords = "Blind, Computing, Quantum",
author = "Tomoyuki Morimae and Takeshi Koshiba",
year = "2019",
month = "3",
day = "1",
language = "English",
volume = "19",
pages = "214--221",
journal = "Quantum Information and Computation",
issn = "1533-7146",
publisher = "Rinton Press Inc.",
number = "3-4",

}

TY - JOUR

T1 - Impossibility of perfectly-secure one-round delegated quantum computing for classical client

AU - Morimae, Tomoyuki

AU - Koshiba, Takeshi

PY - 2019/3/1

Y1 - 2019/3/1

N2 - Blind quantum computing protocols enable a client, who can generate or measure single-qubit states, to delegate quantum computing to a remote quantum server protecting the client’s privacy (i.e., input, output, and program). With current technologies, generations or measurements of single-qubit states are not too much burden for the client. In other words, secure delegated quantum computing is possible for \almost classical” clients. However, is it possible for a \completely classical” client? Here we consider a one-round perfectly-secure delegated quantum computing, and show that the protocol cannot satisfy both the correctness (i.e., the correct result is obtained when the server is honest) and the perfect blindness (i.e., the client’s privacy is completely protected) simultaneously unless BQP is in NP. Since BQP is not believed to be in NP, the result suggests the impossibility of the one-round perfectly-secure delegated quantum computing.

AB - Blind quantum computing protocols enable a client, who can generate or measure single-qubit states, to delegate quantum computing to a remote quantum server protecting the client’s privacy (i.e., input, output, and program). With current technologies, generations or measurements of single-qubit states are not too much burden for the client. In other words, secure delegated quantum computing is possible for \almost classical” clients. However, is it possible for a \completely classical” client? Here we consider a one-round perfectly-secure delegated quantum computing, and show that the protocol cannot satisfy both the correctness (i.e., the correct result is obtained when the server is honest) and the perfect blindness (i.e., the client’s privacy is completely protected) simultaneously unless BQP is in NP. Since BQP is not believed to be in NP, the result suggests the impossibility of the one-round perfectly-secure delegated quantum computing.

KW - Blind

KW - Computing

KW - Quantum

UR - http://www.scopus.com/inward/record.url?scp=85067486583&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85067486583&partnerID=8YFLogxK

M3 - Article

VL - 19

SP - 214

EP - 221

JO - Quantum Information and Computation

JF - Quantum Information and Computation

SN - 1533-7146

IS - 3-4

ER -