| Project/Area Number |
11440028
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Tohoku University (2001)
Nagoya University (1999-2000) |
|---|
Principal Investigator |
OZAWA Masanao Tohoku University, Graduate School of Information Sciences, Professor, 大学院・情報科学研究科, 教授 (40126313)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
IHARA Shunsuke Nagoya University, School of Informatics, Professor, 情報文化学部, 教授 (00023200)
TSUKAJI Tasuie Nagoya University, Graduate School of Human Informatics, Research Associate, 大学院・人間情報学研究科, 助手 (70291961)
YASUMOTO Masahiro Nagoya University, Graduate School of Human Informatics, Professor, 大学院・人間情報学研究科, 教授 (10144114)
MATSUBARA Yo Nagoya University, Graduate School of Human Informatics, Associate Professor, 大学院・人間情報学研究科, 助教授 (30242788)
MATSUMOTO Hiroyuki Nagoya University, Graduate School of Human Informatics, Professor, 大学院・人間情報学研究科, 教授 (00190538)
|
|---|
| Project Period (FY) |
1999 – 2001
|
| Project Status |
Completed (Fiscal Year 2001)
|
| Budget Amount *help |
¥10,500,000 (Direct Cost: ¥10,500,000)
Fiscal Year 2001: ¥3,300,000 (Direct Cost: ¥3,300,000)
Fiscal Year 2000: ¥3,300,000 (Direct Cost: ¥3,300,000)
Fiscal Year 1999: ¥3,900,000 (Direct Cost: ¥3,900,000)
|
|---|
| Keywords | quantum computing / quantum Turing machines / quantum circuits / quantum complexity theory / quantum gates / quantum operation / fault-tolerant quantum computing / controlled NOT gate / 加法的保存量 / 誤り訂正理論 / 万能量子論理素子 / 制御否定素子 / 計算基底 / 閾値定理 / 量子オラクルTuring機械 / 量子アルゴリズム / 量子コンピュータ / 完全正写像 / 量子測定 / 量子回路族 / 量子チューリング機械 / 量子計算量 / 量子力学 / 量子情報 |
|---|
| Research Abstract |
The following results have been obtained on mathematical foundations on quantum Turing machine and quantumcircuits: (1) Local transition functions of quantum Turing machines (QTM) are generally characterized including multitape cases. (2) The notion of uniform quantum circuit families (UQCF) was introduced for the first time and developed their complexity theory nd proved the computational equivalence between QTMs and UQCF in Monte Caro type computations. (3) In order to solve the halting problem for QTMs, it has been proved that under a refined halting protocol measurements of halting flag do not disturb the probability distribution of the output of computations.
The following results have been obtained on physical implementations of quantum logicgates: (1) Conservation laws limit theaccuracy of physical implementations of elementary quantum logic gates. (2) Although the SWAP gate has no conflict with the conservation law, the controlled-NOT gate, which is one of the universal quantum
… More
logic gates, cannot be implemented by any 2-qubit rotationally invariant unitary operation within error probability 1/16.. (3) If the computational basis is represented by a component of spin and physical implementations obey the angular momentum conservation law, any physically realizable quantum logicgates with n qubit ancilla cannot implement the controlled-NOT gate within the error probability 1/(4n^2). (4) An analogous relation holds for bosonic ancillae with the size defined through the average number of photons. Any set of universal gates inevitably obeys a related limitation with error probability O(n^<-2>). (5) The current theory demands the threshold error probability 10^5 10^6 for each quantum gate. Thus, a single controlled-NOT gate would not be in reality a unitary operation on a 2-qubitsystem but would be a unitary operation on a system with at least 100 qubits. (6) The present investigation suggests that the current choice of the computational basis should be modified so that the computational basis commutes with the conserved quantity. Less
|
