Abstract
In connection to computational complexity, it could be stated that the theory of quantum computation was launched in the beginning of the 1980s. A most famous physicist, Nobel Prize winner Richard P. Feynman, proposed in his article [38] which appeared in 1982 that a quantum physical system of R particles cannot be simulated by an ordinary computer without an exponential slowdown in the efficiency of the simulation. However, a system of R particles in classical physics can be simulated well with only a polynomial slowdown. The main reason for this is that the description size of a particle system is linear in R in classical physics,1 but exponential in R according to quantum physics (In Section 1.4 we will learn about the quantum physics description). Feynman himself expressed:
But the full description of quantum mechanics for a large system with R particles is given by a function,ψ(x 1, x 2,..., x R , t) which we call the amplitude to find the particles x 1,..., x R , and therefore, because it has too many variables, it cannot be simulated with a normal computer with a number of elements proportional to R or proportional to N. [38]
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
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hirvensalo, M. (2004). Introduction. In: Quantum Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-09636-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-09636-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07383-0
Online ISBN: 978-3-662-09636-9
eBook Packages: Springer Book Archive