Quantum-Classical Correlation Games and New Analyses of Discrete-Continuous Optimization and Computational Complexity
| Project/Area Number |
20300002
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | The University of Tokyo |
|---|
Principal Investigator |
IMAI Hiroshi The University of Tokyo, 大学院・情報理工学系研究科, 教授 (80183010)
|
|---|
| Project Period (FY) |
2008 – 2010
|
| Project Status |
Completed (Fiscal Year 2010)
|
| Budget Amount *help |
¥18,980,000 (Direct Cost: ¥14,600,000、Indirect Cost: ¥4,380,000)
Fiscal Year 2010: ¥5,720,000 (Direct Cost: ¥4,400,000、Indirect Cost: ¥1,320,000)
Fiscal Year 2009: ¥6,110,000 (Direct Cost: ¥4,700,000、Indirect Cost: ¥1,410,000)
Fiscal Year 2008: ¥7,150,000 (Direct Cost: ¥5,500,000、Indirect Cost: ¥1,650,000)
|
|---|
| Keywords | 量子コンピュータ / 量子計算 / アルゴリズム / 量子情報 / 離散数学 / 量子エレクトロニクス / 計算機システム |
|---|
| Research Abstract |
Quantum Computing overcomes the barriers of current classical computers through computational power via quantum effects. This research focuses on quantum correlation as such effects. We analyze quantum correlation in a unified way as follows : (1) revealing discrete aspects of quantum correlation by the theory of cut polytopes in combinatorial optimization, (2) investigating maximum quantum violations by continuous optimization, and (3) analyzing quantum correlation by multi-prover interactive proof in computational complexity theory. Furthermore, problems in new quantum computational models and quantum information are explored through discrete and continuous geometric structures.
|
Report
(4 results)
Research Products
(36 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation]2008
Author(s)
今井浩
Organizer
組合せ最適化セミナー
Place of Presentation
京都大学数理解析研究所(招待講演)
Year and Date
2008-07-29
Related Report
-
