See this document in CiteSeerX!

Sharp Quantum Vs. Classical Query Complexity Separations  (Make Corrections)  
J. Niel de Beaudrap, Richard Cleve, John Watrous



  Home/Search   Context   Related

 
View or download:
cpsc.ucalgary.ca/~...dden_linear_alg.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

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

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

Abstract: We obtain the strongest separation between quantum and classical query complexity known to date|speci cally, we de ne a black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved exactly in the quantum case with a single query (and a polynomial number of auxiliary operations). The problem is simple to de ne and the quantum algorithm solving it is also simple when described in terms of certain quantum Fourier transforms (QFTs) that have... (Update)

Similar documents (at the sentence level):   More
68.1%:   Sharp quantum vs. classical query complexity separations - Niel De Beaudrap   (Correct)
28.4%:   Sharp Quantum versus Classical Query Complexity Separations - de Beaudrap, Cleve, Watrous (2002)   (Correct)
6.2%:   Quantum Fourier transforms for extracting hidden linear .. - De Beaudrap, Cleve.. (2000)   (Correct)

Active bibliography (related documents):   More   All
0.4:   Quantum Fourier Sampling, the Hidden Subgroup Problem, and Beyond - Hallgren (2000)   (Correct)
0.3:   Quantum Algorithms for Solvable Groups - Watrous (2000)   (Correct)
0.3:   Ecient Quantum Algorithms for Estimating Gauss Sums - Wim Van Dam (2002)   (Correct)

Similar documents based on text:   More   All
0.5:   The Query Complexity of Order-Finding - Cleve (1999)   (Correct)
0.4:   Reducing Error Probability in Quantum Algorithms.. - Buhrmann, Cleve, de.. (1999)   (Correct)
0.4:   Bounds for Small-Error and Zero-Error Quantum Algorithms - Buhrman, Cleve, de Wolf.. (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ beaudrap-sharp,
  author = "J. Niel de Beaudrap and Richard Cleve and John Watrous",
  title = "Sharp Quantum Vs. Classical Query Complexity Separations",
  url = "citeseer.ist.psu.edu/481805.html" }
Citations (may not include all citations):
352   A Course in Computational Algebraic Number Theory (context) - Cohen - 1993
173   Quantum complexity theory - Bernstein, Vazirani - 1997
164   Polynomial-time algorithms for prime factorization and discr.. - Shor - 1997
145   Introduction to Finite Fields and Their Applications (context) - Lidl, Niederreiter - 1994
144   the power of quantum computation - Simon - 1997
126   Rapid solutions of problems by quantum computation (context) - Deutsch, Jozsa - 1992
124   Elementary gates for quantum computation - Barenco, Bennett et al. - 1995
68   Modern Computer Algebra (context) - Gathen, Gerhard - 1999
58   Lower bounds by probabilistic arguments (context) - Yao - 1983
50   Quantum algorithms revisited - Cleve, Ekert et al. - 1998
46   An exact quantum polynomial-time algorithm for Simon's probl.. - Brassard, yer - 1997
35   Quantum cryptanalysis of hidden linear functions (context) - Boneh, Lipton - 1995
23   The hidden subgroup problem and eigenvalue estimation on a q.. - Mosca, Ekert - 1999
17   A First Course in Noncommutative Rings (context) - Lam - 1991
12   An improved quantum Fourier transform algorithm and applicat.. - Hales, Hallgren - 2000
5   Turing principle and the universal quantum computer (context) - Deutsch, the - 1985
4   Ecient quantum algorithms for shifted quadratic character pr.. (context) - van Dam, Hallgren - 2000
3   Personal communication (context) - Hallgren - 2001
3   Quantum Fourier transforms for extracting hidden linear stru.. - de Beaudrap, Cleve et al. - 2000
2   The query complexity of order-nding (context) - Cleve - 2000

Documents on the same site (http://www.cpsc.ucalgary.ca/~cleve/papers.html):   More
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998)   (Correct)
Bounds for Small-Error and Zero-Error Quantum Algorithms - Buhrman, Cleve, de Wolf.. (1999)   (Correct)
Schumacher's Quantum Data Compression as a Quantum Computation - Cleve, DiVincenzo (1996)   (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