Quantum Algorithms for Evaluating MIN-MAX Trees
Abstract
We present a bounded-error quantum algorithm for evaluating Min-Max trees. For a tree of size N our algorithm makes N1/2+o(1) comparison queries, which is close to the optimal complexity for this problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.