Daniel R. Simon  Home/Search
Context Related
| imsc.ernet.in/tcsweb/quantum...simon.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: imsc.ernet.in/tcsweb/quantu...qcc (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The quantum model of computation, introduced by Feynman and first formalized by Deutsch, is a probabilistic model, similar to the probabilistic Turing Machine, in which the laws of probability are those obeyed by particles on a quantum mechanical scale, rather than the rules familiar to us from the macroscopic world. Recent work by Deutsch and Jozsa, Brassard and Berthiaume, and Bernstein and Vazirani has given indications that this model may be more powerful, in a complexity theoretic... (Update)
Cited by: More
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998) (Correct)
Quantum Lower Bounds by Polynomials - Robert Beals University (Correct)
Quantum Fourier transforms for extracting hidden - Linear Structures In (Correct)
Active bibliography (related documents): More All
0.7: On the Power of Quantum Computation - Simon (1994) (Correct)
0.1: Reversibility and Adiabatic Computation: Trading Time and Space.. - Ming Li (1996) (Correct)
0.1: Reversible Simulation of Irreversible Computation - Li, Tromp, Vitanyi (1996) (Correct)
Related documents from co-citation: More All
64: Quantum complexity theory - Bernstein, Vazirani - 1993
61: Rapid solutions of problems by quantum computation (context) - Deutsch, Jozsa - 1992
42: A fast quantum mechanical algorithm for database search - Grover - 1996
BibTeX entry: (Update)
D. Simon. On the power of quantum computation. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 124--134. IEEE, 1994. http://citeseer.ist.psu.edu/simon94power.html More
@inproceedings{ simon94power,
author = "David R.~Simon",
title = "On the Power of Quantum Computation",
booktitle = "Proceedings of the 35th Annual Symposium on Foundations of Computer Science",
publisher = "Institute of Electrical and Electronic Engineers Computer Society Press",
address = "Los Alamitos, CA",
pages = "116--123",
year = "1994",
url = "citeseer.ist.psu.edu/simon94power.html" }
Citations (may not include all citations):175 Logical Reversibility of Computation (context) - Bennett - 1973
173 Quantum Complexity Theory - Bernstein, Vazirani - 1993
126 Rapid Solution of Problems by Quantum Computation (context) - Deutsch, Jozsa - 1992
120 Unbiased Bits from Sources of Weak Randomness and Probabilis.. - Chor, Goldreich - 1988
118 the Church--Turing Principle and the Universal Quantum Compu.. (context) - Deutsch, Theory - 1985
116 Simulating Physics with Computers - Feynman - 1982
42 The Quantum Challenge to Structural Complexity Theory - Berthiaume, Brassard - 1992
36 Oracle Quantum Computing - Berthiaume, Brassard - 1992
32 on Foundations of Computer Science (context) - Yao, Complexity et al. - 1993
8 equation u = ` n ou ` est un (context) - Lecerf, reversibles et al. - 1963
2 Vazirani Random Polynomial Time is Equal to SlightlyRandom P.. (context) - Vazirani - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.imsc.ernet.in/tcsweb/quantum/qcc.html): More
Quantum Circuit Complexity - Yao (1993) (Correct)
Elementary Gates for Quantum Computation - Barenco, Bennett, Cleve, Di.. (1995) (Correct)
Decoherence and a Simple Quantum Computer - Isaac Chuang Raymond (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