Quantum Algorithms for Evaluating Min-Max Trees

DOI10.1007/978-3-540-89304-2_2zbMath1162.68456arXiv0710.5794OpenAlexW1657432701MaRDI QIDQ5503293

Richard Cleve, David Yonge-Mallo, Dmitry Gavinsky

Publication date: 13 January 2009

Published in: Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Challenges of adiabatic quantum evaluation of NAND trees ⋮ Quantum algorithm for lexicographically minimal string rotation ⋮ Intricacies of quantum computational paths ⋮ Quantum walks: a comprehensive review ⋮ Quantum branch-and-bound algorithm and its application to the travelling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• A lower bound on the quantum query complexity of read-once functions
• Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
• Strengths and Weaknesses of Quantum Computing

This page was built for publication: Quantum Algorithms for Evaluating Min-Max Trees