Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf  Home/Search
Context Related
| cwi.nl/~rdewolf/pub...polynomials.ps.gz 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: cwi.nl/~rdewolf (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Devices]: Models of Computation; F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity General Terms: Theory, Algorithms, Performance Additional Key Words and Phrases: Quantum computing, query complexity, black-box model, lower bounds, polynomial method 1. (Update)
Cited by: More
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998) (Correct)
cs.CC/9904019 - Aug Bounds For (Correct)
Physical Systems for the Solution of Hard Computational Problems - Mattsson (2003) (Correct)
Similar documents (at the sentence level):
33.1%: Quantum Lower Bounds by Polynomials - Beals, Buhrman, Cleve, Mosca, de.. (1998) (Correct)
28.8%: quant-ph/9802049 - Sep Quantum Lower (Correct)
Active bibliography (related documents): More All
0.0: Bounds for Small-Error and Zero-Error Quantum Algorithms - Buhrman, Cleve, de Wolf.. (1999) (Correct)
0.0: Quantum Certificate Complexity - Aaronson (Correct)
0.0: Reducing Error Probability in Quantum Algorithms.. - Buhrmann, Cleve, de.. (1999) (Correct)
Similar documents based on text: More All
0.4: Sharp Quantum Vs. Classical Query Complexity Separations - de Beaudrap, Cleve, Watrous (Correct)
0.3: Exact quantum Fourier transforms and discrete logarithm.. - Mosca, Zalka (2003) (Correct)
0.2: Quantum Lower Bound for Recursive Fourier Sampling - Aaronson (2003) (Correct)
Related documents from co-citation: More All
30: A fast quantum mechanical algorithm for database search - Grover - 1996
27: Strengths and weaknesses of quantum computing - Charles, Ethan et al.
23: Polynomial-time algorithms for prime factorization and discrete logarithms on a .. - Shor - 1995
BibTeX entry: (Update)
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf "Quantum Lower Bounds by Polynomials", quantph /9802049. http://citeseer.ist.psu.edu/449680.html More
@inproceedings{ beals98quantum,
author = "Robert Beals and Harry Buhrman and Richard Cleve and Michele Mosca and Ronald de Wolf",
title = "Quantum Lower Bounds by Polynomials",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "352-361",
year = "1998",
url = "citeseer.ist.psu.edu/449680.html" }
Citations (may not include all citations):11 the Monte Carlo decision tree complexity of read-once formul.. (context) - Santha, On - 1991
1 Conjugated operators in quantum algorithms (context) - Beals, Buhrman et al. - 1999 ACM
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cwi.nl/~rdewolf): More
Quantum Computation - Berthiaume (1997) (Correct)
Least Generalizations under Implication - Nienhuys-Cheng, de Wolf (1996) (Correct)
Lower Bounds for Quantum Search and Derandomization - Buhrman, de Wolf (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