Quantum computation Particle and wave aspects of algorithms

The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen. Clever quantum algorithms have been discovered in recent ye...

Full description

Saved in:
Bibliographic Details
Published inResonance Vol. 16; no. 9; pp. 821 - 835
Main Author Patel, Apoorva
Format Journal Article
LanguageEnglish
Published India Springer-Verlag 01.09.2011
Subjects
Education
Humanities and Social Sciences
multidisciplinary
Science
Science Education
superposition
Boolean logic
digital language
qubit
Hilbert space
Feynman
computation
computational complexity
Online AccessGet full text

Cover

More Information
Summary:The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen. Clever quantum algorithms have been discovered in recent years, although not systematically, and the field remains under active investigation. Richard Feynman was one of the pioneers who foresaw the power of quantum computers. In this issue dedicated to him, I give an introduction to how particle and wave aspects contribute to the power of quantum computers. Shor’s and Grover’s algorithms are analysed as examples.
ISSN:0971-8044
0973-712X
DOI:10.1007/s12045-011-0100-6