Quantum lower bound for the collision problem

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 635-642

  Aaronson, Scott ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; ERRORS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; QUERY LANGUAGES; SET THEORY; THEOREM PROVING;

COLLISION PROBLEM; LOWER BOUND; QUANTUM COMPUTER; QUANTUM COMPUTING;

QUANTUM THEORY;

EID: 0036036708     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509998.509999     Document Type: Conference Paper

References (28)

1. Quantum lower bounds by quantum arguments
2. Cryptographic hash functions: A survey
3. Quantum lower bounds by polynomials
4. Strengths and weakness of quantum computing
5. Quantum complexity theory
6. Quantum algorithm for the collision problem
7. Quantum algorithms for element distinctness
8. Complexity measures and decision tree complexity: A survey
9. Collision free hash functions and public key signature schemes
10. Schwankung von Polynomen zwischen Gitterpunkten
11. On quantum algorithms for noncommutative hidden subgroups
12. Quantum mechanical algorithms for the nonabelian hidden subgroup problem
13. A fast quantum mechanical algorithm for database search
14. On the power of quantum oracles
15. Quantum measurements and the abelian stabilizer problem
16. CREW PRAMs and decision trees
17. On the degree of boolean functions as real polynomials
18. Talk given at AT&T
19. A comparison of uniform approximations on an interval and a finite subset thereof
20. A complete promise problem for statistical zero-knowledge
21. Quantum lower bounds for the collision and the element distinctness problems
22. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
23. On the power of quantum computation
24. Succinct quantum proofs for properties of finite groups