Charles H. Bennett, Ethan Bernstein, Gilles Brassard, Umesh Vazirani  Home/Search
Context Related
| berkeley.edu/~vazirani/bbbv.ps berkeley.edu/~vazirani/bbbv.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: berkeley.edu/~vazirani/ (more) Homepages: C.Bennett |
Rate this article:      (best)Comment on this article |
Abstract: Recently a great deal of attention has focused on quantum computation following a sequence of results [4, 16, 15] suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the extraction of discrete logarithms are both solvable in quantum polynomial time, it is natural to ask whether all of NP can be efficiently solved in quantum polynomial time. In this paper, we address this question by proving that relative to an... (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 Entanglement and the Communication Complexity of the .. - Richard Cleve Wim (Correct)
Similar documents (at the sentence level):
6.1%: Quantum Complexity Theory - Bernstein, Vazirani (1997) (Correct)
Active bibliography (related documents): More All
0.0: Complexity-Theoretic Aspects of Interactive Proof Systems - Fortnow (1989) (Correct)
0.0: Random Debaters and the Hardness of Approximating.. - Condon, Feigenbaum.. (1994) (Correct)
0.0: Computational Arithmetic Geometry I: Sentences Nearly In The.. - Rojas (2000) (Correct)
Similar documents based on text: More All
0.4: Quantum Lower Bound for Recursive Fourier Sampling - Aaronson (2003) (Correct)
0.3: Bibliography - Athas Low-Power Vlsi (Correct)
0.3: From Monte Carlo to Quantum Computation - Heinrich (Correct)
Related documents from co-citation: More All
66: A fast quantum mechanical algorithm for database search - Grover - 1996
43: Polynomial-time algorithms for prime factorization and discrete logarithms on a .. - Shor - 1995
38: Quantum complexity theory - Bernstein, Vazirani - 1993
BibTeX entry: (Update)
Bennett, Charles H., Ethan Bernstein, Gilles Brassard and Umesh Vazirani, "Strengths and weaknesses of quantum computing", to appear SIAM Journal on Computing. http://citeseer.ist.psu.edu/bennett96strengths.html More
@misc{ bennett94strengths,
author = "Charles H.~Bennett and Ethan Bernstein and Gilles Brassard and Umesh V.~Vazirani",
title = "Strengths and Weaknesses of Quantum Computing",
howpublished = "Preprint at {\url http://vesta.physics.ucla.edu/cgi-bin/uncompress\_ps\_cgi?bbbv94h.ps}",
year = "1994",
url = "citeseer.ist.psu.edu/bennett96strengths.html" }
Citations (may not include all citations):175 Logical reversibility of computation (context) - Bennett - 1973
109 Relative to a random oracle (context) - Bennett, Gill
79 Arthur -- Merlin games: A randomized proof system, and a hie.. (context) - Babai, Moran - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.berkeley.edu/~vazirani/): More
"Go With the Winners" Algorithms - Aldous, Vazirani (1994) (Correct)
On the Power of Quantum Computation - Vazirani (1998) (Correct)
The Quantum Communication Complexity of Sampling - Ambainis, Schulman, Ta-Shma, .. (1998) (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