Andris Ambainis, Ronald de Wolf  Home/Search
Context Related
| cwi.nl/~rdewolf/pub...avq_journal.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: We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be at most polynomial [3]. We show that for average-case complexity under the uniform distribution, quantum algorithms can be exponentially faster than classical algorithms. Under non-uniform distributions the gap can even be super-exponential. We also prove some general bounds for average-case complexity and show that the... (Update)
Context of citations to this paper: More
...1 2 log log n 1 2 . 2 There has also been some work on average (block) sensitivity [Ber96] and its applications [Bop97, Shi99, AW00] 6 Wegener [Weg85] proved that this theorem is tight up to the O(log log n) term by means of the monotone address function. We now prove...
.... It may well be true that bs(f) 2 O(s(f) 2 ) 3 There has also been some work on average (block) sensitivity [5] and its applications [7,40,2]. In particular, Shi [40] has shown that the average sensitivity of a total function f is a lower bound on its approximate degree g deg(f...
Cited by: More
Algorithms for Boolean Function Query Properties - Aaronson (Correct)
Complexity Measures and Decision Tree Complexity: A Survey - Buhrman, de Wolf (2000) (Correct)
Similar documents (at the sentence level):
23.6%: Average-Case Quantum Query Complexity - de Wolf (1999) (Correct)
Active bibliography (related documents): More All
0.5: A New Quantum Algorithm for NP-complete Problems - Ohya, Volovich (2002) (Correct)
0.4: Quantum Algorithms - Chakraborty, Bera (2002) (Correct)
0.3: Quantum Lower Bound for the Collision Problem - Aaronson (2002) (Correct)
Similar documents based on text: More All
0.3: Small Pseudo-Random Families of Matrices: - Derandomizing Approximate Quantum (2004) (Correct)
0.2: Exponential Lower Bound for 2-Query Locally Decodable Codes .. - Kerenidis, de Wolf (2003) (Correct)
0.2: Quantum Lower Bounds by Quantum Arguments - Ambainis (Correct)
Related documents from co-citation: More All
3: the degree of boolean functions as real polynomial - Nisan, Szegedy - 1992
3: Probabilistic Boolean decision trees and the complexity of evaluating game trees (context) - Saks, Wigderson - 1986
3: A fast quantum mechanical algorithm for database search - Grover - 1996
BibTeX entry: (Update)
A. Ambainis and R. de Wolf. Average-case quantum query complexity. In Proceedings of 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS'2000), Lecture Notes in Computer Science. Springer, 2000. To appear. Also quant-ph/9904079. http://citeseer.ist.psu.edu/ambainis00averagecase.html More
@article{ ambainis00averagecase,
author = "Andris Ambainis and Ronald de Wolf",
title = "Average-Case Quantum Query Complexity",
journal = "Lecture Notes in Computer Science",
volume = "1770",
pages = "133--??",
year = "2000",
url = "citeseer.ist.psu.edu/ambainis00averagecase.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Spencer - 1992
210 A fast quantum mechanical algorithm for database search - Grover - 1996
167 Quantum Computation and Quantum Information (context) - Nielsen, Chuang - 2000
164 Polynomial-time algorithms for prime factorization and discr.. - Shor - 1997
149 Fast probabilistic algorithms for verification of polynomial.. (context) - Schwartz - 1980
144 the power of quantum computation - Simon - 1997
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992
112 Average case complete problems (context) - Levin - 1986
102 Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. - 1997
73 Tight bounds on quantum searching - Boyer, Brassard et al. - 1998
70 Average-case analysis of algorithms and data structures - Vitter, Flajolet - 1990
57 the degree of Boolean functions as real polynomials - Nisan, Szegedy - 1994
30 Quantum counting - Brassard, Hyer et al. - 1998
17 Complexity measures and decision tree complexity: A survey - Buhrman, de Wolf - 1999
15 The quantum query complexity of approximating the median and.. - Nayak, Wu - 1999
15 Quantum algorithm for the collision problem - Brassard, Hyer et al. - 1997
11 Earlier version in STOC (context) - Nisan, decision et al. - 1991
11 Quantum amplitude amplification and estimation - Brassard, Hyer et al. - 2000
10 counting and amplitude amplification by eigenvector analysis (context) - Mosca - 1998
7 The average-case complexity of determining the majority (context) - Alonso, Reingold et al. - 1997
7 The query complexity of order-finding - Cleve - 1999
5 Quantum algorithms for element distinctness - Buhrman, Durr et al. - 2000
3 the normal approximation to the hypergeometric distribution (context) - Nicholson - 1956
2 Almost-everywhere superiority for quantum polynomial time - Hemaspaandra, Hemaspaandra et al. - 1999
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