Abstract
Nowadays, quantum computation is considered as a perspective way to overcome the computational complexity barrier. Development of a quantum programming technology requires to build theoretical background of quantum computing similarly to the classical computability theory and the classical computational complexity theory. The challenge to develop such theoretical background was posed by Yu.I. Manin. An attempt to build a mathematically rigorous model for quantum information processing systems in compliance with the concept of Yu.I. Manin is presented in the chapter. The attempt carries out by identifying elementary constituents of quantum computational processes. They are called quantum actions and their properties are studied in the chapter. In particular, the equivalence criterion of quantum actions in terms of their generating operators has been found; the special class of quantum actions has been characterised in terms of generating operators too. This class is formed by quantum actions leading to the collapse of quantum states. Further in the chapter, the mathematical model of quantum information processing systems. It is defined as an ensemble of interacting quantum actions on the common memory. The term ”abstract quantum automata” is introduced to denote such model. At the end of the chapter models of some important quantum information processing systems are presented.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: Proc. 39th Ann. Symp. on Found. Comp. Sci., pp. 332–341. IEEE (1998)
Bouwmeester, D., Pan, J.-W., Mattle, K., Eible, M., Weinfurter, H., Zeilinger, A.: Experimental quantum teleportation. Nature 390, 575–579 (1997)
Boschi, D., Branca, S., De Martini, F., Hardy, L., Popescu, S.: Experimental Realization of Teleporting an Unknown Pure Quantum State via Dual Classical and Einstein–Podolsky–Rosen Channel. Phys. Rev. Lett. 80, 1121–1125 (1998)
Church, A.: An unsolvable problem of elementary number theory. Amer. J. Math. 58(2), 345–363 (1936)
Cook, S.: The Complexity of Theorem Proving Procedures. In: Proc. 3rd Ann. ACM Symp. on Theory of Computing, pp. 151–158. ACM, New York (1971)
Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. Lond., Series A 400(1818), 97–117 (1985)
Deutsch, D., Jozsa, R.: Rapid Solution of Problems by Quantum Computation. Proc. Roy. Soc. Lond., Series A 439(1907), 553–558 (1992)
Dirac, P.A.M.: The Principles of Quantum Mechanics, 4th edn. Oxford University Press (1958)
Feynman, R.P.: Simulating Physics with Computer. Int. J. Theor. Phys. 21, 467–488 (1982)
Holevo, A.S.: Probabilistic and Statistical Aspects of Quantum Theory. North-Holland Publishing Company, Amsterdam (1982)
Karp, R.M.: Complexity of Computation. SIAM-AMS Proceedings, vol. 7. AMS, Providence (1974)
Manin, Y.I.: Computable and Uncomputable (Cybernetics), Sovetskoe radio, Moscow (1980) (in Russian)
Manin, Y.I.: Mathematics as metaphor: selected essays of Yuri I. Manin. AMS (2007)
Milner, R.: Communicating and Mobile System: the π-Calculus. Cambridge University Press, Cambridge (1999)
Moore, C., Crutchfield, J.P.: Quantum automata and quantum grammars. Theoret. Comput. Sci. 237, 99–136 (2000)
Neumann von, J.: Mathematische Grundlagen Der Quantenmechanik. Verlag von Julius Springer, Berlin (1932)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. 10th Anniversary Edition. Cambridge University Press, Cambridge (2010)
OMG Unified Modelling Language (OMG UML), Superstructure. OMG, v 2.4.1 (2011), http://www.omg.org/spec/UML/2.4.1/Superstructure/PDF
Post, E.L.: Finite Combinatory Processes – Formulation 1. J. Symb. Logics. 1(3), 103–105 (1936)
Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 2(42), 230–265 (1936)
Turing, A.M.: Computability and λ-Definability. J. Symb. Logics. 2(4), 153–163 (1937)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alobaidi, M., Batyiv, A., Zholtkevych, G. (2013). Abstract Quantum Automata as Formal Models of Quantum Information Processing Systems. In: Ermolayev, V., Mayr, H.C., Nikitchenko, M., Spivakovsky, A., Zholtkevych, G. (eds) ICT in Education, Research, and Industrial Applications. ICTERI 2012. Communications in Computer and Information Science, vol 347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35737-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-35737-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35736-7
Online ISBN: 978-3-642-35737-4
eBook Packages: Computer ScienceComputer Science (R0)