Quantum Algorithms for Evaluating MIN-MAX Trees

Richard Cleve, Dmytro Gavinsky, David L. Yonge-Mallo
Arxiv ID: 0710.5794Last updated: 3/29/2022
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.

PaperStudio AI Chat

I'm your research assistant! Ask me anything about this paper.

Related papers

Commercial Disclosure
© 2023 Paper Studio™. All Rights Reserved.