Skip to main content
SpringerLink
Log in

Classical Simulation Complexity of Quantum Machines

  • Conference paper
Fundamentals of Computation Theory (FCT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2751))

Included in the following conference series:

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L., Demarrais, J., Huang, M.: Quantum computability. SIAM J. on Computing 26(5), 1524–1540 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Balcázar, J., Díaz, J., Gabarró, J.: Structural Complexity I. An EATCS series. Springer, Heidelberg (1995)

    Google Scholar 

  3. Bernstein, E., Vazirany, U.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411–1473 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bukharaev, R.: The Foundation of Theory of Probabilistic Automata. Moscow, Nauka (1985) (in Russian)

    Google Scholar 

  5. Gruska, J.: Quantum computing. The McGraw-Hill Publishing Company, New York (1999)

    Google Scholar 

  6. Fortnow, L.: One complexity theorist’s view of quantum computing. Theoretical Computer Science 292(3), 597–610 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Moore, C., Crutchfield, J.: Quantum Automata and Quantum Grammars. Theoretical Computer Science 237, 275–306 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  9. Simon, D.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474–1483 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  10. Watrous, J.: Space-bounded quantum complexity. Journal of Computer and System Sciences 59(2), 281–326 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Theoretical Cybernetics, Kazan State University, 420008, Kazan, Russia

    Farid Ablayev & Aida Gainutdinova

Authors
  1. Farid Ablayev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aida Gainutdinova
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Lund University, 22100, Lund, Sweden

    Andrzej Lingas

  2. School of Technology and Society, Malmö University, SE-205 06, Malmö, Sweden

    Bengt J. Nilsson

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation