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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Barenco, A. Ekert, K. Suominen, and P. Torma. Approximate quantum fourier transform and decoherence, 1996.
R. Cleve and J. Watrous. Fast parallel circuits for the quantum fourier transform. In IEEE Symposium on Foundations of Computer Science, pages 526–536, 2000.
David Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A, 400:97–117, 1985.
David Deutsch. Quantum computational networks. Proceedings of the Royal Society of London A, 425:73–90, 1989.
Lov K. Grover. A fast quantum mechanical algorithm for database search. In ACM Symposium on Theory of Computing, pages 212–219, 1996.
Hao Guo, Gui Lu Long, and Yang Sun Li. Effects of imperfect gate operations in shor’s prime factorization algorithm. Chinese Chemical Society, 48(3):449–454, 2001.
Gui Lu Long, Yan Song Li, Wei Lin Zhang, and Chang Cun Tu. Dominant gate imperfection in grover’s quantum search algorithm. Physical Review A, 61(4):042305, 2000.
Cesar Miquel, Juan Pablo Paz, and Roberto Perazzo. Factoring in a dissipative quantum computer. Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9601021, 1996.
K. Obenland and A. Despain. A parallel quantum computer simulator. In High Performance Computing, 1998.
Kevin Mark Obenland. Using Simulation To Access The Feasibility Of Quantum Computing. PhD thesis, University of Southern California, 1998.
Bernhard Ömer. Quantum programming in qcl. Master’s thesis, Institute of Information Systems Technical University of Vienn na, January 2000.
Yan Protzker, Jonathan Blow, and Joe Nelson. OpenQubit 0.2.0 http://www.ennui.net/~quantum/, December 1998.
QDD ver.0.2, http://home.plutonium.net/~dagreve/qdd.html, March 1999.
Peter W. Shor. Algorithms for quantum computation: Discrete logarithms and factori ng. In IEEE Symposium on Foundations of Computer Science, pages 124–134, 1994.
Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete log arithms on a quantum computer. SIAM Journal on Computing, 26(5):1484–1509, 1997.
Vlatko Vedral, Adriano Barenco, and Artur K. Ekert. Quantum networks for elementary arithmetic operations. Physical Review A, 54(1):147–153, 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niwa, J., Matsumoto, K., Imai, H. (2002). General-Purpose Parallel Simulator for Quantum Computing. In: Unconventional Models of Computation. UMC 2002. Lecture Notes in Computer Science, vol 2509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45833-6_20
Download citation
DOI: https://doi.org/10.1007/3-540-45833-6_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44311-7
Online ISBN: 978-3-540-45833-3
eBook Packages: Springer Book Archive