Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf  Home/Search
Context Related
| cwi.nl/~rdewolf/publ/qc/ed.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 present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Hyer, and Tapp, and imply an O(N 3=4 log N) quantum upper bound for the element distinctness problem in the comparison complexity model (contrasting with \Theta(N log N) classical complexity). We also prove a lower bound of \Omega\Gamma p N) comparisons for this problem and derive bounds for a number of... (Update)
Context of citations to this paper: More
...quantum algorithms and all physically implemented ones have operated in the so called black box setting. Examples are [12, 25, 14, 7, 6, 9]; even period finding, which is the core of Shor s factoring algorithm [24] can be viewed as a black box problem [11] In the black...
...the best lower bound is p n) which easily follows from the lower bound on Grover s search. The best algorithm uses O(n 3=4 ) queries[9]. 2. Simpler better lower bound for binary search. It may be possible to simplify other lower bounds proven previously by di erent methods....
Cited by: More
Quantum Time-Space Tradeoffs for Sorting - Klauck (Correct)
Quantum Lower Bound for the Collision Problem - Aaronson (2002) (Correct)
Quantum Algorithms - Chakraborty, Bera (2002) (Correct)
Similar documents (at the sentence level):
43.6%: Quantum Algorithms for Element Distinctness - Buhrman, Dürr, Heiligman.. (2000) (Correct)
29.4%: Quantum Algorithms for Finding Claws, Collisions and.. - Buhrman, Dürr.. (2000) (Correct)
Active bibliography (related documents): More All
0.2: Characterization of Non-Deterministic Quantum Query and Quantum.. - de Wolf (2000) (Correct)
0.2: Complexity Measures and Decision Tree Complexity: A Survey - Buhrman, de Wolf (1999) (Correct)
0.2: Average-Case Quantum Query Complexity - Ambainis, de Wolf (2000) (Correct)
Similar documents based on text: More All
0.2: A Target Distinctness Measure Based on a.. - Aranda.. (Correct)
0.2: Quantum Boolean Summation with Repetitions in the.. - Heinrich, Kwas.. (Correct)
0.2: The Program a2ac - Font Handling on the PostScript Level - Olsak (1995) (Correct)
Related documents from co-citation: More All
5: A fast quantum mechanical algorithm for database search - Grover - 1996
4: Strengths and weaknesses of quantum computing - Charles, Ethan et al.
4: Quantum algorithm for the collision problem - Brassard, Hoyer et al. - 1997
BibTeX entry: (Update)
H. Buhrman, C. Durr, M. Heiligman, P. Hyer, F. Magniez, M. Santha, and R. de Wolf. Quantum algorithms for element distinctness. quant-ph/0007016, 6 Jul 2000. http://citeseer.ist.psu.edu/article/buhrman00quantum.html More
@inproceedings{ buhrmanquantum,
author = "Harry Buhrman and Christoph D{\"u}rr and Mark Heiligman and Peter Hoyer and Frederic Magniez and Miklos Santha and Ronald de Wolf",
title = "Quantum Algorithms for Element Distinctness",
pages = "131--137",
url = "citeseer.ist.psu.edu/article/buhrman00quantum.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
102 Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. - 1997
46 An exact quantum polynomial-time algorithm for Simon's probl.. - Brassard, Hyer - 1997
45 Quantum computation - Berthiaume - 1997
23 Determinism versus non-determinism for linear time RAMs - Ajtai - 1999
16 Bounds for small-error and zero-error quantum algorithms - Buhrman, Cleve et al. - 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
12 Near-optimal time-space tradeoff for element distinctness (context) - C-C - 1994
11 Quantum amplitude amplification and estimation - Brassard, Hyer et al. - 2000
11 An introduction to quantum complexity theory (context) - Cleve - 1999
10 Super-linear time-space tradeoff lower bounds for randomized.. - Beame, Saks et al. - 2000
8 Randomized complexity lower bounds - Grigoriev - 1998
7 Invariant quantum algorithms for insertion into an ordered l.. (context) - Farhi, Goldstone et al. - 1999
3 A lower bound for the integer element distinctiveness proble.. (context) - Lubiw, R'acz - 1991
2 Bound on the number of functions that can be distinguished w.. (context) - Farhi, Goldstone 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