Optimal deterministic quantum algorithm for the promised element distinctness problem
From MaRDI portal
Recommendations
Cites work
- Complexity measures and decision tree complexity: a survey.
- Deterministic quantum search with adjustable parameters: implementations and applications
- Element distinctness revisited
- scientific article; zbMATH DE number 5899233 (Why is no real title available?)
- scientific article; zbMATH DE number 5485488 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Quantum adversary lower bound for element distinctness with small range
- Quantum Algorithms for Element Distinctness
- Quantum computation and quantum information. 10th anniversary edition
- Quantum lower bounds by polynomials
- Quantum lower bounds for the collision and the element distinctness problems
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Quantum Walk Algorithm for Element Distinctness
- Quantum walks can find a marked element on any graph
Cited in
(3)
This page was built for publication: Optimal deterministic quantum algorithm for the promised element distinctness problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496884)
