(Enter summary)
Abstract: This paper surveys the state of the field of quantum computation, with an emphasis on the recent
effort to devise simple quantum computational primitives upon which more complex quantum calculations
can be built. This effort is exemplified by the recent papers [2, 49], which we review. We also
discuss Shor's [38] paper, which describes the quantum-polynomial-time factoring algorithm that has
provided a major motivation for much of the recent activity.
1 Introduction
Quantitative Church's... (Update)
Context of citations to this paper: More
...asymptotic spacetime efficiency permitted by the laws of physics. The recent studies of quantum computing (e.g. 13] brief review in [5]) suggest that if it is possible to implement machines that can maintain and manipulate indefinitely large coherent states, then it is...
Cited by: More
Reversibility in Optimally Scalable Computer Architectures - Frank, Knight, Margolus (1997)
(Correct)
Active bibliography (related documents): More All
2.1: Quantum Information Processing: Compression, Coding, and Related.. - Reif (1985)
(Correct)
2.1: Alternative Computational Models: A Comparison of Biomolecular and .. - Reif (1998)
(Correct)
1.4: Bibliography - Athas Low-Power Vlsi
(Correct)
Similar documents based on text: More All
0.0: A Survey of Market-Based Approaches to - Distributed Computing Shashank
(Correct)
0.0: Graphs with Large Variance - Caro, Yuster
(Correct)
0.0: On the Efficiency of Noise-Tolerant PAC Algorithms Derived from.. - Jackson (2000)
(Correct)
BibTeX entry: (Update)
Michael P. Frank. Quantum computation primitives. Area exam paper, http:// www.ai.mit.edu/~mpf/qcpaper.html, February 1996. http://citeseer.ist.psu.edu/frank96quantum.html More
@misc{ frank96quantum,
author = "M. Frank",
title = "Quantum computation primitives",
text = "Michael P. Frank. Quantum computation primitives. Area exam paper, http://
www.ai.mit.edu/~mpf/qcpaper.html, February 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/frank96quantum.html" }
Citations (may not include all citations):
216
volume 2: Seminumerical Algorithms (context) - Knuth, of - 1981
175
Logical reversibility of computation (context) - Bennett - 1973
173
Quantum complexity theory
- Bernstein, Vazirani - 1993 ACM DBLP
126
Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992
118
the Church-Turing principle and the universal quantum comput.. (context) - Deutsch - 1985
116
Simulating physics with computers
- Feynman - 1982 ACM
85
Quantum circuit complexity
- Yao - 1993 DBLP
70
Quantum computational networks (context) - Deutsch - 1989
57
Algorithms for quantum computation: Discrete log and factori..
- Shor - 1994
46
Quantum computations with cold trapped ions (context) - Cirac, Zoller - 1995
45
Polynomial-time algorithms for prime factorization and discr.. (context) - Shor - 1995 ACM DBLP
42
The quantum challenge to structural complexity theory
- Berthiaume, Brassard - 1992
42
Multiple particle interference and quantum error correction (context) - Steane - 1996
37
A potentially realizable quantum computer (context) - Lloyd - 1993
36
Oracle quantum computing
- Berthiaume, Brassard - 1992
32
Machine models and simulations (context) - Boas - 1990 ACM
24
Universality in quantum computation
- Deutsch, Barenco et al. - 1995
19
volume 1554 of Lecture Notes in Mathematics (context) - Lenstra, Lenstra et al. - 1993
18
A universal two-bit gate for quantum computation (context) - Barenco - 1995
18
Measurement of conditional phase shifts for quantum logic (context) - Turchette, Hood et al.
17
The complexity of analog computation (context) - Vergis, Steiglitz et al. - 1986 ACM
16
Quantum networks for elementary arithmetic operations (context) - Vedral, Barenco et al. - 1995
13
Is quantum mechanically coherent computation useful (context) - Landauer - 1995
8
Conditional quantum dynamics and logic gates (context) - Barenco, Deutsch et al. - 1995
8
Structural basis of multistationary quantum systems ii: Effe.. (context) - Teich, Obermayer et al. - 1988
8
Quantum computing and phase transitions in combinatorial sea..
- Hogg - 1995 DBLP
8
Pendulum: A reversible computer architecture
- Vieri - 1995
7
Quantum computers and dissipation
- Palma, Suominen et al. - 1995
7
Quantum cryptoanalysis of hidden linear functions (context) - Boneh, Lipton - 1995
7
Realizable universal quantum logic gates (context) - Sleator, Weinfurter - 1995
6
Envisioning a quantum supercomputer (context) - Lloyd - 1994
6
Shor's quantum algorithm for factorising numbers (context) - Ekert, Jozsa
6
continuous observation and quantum computing: a cavity QED m.. (context) - Pellizzari - 1995
4
Results on two-bit gate design for quantum computers
- DiVincenzo, Smolin
4
Decoherence and quantum computers: a problem (context) - Unruh - 1994
4
Notes on Shor's efficient algorithm for factoring on a quant.. (context) - Ekert, Jozsa - 1994
3
Quantum error correction by coding (context) - Chuang, Laflamme - 1995
3
Two-bit gates are universal for quantum computation (context) - DiVincenzo - 1995
3
Five two-bit quantum gates are sufficient to implement the q..
- Smolin, DiVincenzo
2
Philosophical Transactions of the Royal Society of London Se.. (context) - Landauer, mechanics - 1995
2
Mainraining coherence in quantum computers (context) - Unruh - 1995
2
Preprint at Los Alamos Physics Preprint Archive (context) - Chuang, Laflamme et al. - 1995
2
Preprint at Los Alamos Physics Preprint Archive (context) - Chuang, Yamamoto et al. - 1995
2
Rubbed out with the quantum eraser: Making quantum informati.. (context) - Yam - 1996
1
uncompress ps cgi (context) - Bennett, Bernstein et al. - 1994
1
equation u = ` n u o`u ` est un (context) - Lecerf, r'eversibles et al. - 1963
1
technical report MIT/LCS/TM (context) - Toffoli - 1980
1
Discusses a simulation of Shor's algorithm with error correc.. (context) - Miquel, Paz et al. - 1996
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