Time-Efficient Quantum Walks for 3-Distinctness

DOI10.1007/978-3-642-39206-1_10zbMath1336.68081OpenAlexW127744604MaRDI QIDQ5326554

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

Mathematics Subject Classification ID

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

Related Items (9)

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

This page was built for publication: Time-Efficient Quantum Walks for 3-Distinctness