Discrete-query quantum algorithm for NAND trees
量子物理
2019-09-10 v2
摘要
Recently, Farhi, Goldstone, and Gutmann gave a quantum algorithm for evaluating NAND trees that runs in time O(sqrt(N log N)) in the Hamiltonian query model. In this note, we point out that their algorithm can be converted into an algorithm using O(N^{1/2 + epsilon}) queries in the conventional quantum query model, for any fixed epsilon > 0.
引用
@article{arxiv.quant-ph/0702160,
title = {Discrete-query quantum algorithm for NAND trees},
author = {Andrew M. Childs and Richard Cleve and Stephen P. Jordan and David Yonge-Mallo},
journal= {arXiv preprint arXiv:quant-ph/0702160},
year = {2019}
}
备注
2 pages. v2: updated name of one author