Research ArticleOpen AccessGoogle Scholar indexed
Formalized Operators with Phase Encoding
School of Computing, Varna University of Management, Varna, Bulgaria
- 1 School of Computing, Varna University of Management, Varna, Bulgaria
Journal of Quantum Information Science·Volume 05 (2015)·Pages 114–126·Published 2 September 2015·DOI10.4236/jqis.2015.53014
Copy link · social · email
Abstract
In this article the concept of phase encoding/decoding is used to analyze and formalize a simple quantum algorithm—the Deutsch’s algorithm. The algorithm is formalized in two different ways through an analysis, based on phase encoding/decoding, carried out by the formalized elementary operators developed by the author of this article. Concrete examples of different possible realizations of the formalized with Raychev’s operators Deutsch’s algorithms are offered.
KeywordsQuantum OperatorsRotationsPhasespaceQuantum Circuit
- Shor, P. (1997) Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing, 26, 1484-1509. http://dx.doi.org/10.1137/S0097539795293172
- Childs, A.M., Landahl, A.J. and Parrilo, P.A. (2007) Quantum Algorithm for Ordered Search Problem via Semidenite Programming. Physical Review A, 75, Article ID: 032335. http://dx.doi.org/10.1103/PhysRevA.75.032335
- Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A. and Preda, D. (2001) A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem. Science, 292, 472-475. http://dx.doi.org/10.1126/science.1057726
- Harrow, A.W., Hassidim, A. and Lloyd, S. (2009) Quantum Algorithm for Linear Systems of Equations. Phys. Rev. Lett., 103, 150502. http://dx.doi.org/10.1103/PhysRevLett.103.150502
- Bacon, D. and van Dam, W. (2010) Recent Progress in Quantum Algorithms. Commun. ACM, 53, 84-93.
- Toffoli, T. (1980) Reversible Computing. In: Proceedings of the 7th Colloquium on Automata, Languages and Programming, Springer-Verlag, London, 632-644. http://dx.doi.org/10.1007/3-540-10003-2_104
- Bennett, C.H. (1989) Time/Space Trade-Offs for Reversible Computation. SIAM Journal on Computing, 18, 766-776. http://dx.doi.org/10.1137/0218053
- Deutsch, D. (1989) Quantum Computational Networks. Proceedings of the Royal Society of London A, 425, 73-90. http://dx.doi.org/10.1098/rspa.1989.0099
- Barenco, A. (1995) A Universal Two-Bit Gate for Quantum Computation. Proceedings ofthe Royal Society of London A, 449, 679-683.
- Deutsch, D., Barenco, A. and Ekert, A. (1995) Universality in Quantum Computation. Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 449, 669-677. http://dx.doi.org/10.1098/rspa.1995.0065
- Di Vincenzo, D.P. (1995) Two-Bit Gates Are Universal for Quantum Computation. Physical Review A, 51, 1015-1022. http://dx.doi.org/10.1103/PhysRevA.51.1015
- Lloyd, S. (1995) Almost Any Quantum Logic Gate Is Universal. Physical Review Letters, 75, 346-349. http://dx.doi.org/10.1103/physrevlett.75.346
- Nielsen, M. and Chuang, I. (2003) Quantum Computing and Quantum Information. Cambridge University Press, Cambridge.
- Phillip Kaye, R.L. and Mosca, M. (2007) An Introduction to Quantum Computing. Oxford University Press, Oxford.