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

Tomoyuki Morimae, Takeshi Koshiba

研究成果: Article査読

8 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)214-221
ページ数8
ジャーナルQuantum Information and Computation
19
3-4
出版ステータスPublished - 2019 3月

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 統計物理学および非線形物理学
  • 核物理学および高エネルギー物理学
  • 数理物理学
  • 物理学および天文学(全般)
  • 計算理論と計算数学

フィンガープリント

「Impossibility of perfectly-secure one-round delegated quantum computing for classical client」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル