Abstract
A general quantum simulation language on a classical computer provides the opportunity to compare an experiential result from the development of quantum computers with mathematical theory. The intention of this research is to develop a program language that is able to make simulations of all quantum algorithms in same framework. This study examines the simulation of quantum algorithms on a classical computer with a symbolic programming language. We use the language Mathematica to make simulations of well-known quantum algorithms. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. This gives us an uncomplicated and clear language for the implementations of algorithms. The computational language includes essential formulations such as quantum state, superposition and quantum operator. This symbolic programming language provides a universal framework for examining the existing as well as future quantum algorithms. This study contributes with an implementation of a quantum algorithm in a program code where the substance is applicable in other simulations of quantum algorithms.
Similar content being viewed by others
References
D. Deutsch and R. Jozsa, “Rapid Solution of Problems by Quantum Computation,” Proc. R. Soc. London, Ser. A 439, 553–558 (1992).
P. A. M. Dirac, The Principles of Quantum Mechanics (Oxford Univ., Oxford, 1958).
L. K. Grover, “Quantum Computers Can Search Arbitrarily Large Databases by a Single Query,” Phys. Rev. Lett. 79, 4709–4712 (1997).
E. Merzbacher, Quantum Mechanics (Wiley, New York, 1998).
M. Hirvensalo, Quantum Computing, Springer Ser. on Natural Comput. (Springer, Berlin, 2001).
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge Univ., Cambridge, 2000).
P. Nyman, “Simulation of Deutsch-Jozsa Algorithm in Mathematica,” AIP Conf. Proc. 962, 312 (2007).
P. Nyman, “Quantum Computing-Declarative Computational Methods for Simulation of Quantum Algorithms and Quantum Errors,” Master’s Thesis (Växjö Univ., Sweden, 2005).
P. Nyman, “Simulation of Quantum Algorithms with a Symbolic Programming Language,” e-prints, No. 705 (May 2007).
P. W. Shor, “Polynomial-time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,” SIAM J. Comput. 26, 1484 (1997).
D. R. Simon, “On the Power of Quantum Computation,” in Proc. of the 35th Ann. Symp. on Foundations of Computer Science (Inst. Electric. Electron. Eng. Comp. Soc., Los Alamitos, CA, 1994), pp. 116–123.
D. R. Simon, “On the Power of Quantum Computation,” SIAM J. Comput. 26, 1474 (1997).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Text © Astro, Ltd., 2009.
The article is published in the original.
Rights and permissions
About this article
Cite this article
Nyman, P. A compact program code for simulations of quantum algorithms in classical computers. Laser Phys. 19, 357–361 (2009). https://doi.org/10.1134/S1054660X09020303
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1054660X09020303