Discrete-query quantum algorithm for NAND trees
Work
Year: 2009
Type: article
Abstract: 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 algo... more
Source: Theory of Computing
Institutions California Institute of Technology, University of Waterloo, Perimeter Institute, Massachusetts Institute of Technology, Center for Theoretical Biological Physics
Cites: 14
Cited by: 58
Related to: 10
FWCI: 10.79
Citation percentile (by year/subfield): 96.96
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid