Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
General-Purpose Parallel Simulator for Quantum Computing
| |
|
General-Purpose Parallel Simulator for Quantum Computing
Jumpei Niwa4, Keiji Matsumoto5 and Hiroshi Imai4, 5
| (4) |
Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, Japan |
| (5) |
Quantum Computation and Information Project, ERATO, Japan Science and Technology Corporation, 5-28-3 Hongo, Bunkyo-ku, Tokyo, Japan |
Abstract
With current technologies, it seems to be very difficult to im- plement quantum computers with many qubits. It is therefore
of impor- tance to simulate quantum algorithms and circuits on the existing com- puters. However, for a large-size problem,
the simulation often requires more computational power than is available from sequential processing. Therefore, simulation
methods for parallel processors are required.
We have developed a general-purpose simulator for quantum algorithms/ circuits on the parallel computer (Sun Enterprise4500).
It can simulate algorithms/circuits with up-to 30 qubits. In order to test efficiency of our proposed methods, we have simulated Shor’s factorization algorithm and Grover’s database
search, and we have analyzed robustness of the corresponding quantum circuits in the presence of both decoherence and operational
errors. The corresponding results, statistics and analyses are presented in this paper.
Keywords quantum computer simulator - Shor’s factorization - Grover’s database search - parallel processing - decoherence and operational errors
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|