Nested Quantum Walks with Quantum Data Structures

DOI10.1137/1.9781611973105.106zbMath1423.68186arXiv1210.1199OpenAlexW3098074752MaRDI QIDQ5741815

Stacey Jeffery, Robin Kothari, Frédéric Magniez

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.1199

Mathematics Subject Classification ID

Data structures (68P05) Random walks on graphs (05C81) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

Quantum algorithm for triangle finding in sparse graphs ⋮ Quantum algorithms for finding constant-sized sub-hypergraphs ⋮ Quantum algorithm for lexicographically minimal string rotation ⋮ Near-optimal quantum algorithms for string problems ⋮ Quantum algorithm design: techniques and applications ⋮ Improved quantum query algorithms for triangle detection and associativity testing

This page was built for publication: Nested Quantum Walks with Quantum Data Structures