Book contents
- Frontmatter
- Contents
- Introduction
- Part I Quantum information
- Part II Quantum computation
- 7 Principles of quantum computing
- 8 Elementary quantum algorithms
- 9 More advanced quantum algorithms
- 10 Trapped atoms and ions
- 11 Nuclear magnetic resonance
- 12 Large-scale quantum computers
- Part III Quantum communication
- Appendix: Quantum mechanics
- References
- Index
8 - Elementary quantum algorithms
from Part II - Quantum computation
Published online by Cambridge University Press: 05 August 2012
- Frontmatter
- Contents
- Introduction
- Part I Quantum information
- Part II Quantum computation
- 7 Principles of quantum computing
- 8 Elementary quantum algorithms
- 9 More advanced quantum algorithms
- 10 Trapped atoms and ions
- 11 Nuclear magnetic resonance
- 12 Large-scale quantum computers
- Part III Quantum communication
- Appendix: Quantum mechanics
- References
- Index
Summary
Although the basic ideas of quantum computation are fairly straightforward, the detailed manipulations required to extract a useful result from an entangled superposition of answers can be rather complicated. There are, however, a small number of algorithms which are simple enough to explain using only elementary methods. The best example is Deutsch's algorithm: as this only requires two qubits its properties are amenable to brute-force matrix calculations, and these calculations can be simplified using a variety of short cuts, which also give some insight into how and why the algorithm works. We will also explore the simplest case of Grover's quantum search algorithm, which is once again simple enough to be tacked by brute force. Finally we will look briefly at two methods used to stabilize quantum computers against errors.
Deutsch's algorithm
The invention of Deutsch's algorithm can be taken as defining the start of modern quantum computation, and it remains a key example, exhibiting many of the key properties of quantum algorithms in a particularly simple form. (Note, however, that the version of Deutsch's algorithm described here is not in fact the original but a later modification which is both more powerful and easier to understand.)
Consider a binary function f from one bit to one bit, that is a function which takes in either 0 or 1 as its input and returns either 0 or 1 as its output. There are four such functions which may be conveniently labeled by their outputs as shown in Table 8.1.
- Type
- Chapter
- Information
- Quantum Information, Computation and Communication , pp. 73 - 84Publisher: Cambridge University PressPrint publication year: 2012