2012 Fiscal Year Final Research Report
Study on Discrete Adiabatic Quantum Computation in NPcomplete problem
| Project/Area Number |
22500017
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kagoshima University |
|---|
Principal Investigator |
NAKAYAMA Shigeru 鹿児島大学, 大学院・理工学研究科, 教授 (00112714)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Keywords | 量子情報工学 / 断熱量子計算 / NP完全問題 / 量子コンピュータ / ドイチ問題 / 充足可能性問題 / 隠れ部分郡問題 |
|---|
| Research Abstract |
In this report, adiabatic quantum computation has been proposed as a quantum algorithm with adiabatic evolution to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem as NP complete problem, and Deutsch problem, Deutsch-Jozsa problem, Bernstein-Vazirani problem, Simon problem as hidden subgroup problem. We modify the adiabatic quantum computation with nonlinear step parameter instead of linear step parameter, and propose to solve these problems more efficiently by a method with higher observation probability.
|
