A quantum computer only needs one universe
โ Scribed by A.M Steane
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 118 KB
- Volume
- 34
- Category
- Article
- ISSN
- 1355-2198
No coin nor oath required. For personal study only.
โฆ Synopsis
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum computers to ''perform many computations simultaneously'' except in a highly qualified and to some extent misleading sense. Quantum computation is therefore not well described by interpretations of quantum mechanics which invoke the concept of vast numbers of parallel universes. Rather, entanglement makes available types of computation processes which, while not exponentially larger than classical ones, are unavailable to classical systems. The essence of quantum computation is that it uses entanglement to generate and manipulate a physical representation of the correlations between logical entities, without the need to completely represent the logical entities themselves.
๐ SIMILAR VOLUMES
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schr6dinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quant