2006 Fiscal Year Final Research Report Summary
Quantum-Inspired Reconfigurable Processor
| Project/Area Number |
16360167
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Electron device/Electronic equipment
|
|---|
| Research Institution | The University of Tokyo |
|---|
Principal Investigator |
FUJISHIMA Minoru The Univesity of Tokyo, Graduate School of Frontier Sciences, Professor, 大学院新領域創成科学研究科, 助教授 (60251352)
|
|---|
| Project Period (FY) |
2004 – 2006
|
| Keywords | parallel processor / quantum computer / quantum algorithm / emulator / FPGA / DIMD |
|---|
| Research Abstract |
A quantum computer is expected to solve the NP problem, such as factorization, at high speed, since it can verify all the solution candidates simultaneously. However, the final system of the quantum computer is still unclear. It is noted that not only hardware but also software with algorithm and benchmark tests is indispensable to realize practical operation. Hence, a quantum-computing emulator is necessary to inspect the algorithm. However, emulation of large-scale quantum algorithm is difficult, since quantum superposition is utilized in the quantum computer and 2^N memories are necessary to emulate N qubits. By replacing some qubits with classic bits and using quantum-macro operations, we have proposed a new quantum-computing emulator. In this emulator, by focusing on only a core calculation part, we have assigned classical bits for some calculation process and using unitary-macro operations for frequent quantum operations. As a result, we have succeeded to reduce memory usage. In implementation, we have fabricated a DIMD (dual-instruction multiple-data) processor with 192 parallel PE on FPGA with 40MHz clock and an operation converter which is a C-language software controlling processing and the unitary-macro operations. In this quantum-computing emulator, we have made an experiment on the factorization with a 64 bits integer by using Shor's algorithm, which is well-known algorithm for the quantum computer. Although this calculation is equivalent to computational complexity to use 320 qubit for on the quantum computer, as a result of experiment, 1,300 seconds are used for computation and only 40k-bit memory is required for this emulation
|
