(Enter summary)
Abstract: Historically, Turing machines have been the paradigm by
which we defined computability and efficiency. This is based on Church's
thesis that everything effectively computable can also be computed on a
Turing machine. But since our world behaves quantum mechanically, it
seems reasonable to also consider computing models that make use of quantum
mechanical properties. First stated by Benioff [Ben82] and Feynman
[Fey82], this idea was formalized by Deutsch [Deu85] when he introduced
his... (Update)
Cited by: More
cs.CC/9904019 - Aug Bounds For
(Correct)
Determining Acceptance Possibility for a Quantum - Hard (2000)
(Correct)
Cryptographic Semantics for the Algebraic Models - Adelsbach, (eds.) (1999)
(Correct)
Related documents from co-citation: More All
21: A fast quantum mechanical algorithm for database search
- Grover - 1996
21: Quantum complexity theory
- Bernstein, Vazirani - 1993
19: the power of quantum computation
- Simon - 1994
BibTeX entry: (Update)
@incollection{ berthiaume97quantum,
author = "Andre Berthiaume",
title = "Quantum Computation",
booktitle = "Complexity Theory Retrospective {II}",
publisher = "Springer-Verlag, Berlin Germany",
editor = "L. Hemaspaandra and A. Selman",
pages = "23--51",
year = "1997",
url = "citeseer.ist.psu.edu/berthiaume97quantum.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ee.ntu.edu.tw/~yen/courses/toc.html):
Quantum Computation - Berthiaume (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC