Quantum lower bound for the collision problem
From MaRDI portal
Publication:3579214
DOI10.1145/509907.509999zbMath1192.68255OpenAlexW2040958198MaRDI QIDQ3579214
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Quantum computation vs. firewalls ⋮ Approximate Degree in Classical and Quantum Computing ⋮ The quantum query complexity of the hidden subgroup problem is polynomial ⋮ On the Power of Statistical Zero Knowledge ⋮ Quantum vs Classical Proofs and Subset Verification ⋮ Unnamed Item ⋮ Quantum certificate complexity ⋮ Quantum protocols for zero-knowledge systems ⋮ On the power of Ambainis lower bounds ⋮ Quantum algorithm to find invariant linear structure of \(MD\) hash functions ⋮ Complexity classes of equivalence problems revisited ⋮ Unnamed Item ⋮ The Complexity of Zero Knowledge ⋮ Quantum Property Testing for Bounded-Degree Graphs
This page was built for publication: Quantum lower bound for the collision problem
