| Project/Area Number |
22700014
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Nagoya University (2012-2013)
Osaka Prefecture University (2010-2011) |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2010-04-01 – 2014-03-31
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2010: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Keywords | 量子通信通信量 / ネットワーク符号 / 質問計算量 / 対話型証明 / 量子計算理論 / 通信計算量 / 量子通信 |
|---|
| Research Abstract |
Quantum communication complexity is one of main topics on quantum complexity theory, and its aim is to measure the amounts of quantum communication among multiple parties for computing some function. In this research, we have studied the applications of quantum communication complexity to quantum network coding, quantum query complexity, and quantum interactive proofs. The possibilities and limits of these computing/communication models have been investigated based on how much communication is needed. In particular, we have succeeded in constructing general quantum network coding protocols and improving some parameters of quantum interactive proofs.
|
