Quantum computation: Difference between revisions
Jump to navigation
Jump to search
imported>Charles Blackham mNo edit summary |
imported>Charles Blackham m (wiki link edit due to page moving) |
||
| Line 5: | Line 5: | ||
==Quantum computers & information theory== | ==Quantum computers & information theory== | ||
The quantum mechanical analogue of the [[Bit|classical bit]] is the qubit. A qubit is an actual physical system, all of whose [[Observable (quantum | The quantum mechanical analogue of the [[Bit|classical bit]] is the qubit. A qubit is an actual physical system, all of whose [[Observable (quantum computation)|observables]] are Boolean. | ||
==Interference & a simple computation== | ==Interference & a simple computation== | ||
Revision as of 16:04, 4 June 2007
Throughout this article The Many Worlds Interpretation(MWI) of quantum mechanics is used.
Differences with classical computation
In classical computation there is the concept of a discrete bit, taking only one of two values. However , the world which classical physics describes is that of continua. Thus this is obviously not an ideal way of attempting to describe or simulate the world in which we live. Feynman was the first to consider the idea of a quantum computer being necessary to simulate the quantum mechanical world in which we live.[1]
Quantum computers & information theory
The quantum mechanical analogue of the classical bit is the qubit. A qubit is an actual physical system, all of whose observables are Boolean.
Interference & a simple computation
Quantum Algorithms
Oracles
Deutsch algorithm
Grover algorithm
Shor algorithm
References
Based on a talk given by Charles Blackham to 6P at Winchester College, UK on 7/3/07
- Lectures on Quantum Computation by David Deutsch
- Cambridge Centre for Quantum Computation
- ↑ R.P. Feynman International Journal of Theoretical Physics 21(6/7) 1982