Quantum lower bound for the collision problem

DOI10.1145/509907.509999MaRDI QIDQ3579214zbMATH OpenOpenAlexWikidataFDO

Authors Scott Aaronson

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/509907.509999

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum computation (81P68)

Cited in

(17)

• The quantum query complexity of the hidden subgroup problem is polynomial
• Quantum computation vs. firewalls
• On the power of statistical zero knowledge
• Quantum vs. classical proofs and subset verification
• Rewindable quantum computation and its equivalence to cloning and adaptive postselection
• Quantum lower bounds for approximate counting via Laurent polynomials
• Complexity classes of equivalence problems revisited
• The Complexity of Zero Knowledge
• Quantum certificate complexity
• Quantum query complexity with matrix-vector products
• An exponential separation between quantum query complexity and the polynomial degree
• On the power of Ambainis lower bounds
• Dual polynomials for collision and element distinctness
• Quantum algorithm to find invariant linear structure of MD hash functions
• Quantum protocols for zero-knowledge systems
• Approximate Degree in Classical and Quantum Computing
• Quantum property testing for bounded-degree graphs

This page was built for publication: Quantum lower bound for the collision problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579214)