Abstract
To begin to describe quantum algorithms, we need an understanding of the physical phenomena that motivate quantum mechanics, a simple mathematical model of a potential quantum storage device and the notation to describe and manipulate such a model. In this chapter we present the context in which we will work, motivate the need for quantum mechanics and provide a quick introduction to the essential mathematical tools and notation to be used throughout the book. As part of the price of brevity, we will work with a static model of quantum mechanics and will defer additional mathematical definitions until they are needed. The reader who is already familiar with this material can easily skip to Chapter 2, giving only a cursory glance at Chapter 1 to identify any idiosyncratic notation.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Pittenger, A.O. (2001). Quantum Statics. In: An Introduction to Quantum Computing Algorithms. Progress in Computer Science and Applied Logic, vol 19. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-1390-1_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1390-1_1
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-7127-7
Online ISBN: 978-1-4612-1390-1
eBook Packages: Springer Book Archive