Abstract
It is impossible to present quantum mechanics in few pages. Since the goal of this book is to describe quantum algorithms, we limit ourselves to the principles of quantum mechanics and describe them as “game rules.” Suppose you have played checkers for many years and know several strategies, but you really do not know chess. Suppose now that someone describes the chess rules. Soon you will be playing a new game. Certainly, you will not master many chess strategies, but you will be able to play. This chapter has a similar goal. The postulates of a theory are its game rules. If you break the rules, you will be out of the game.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The class NP-complete consists of the most difficult problems in the class NP (nondeterministic polynomial). The class NP is defined as the class of computational problems that have solutions whose correctness can be “quickly” verified.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Portugal, R. (2018). The Postulates of Quantum Mechanics. In: Quantum Walks and Search Algorithms. Quantum Science and Technology. Springer, Cham. https://doi.org/10.1007/978-3-319-97813-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-97813-0_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-97812-3
Online ISBN: 978-3-319-97813-0
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)