Abstract
The fundamental limitations of any form of computation can be expressed in terms of the resource requirements of standard computational tasks under it. Within traditional models of computation, such as the Turing machine model, many problems are found to be intractable due to the limited computational capabilities of classical physical systems. However, quantum systems allow the range of tractable computations to be extended beyond that achievable by classical computation because the superposition principle offers a radically different sort of computational parallelism. The quantum circuit model (or gate array model), in which networks composed of quantum logic gates act on sets of qubits, is the dominant model of quantum computation and has an equivalent (quantum) Turing machine model. Both of these models and the general principles of quantum computation are discussed in this chapter. A number of specific algorithms, which illustrate the novel character of quantum computation, are described in the following chapter.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2007). Classical and quantum computing. In: Quantum Information. Springer, New York, NY. https://doi.org/10.1007/978-0-387-36944-0_13
Download citation
DOI: https://doi.org/10.1007/978-0-387-36944-0_13
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-35725-6
Online ISBN: 978-0-387-36944-0
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)