Quantum algorithms for element distinctness

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 131-137

  Buhrman, Harry ^a   Dürr, Christoph ^b   Heiligman, Mark ^c   Høyer, Peter ^d   Magniez, Frédéric ^e   Santha, Miklos ^e   De Wolf, Ronald ^a  

^a CWI   (Netherlands)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c NSA   (United States)

^d UNIVERSITY OF CALGARY   (Canada)

^e CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

QUANTUM ALGORITHMS; QUANTUM AMPLITUDE AMPLIFICATION;

ALGORITHMS;

EID: 0034871376     PISSN: 10930159     EISSN: None     Source Type: Journal    
DOI: 10.1109/CCC.2001.933880     Document Type: Article

References (21)

1. Determinism versus non-determinism for linear time RAMs
2. Quantum lower bounds by quantum arguments
3. Quantum lower bounds by polynomials
4. Super-linear time-space tradeoff lower bounds for randomized computation
5. Strengths and weaknesses of quantum computing
6. An exact quantum polynomial-time algorithm for Simon's problem
7. Quantum amplitude amplification and estimation
8. Quantum algorithm for the collision problem
9. Quantum counting
10. Quantum vs. classical communication and computation
11. Bounds for small-error and zero-error quantum algorithms
12. Invariant quantum algorithms for insertion into an ordered list
13. Randomized complexity lower bounds
14. A fast quantum mechanical algorithm for database search
15. Quantum bounds for ordered searching and sorting
16. A lower bound for the integer element distinctiveness problem
17. Quantum searching, counting and amplitude amplification by eigenvector analysis
18. The quantum query complexity of approximating the median and related statistics
19. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
20. Near-optimal time-space tradeoff for element distinctness