A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Fast parallel circuits for the quantum Fourier transform
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Parallel Quantum Computer Simulation on the CUDA Architecture
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Problems and prospects for quantum computational speed-up
ICCS'03 Proceedings of the 2003 international conference on Computational science
Hi-index | 0.00 |
With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. 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.