See this document in CiteSeerX!

quant-ph/9802049  (Make Corrections)  (1 citation)
Sep Quantum Lower Bounds by Polynomials Robert Beals University of Arizona...



  Home/Search   Context   Related

 
View or download:
pages.cpsc.ucalgar...polynomials_qph.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  pages.cpsc.ucalgary.ca/~cleve/... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We examine the number T of queries that a quantum network requires to compute several Boolean functions on in the black-box model. We show that, in the blackbox model, the exponential quantum speed-up obtained for partial functions (i.e. problems involving a promise on the input) by Deutsch and Jozsa and by Simon cannot be obtained for any total function: if a quantum algorithm computes some total Boolean function f with bounded-error using T black-box queries then there is a classical... (Update)

Cited by:   More
Mathematics of the Quantum Zeno Effect - Schmidt   (Correct)

Similar documents (at the sentence level):
33.0%:   Quantum Lower Bounds by Polynomials - Beals, Buhrman, Cleve, Mosca, de..   (Correct)
5.5%:   Complexity Measures and Decision Tree Complexity: A Survey - Buhrman, de Wolf (2000)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Reducing Error Probability in Quantum Algorithms.. - Buhrmann, Cleve, de.. (1999)   (Correct)
0.5:   Bounds for Small-Error and Zero-Error Quantum Algorithms - Buhrman, Cleve, de Wolf.. (1999)   (Correct)
0.3:   Algorithms for Boolean Function Query Properties - Aaronson   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ lower-quantph,
  author = "Sep Quantum Lower",
  title = "quant-ph/9802049",
  url = "citeseer.ist.psu.edu/761948.html" }
Citations (may not include all citations):
210   A fast quantum mechanical algorithm for database search - Grover - 1996
164   Polynomial-time algorithms for prime factorization and discr.. - Shor - 1997
144   the power of quantum computation - Simon - 1997
126   Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992
102   Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. - 1997
57   the degree of Boolean functions as real polynomials - Nisan, Szegedy - 1994
50   Quantum algorithms revisited - Cleve, Ekert et al. - 1998
46   An exact quantum polynomialtime algorithm for Simon's proble.. - Brassard, Hyer - 1997
40   Quantum measurements and the Abelian stabilizer problem (context) - Kitaev - 1995
36   Complexity limitations on quantum computation - Fortnow, Rogers - 1998
35   Quantum cryptanalysis of hidden linear functions (context) - Boneh, Lipton - 1995
32   An oracle builder's toolkit - Fenner, Fortnow et al. - 1993
31   The polynomial method in circuit complexity - Beigel - 1993
30   Quantum counting - Brassard, Hyer et al. - 1998
29   classical communication and computation (context) - Buhrman, Cleve et al. - 1998
29   Probabilistic Boolean decision trees and the complexity of e.. (context) - Saks, Wigderson - 1986
23   The hidden subgroup problem and eigenvalue estimation on a q.. - Mosca, Ekert - 1998
21   Grover's quantum searching algorithm is optimal (context) - Zalka - 1997
18   the degree of polynomials that approximate symmetric Boolean.. (context) - Paturi - 1992
16   Schwankung von Polynomen zwischen Gitterpunkten (context) - Ehlich, Zeller - 1964
11   the Monte Carlo decision tree complexity of read-once formul.. (context) - Santha - 1991
11   A comparison of uniform approximations on an interval and a .. (context) - Rivlin, Cheney - 1966
11   Earlier version in STOC (context) - Nisan, decision et al. - 1991
10   counting and amplitude amplification by eigenvector analysis (context) - Mosca - 1998
8   Personal communication (context) - Nisan - 1998
7   Polynomials with two values (context) - Gathen, Roche - 1997
7   Personal communication (context) - Hayes, Kutin - 1998
5   Quantum oracle interrogation: Getting all information for al.. - van Dam - 1998
5   A limit on the speed of quantum computation in determining p.. (context) - Farhi, Goldstone et al.
4   Personal communication (context) - van Melkebeek - 1998
4   Personal communication (context) - Ambainis - 1998
4   Conjugated operators in quantum algorithms (context) - Hyer - 1997
3   Personal communication (context) - Terhal - 1997
2   Personal communication (context) - Hyer - 1998
2   Quantum computer can not speedup iterated applications of a .. (context) - Ozhigov
2   Earlier version in Physcomp'96; also quant-ph (context) - Boyer, Brassard et al. - 1998

Documents on the same site (http://pages.cpsc.ucalgary.ca/~cleve/pubs/):   More
The query complexity of order-finding - Richard Cleve Department   (Correct)
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John   (Correct)
quant-ph/9901035 - Jan The Cost   (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