Time-efficient quantum walks for 3-distinctness

DOI10.1007/978-3-642-39206-1_10zbMATH Open1336.68081OpenAlexW127744604MaRDI QIDQ5326554FDOQ5326554

Stacey Jeffery, Robin Kothari, Andrew M. Childs, Frédéric Magniez, Aleksandrs Belovs

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_10

Recommendations

• Quantum Walk Algorithm for Element Distinctness
• scientific article
• Quantum Walk Based Search Algorithms
• Element distinctness revisited
• Quantum walks on graphs

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Cited In (10)

• Element distinctness revisited
• Optimal parallel quantum query algorithms
• Practical Implementation of a Quantum Backtracking Algorithm
• Near-optimal quantum algorithms for string problems
• Quantum algorithms for finding constant-sized sub-hypergraphs
• Multidimensional quantum walks
• Extended learning graphs for triangle finding
• On new PageRank computation methods using quantum computing
• Approximate span programs
• Quantum algorithm for the multicollision problem

This page was built for publication: Time-efficient quantum walks for 3-distinctness

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