Complexity theoretic analysis of quantum verification systems
Project/Area Number |
25330012
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Theory of informatics
|
Research Institution | Nagoya University |
Principal Investigator |
|
Project Period (FY) |
2013-04-01 – 2016-03-31
|
Project Status |
Completed (Fiscal Year 2016)
|
Budget Amount *help |
¥4,810,000 (Direct Cost: ¥3,700,000、Indirect Cost: ¥1,110,000)
Fiscal Year 2016: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2013: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
Keywords | 量子コンピュータ / 対話型証明 / NP / 量子計算量理論 / 量子NP / 対話型証明系 |
Outline of Final Research Achievements |
The quantum verification system is the communication system between two parties called a prover, which has strong computational power, and a verifier, which can do polynomial-time quantum computation. The aim of the system is to make the verifier verify whether any input of a decision problem is YES. In this research, we have studied the computational power and the limit of quantum verification systems from the view of computational complexity. In particular, we have investigated the non-interactive quantum verification system called QMA and the one-round quantum interactive proof system, and have given several simplifications of their systems and clarified their basic properties.
|
Report
(4 results)
Research Products
(27 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Generalized Quantum Arthur-Merlin Games2015
Author(s)
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura
Organizer
30th Conference on Computational Complexity (CCC2015)
Place of Presentation
Oregon Convention Center, Portland, Oregon (USA)
Year and Date
2015-06-17
Related Report
Int'l Joint Research
-
-
-
-
-
-
-
-
-
-
-
-
-