Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games

DOI10.1145/3055399.3055444zbMath1369.68210arXiv1704.06774OpenAlexW2609340483MaRDI QIDQ4978040

Martins Kokainis, Andris Ambainis

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

quantum algorithmssearch treesbacktrackingquantum searchBoolean formula evaluation

Mathematics Subject Classification ID

Searching and sorting (68P10) 2-person games (91A05) Data structures (68P05) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (4)

Completeness, approximability and exponential time results for counting problems with easy decision version ⋮ Exceptional quantum walk search on the cycle ⋮ Practical Implementation of a Quantum Backtracking Algorithm ⋮ Unnamed Item

This page was built for publication: Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games