Quantum algorithms

J. Kempe, T. Vidick

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

The idea to put computing machines on a physical footing and to use the laws of physics as the basis of a computer already dates back several decades. In the 1980s, Feynman [24,25] was the first to consider quantum mechanics from a computational point of view by observing that the simulation of quantum mechanical systems on a classical computer seemed to require an increase in complexity exponential in the size of the system. He asked whether this exponential overhead was inevitable, and if it was possible to design a universal quantum computer, which could simulate any quantum system without the exponential overhead. In 1985 Deutsch [17] defined the model of the quantum Turing machine, generalizing the classical Turing machine to follow the laws of quantum mechanics. Yao later showed that it was equivalent to the quantum circuit model, also defined by Deutsch. Classical computers Quantum computers quantum circuit models Quantum computers quantum Turing machines Quantum computers universal

Original languageEnglish (US)
Title of host publicationQuantum Information, Computation and Cryptography
Subtitle of host publicationAn Introductory Survey of Theory, Technology and Experiments
EditorsFabio Benatti
Pages309-342
Number of pages34
DOIs
StatePublished - 2010

Publication series

NameLecture Notes in Physics
Volume808
ISSN (Print)0075-8450

ASJC Scopus subject areas

  • Physics and Astronomy (miscellaneous)

Fingerprint Dive into the research topics of 'Quantum algorithms'. Together they form a unique fingerprint.

  • Cite this

    Kempe, J., & Vidick, T. (2010). Quantum algorithms. In F. Benatti (Ed.), Quantum Information, Computation and Cryptography: An Introductory Survey of Theory, Technology and Experiments (pp. 309-342). (Lecture Notes in Physics; Vol. 808). https://doi.org/10.1007/978-3-642-11914-9_10