Abstract
Classical computer science relies on the concept of Turing machines as a unifying model of universal computation. According to the modern Church-Turing Thesis, this concept is interpreted in the form that every physically reasonable model of computation can be efficiently simulated on a probabilistic Turing machine. Recently this understanding, which was taken for granted for a long time, has required a severe reorientation because of the emergence of new computers that do not rely on classical physics but, rather, use effects predicted by quantum mechanics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Beth, T., Rötteler, M. (2001). Quantum Algorithms: Applicable Algebra and Quantum Physics. In: Quantum Information. Springer Tracts in Modern Physics, vol 173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44678-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-44678-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41666-1
Online ISBN: 978-3-540-44678-1
eBook Packages: Springer Book Archive