Quantum adversary lower bound for element distinctness with small range
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5899233 (Why is no real title available?)
- Automata, Languages and Programming
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Walk Algorithm for Element Distinctness
- Quantum lower bounds by quantum arguments
- Reflections for quantum query algorithms
Cited in
(10)- Element distinctness revisited
- scientific article; zbMATH DE number 7651029 (Why is no real title available?)
- scientific article; zbMATH DE number 5899233 (Why is no real title available?)
- Automata, Languages and Programming
- Quantum lower bound for the collision problem with small range
- The decision-tree complexity of element distinctness
- The quantum adversary method and classical formula size power bounds
- Quantum complexity for vector domination problem
- Optimal deterministic quantum algorithm for the promised element distinctness problem
- Adversary lower bound for the k-sum problem
This page was built for publication: Quantum adversary lower bound for element distinctness with small range
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191147)