Abstract
We present a classical probabilistic simulation technique of quantum Turing machines. As a corollary of this technique we obtain several results on relationship among classical and quantum complexity classes such as: PrQP=PP, BQP ⊆ PP and PrQSPACE(S(n))=PrPSPACE(S(n)).
Supported by the Russia Fund for Basic Research under the grant 03-01-00769
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adleman, L., Demarrais, J., Huang, M.: Quantum computability. SIAM J. on Computing 26(5), 1524–1540 (1997)
Balcázar, J., Díaz, J., Gabarró, J.: Structural Complexity I. An EATCS series. Springer, Heidelberg (1995)
Bernstein, E., Vazirany, U.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411–1473 (1997)
Bukharaev, R.: The Foundation of Theory of Probabilistic Automata. Moscow, Nauka (1985) (in Russian)
Gruska, J.: Quantum computing. The McGraw-Hill Publishing Company, New York (1999)
Fortnow, L.: One complexity theorist’s view of quantum computing. Theoretical Computer Science 292(3), 597–610 (2003)
Moore, C., Crutchfield, J.: Quantum Automata and Quantum Grammars. Theoretical Computer Science 237, 275–306 (2000)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Simon, D.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474–1483 (1997)
Watrous, J.: Space-bounded quantum complexity. Journal of Computer and System Sciences 59(2), 281–326 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ablayev, F., Gainutdinova, A. (2003). Classical Simulation Complexity of Quantum Machines. In: Lingas, A., Nilsson, B.J. (eds) Fundamentals of Computation Theory. FCT 2003. Lecture Notes in Computer Science, vol 2751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45077-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-45077-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40543-6
Online ISBN: 978-3-540-45077-1
eBook Packages: Springer Book Archive