Skip to main content
Log in

Prediction problem in quantum mechanics is intractable (NP-Hard)

  • Published:
International Journal of Theoretical Physics Aims and scope Submit manuscript

Abstract

It is proved that both the prediction problem and the problem of reconstructing the state from the observations in quantum mechanics are NP-hard.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Garey, M., and Johnson, D. (1979).Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York.

    Google Scholar 

  • Kosheleva, O. M., and Kreinovich, V. Ya. (1989). Quantum prediction problem is intractable, Center for New Informational Technology “Informatika”, Leningrad, Technical Report.

    Google Scholar 

  • Von Neumann, J. (1955).Mathematical Foundations of Quantum Mechanics, Princeton University Press, Princeton, New Jersey.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kreinovich, V., Vazquez, A. & Kosheleva, O. Prediction problem in quantum mechanics is intractable (NP-Hard). Int J Theor Phys 30, 113–122 (1991). https://doi.org/10.1007/BF00670707

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00670707

Keywords

Navigation