Quantum Algorithms for Evaluating MIN-MAX Trees
Quantum Physics
2022-03-29 v2
Abstract
We present a bounded-error quantum algorithm for evaluating Min-Max trees. For a tree of size N our algorithm makes N^{1/2+o(1)} comparison queries, which is close to the optimal complexity for this problem.
Cite
@article{arxiv.0710.5794,
title = {Quantum Algorithms for Evaluating MIN-MAX Trees},
author = {Richard Cleve and Dmytro Gavinsky and David L. Yonge-Mallo},
journal= {arXiv preprint arXiv:0710.5794},
year = {2022}
}
Comments
Re-submitted due to name change. Besides the name of one of the authors, this version is identical to that of 31 Oct 2007: in particular, some of the authors' affiliations and the references given in the document are outdated