评估 MIN-MAX 树的量子算法
量子物理
2022-03-29 v2
摘要
我们提出了一种用于评估 Min-Max 树的有界误差量子算法。对于大小为 N 的树，我们的算法进行 N^{1/2+o(1)} 次比较查询，这接近该问题的最优复杂度。
引用
@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}
}
评论
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