Quantum computation

From Citizendium
Revision as of 10:16, 19 April 2007 by imported>Charles Blackham (Beginning of section 1 (referenced & wiki-linked))
Jump to navigation Jump to search

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

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

  1. Lectures on Quantum Computation by David Deutsch
  2. Cambridge Centre for Quantum Computation
  1. R.P. Feynman International Journal of Theoretical Physics 21(6/7) 1982