| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2019: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2018: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2017: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2016: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Outline of Final Research Achievements |
The quantum interactive proofs is a natural extension of the quantum NP systems (one-round verification system) where multiple rounds of interaction are allowed between a unlimitedly powerful party (prover) and a polynomial-time computable party (verifier). While the quantum interactive proof is one of main topics in quantum computational complexity, it still has many unexplored points and the computational power has been unknown. To investigate this model in a more fine grained way, we have studied the computational power and the limitation of quantum interactive proofs by restricting quantum communication and computation in several approaches. Moreover, we have shown the power of restricted quantum computation models such as DQC1 models by using the analysis of quantum interactive proofs that are obtained in this research.
|
