Time-efficient quantum walks for 3-distinctness

DOI10.1007/978-3-642-39206-1_10MaRDI QIDQ5326554zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Quantum Walk Algorithm for Element Distinctness
• scientific article; zbMATH DE number 5320343
• Quantum Walk Based Search Algorithms
• Element distinctness revisited
• Quantum walks on graphs

Cited in

(14)

• Element distinctness revisited
• Quantum algorithm for the multicollision problem
• Extended learning graphs for triangle finding
• Approximate span programs
• On new PageRank computation methods using quantum computing
• Practical Implementation of a Quantum Backtracking Algorithm
• Quantum Walk Algorithm for Element Distinctness
• Near-optimal quantum algorithms for string problems
• Multidimensional quantum walks
• Quantum data structure for range minimum query
• Multidimensional quantum walks, with application to k-distinctness
• A unified framework of quantum walk search
• Multidimensional quantum walks, recursion, and quantum divide \& conquer
• Quantum algorithms for finding constant-sized sub-hypergraphs

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)