WEKO3
アイテム
Trusted centerによる量子計算の古典検証
https://ipsj.ixsq.nii.ac.jp/records/207294
https://ipsj.ixsq.nii.ac.jp/records/207294f6a4f676-aa8e-4e00-97cc-796daf49ee6c
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-QS20001008.pdf (677.7 kB)
|
Copyright (c) 2020 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | SIG Technical Reports(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2020-10-09 | |||||||||
| タイトル | ||||||||||
| タイトル | Trusted centerによる量子計算の古典検証 | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Classical verification of quantum computing with trusted center | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||||
| 資源タイプ | technical report | |||||||||
| 著者所属 | ||||||||||
| 京都大学基礎物理学研究所 | ||||||||||
| 著者所属 | ||||||||||
| NTTコミュニケーション科学基礎研究所 | ||||||||||
| 著者名 |
森前, 智行
× 森前, 智行
× 竹内, 勇貴
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | The classical channel remote state preparation (ccRSP) is an important two-party primitive in quantum cryptography. Alice (classical polynomial-time) and Bob (quantum polynomial-time) exchange polynomial rounds of classical messages, and Bob finally gets random single-qubit states while Alice finally gets classical descriptions of the states. In [T. Morimae, arXiv:2003.10712], an information-theoretically-sound non-interactive protocol for the verification of quantum computing was proposed. The verifier of the protocol is classical, but the trusted center is assumed that sends random single-qubit states to the prover and their classical descriptions to the verifier. If the trusted center can be replaced with a ccRSP protocol while keeping the information-theoretical soundness, an information-theoretically-sound classical verification of quantum computing is possible, which solves the long-standing open problem. In this paper, we show that it is not the case unless BQP is contained in MA. We also consider a general verification protocol where the verifier or the trusted center first sends quantum states to the prover, and then the prover and the verifier exchange a constant round of classical messages. We show that the first quantum message transmission cannot be replaced with a ccRSP protocol while keeping the information-theoretical soundness unless BQP is contained in AM. Furthermore, we also study the verification with the computational soundness. We show that if a ccRSP protocol satisfies a certain condition even against any quantum polynomial-time malicious prover, the replacement of the trusted center with the ccRSP protocol realizes a computationally-sound classical verification of quantum computing. The condition is weaker than the verifiability of the ccRSP. At this moment, however, there is no known ccRSP protocol that satisfies the condition. If a simple construction of such a ccRSP protocol is found, the combination of it with the trusted center verification model provides another simpler and modular proof of the Mahadev's result. We finally show that the trusted center model and its variant with the ccRSP have extractors for low-energy states. For details, see [T. Morimae and Y. Takeuchi, arXiv:2008.05033] | |||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | The classical channel remote state preparation (ccRSP) is an important two-party primitive in quantum cryptography. Alice (classical polynomial-time) and Bob (quantum polynomial-time) exchange polynomial rounds of classical messages, and Bob finally gets random single-qubit states while Alice finally gets classical descriptions of the states. In [T. Morimae, arXiv:2003.10712], an information-theoretically-sound non-interactive protocol for the verification of quantum computing was proposed. The verifier of the protocol is classical, but the trusted center is assumed that sends random single-qubit states to the prover and their classical descriptions to the verifier. If the trusted center can be replaced with a ccRSP protocol while keeping the information-theoretical soundness, an information-theoretically-sound classical verification of quantum computing is possible, which solves the long-standing open problem. In this paper, we show that it is not the case unless BQP is contained in MA. We also consider a general verification protocol where the verifier or the trusted center first sends quantum states to the prover, and then the prover and the verifier exchange a constant round of classical messages. We show that the first quantum message transmission cannot be replaced with a ccRSP protocol while keeping the information-theoretical soundness unless BQP is contained in AM. Furthermore, we also study the verification with the computational soundness. We show that if a ccRSP protocol satisfies a certain condition even against any quantum polynomial-time malicious prover, the replacement of the trusted center with the ccRSP protocol realizes a computationally-sound classical verification of quantum computing. The condition is weaker than the verifiability of the ccRSP. At this moment, however, there is no known ccRSP protocol that satisfies the condition. If a simple construction of such a ccRSP protocol is found, the combination of it with the trusted center verification model provides another simpler and modular proof of the Mahadev's result. We finally show that the trusted center model and its variant with the ccRSP have extractors for low-energy states. For details, see [T. Morimae and Y. Takeuchi, arXiv:2008.05033] | |||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AA12894105 | |||||||||
| 書誌情報 |
研究報告量子ソフトウェア（QS） 巻 2020-QS-1, 号 8, p. 1-6, 発行日 2020-10-09 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 2435-6492 | |||||||||
| Notice | ||||||||||
| SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||||
| 出版者 | ||||||||||
| 言語 | ja | |||||||||
| 出版者 | 情報処理学会 | |||||||||
