PROBABILISTIC QUANTUM COMPUTER SIMULATOR

Mahmood Humadi, Yusra

doi:10.37652/juaps.2008.15527

	PROBABILISTIC QUANTUM COMPUTER SIMULATOR
Journal of University of Anbar for Pure Science
Article 14, Volume 2, Issue 1, 2008, Pages 139-144 PDF (385.96 K)
Document Type: Research Paper
DOI: 10.37652/juaps.2008.15527
Author
Yusra Mahmood Humadi^*
College of Science, University of Anbar
Abstract
Quantum Computation is a new field in science. It relates to quantum physics and computer science. The concept of quantum computers regarded new theoretical stage due to the fact that working and real quantum computers not exist and in development stage at the moment. Quantum computers are completely different from the classical computers. Quantum computer building blocks are several quantum objects such as atoms, ions or photons, interpreting their states, or polarizations as ones, zeros, and superposition’s of ones and zeros. Each quantum bit or qubit can exist in a superposition of states with different probabilities of seeing a one or a zero when one observes the qubit. In this paper, a Probabilistic Quantum Computer Simulator (PQCS) was build to be used as interesting tools to study the various quantum algorithms that intended to be executed on the real quantum computer. The toolbox contains the basic Quantum Units such as NOR Gates, Quabit Toffoli Gate and Quabit Pauli Z that represented in Hilbert Space (HS). The designer of quantum algorithm uses the Drag and Drop facility to accomplish the overall design. The proposed system implemented in Visual Basic and has interactive Graphical User Interface (GUI) that offer flexible design tools for building quantum algorithms in various fields.
Keywords
Quantum computation; Quabit; Quabit Toffoli Gate; Quabit Pauli Z; Hilbert Space

References
A collection of papers on quantum computing – Stefano Bettelli http://arxiv.org/ (2002). Ethan Bernstein and Umesh Vazirani. ‘Quantum Complexity Theory’. SIAM Journal on Computing, 26(5):1411–1473, October 1997. L. Adleman, J, Demarrais, and M.D. Huang. ‘Quantum Computability’. SIAM Journal on Computing, 26(5):1524–1540, 1997. .W Shor, "Algorithms for quantum computation: Discrete Logarithms and Factoring" www.citeseer.ist.psu.edu/14533.html (1986). S. Aaronson. "Quantum Computing, Postselection, and Probabilistic Polynomial-Time". Proceedings of the Royal Society of London A, 461:3473– 3482, 2005.
Statistics Article View: 378 PDF Download: 194