Work

Discrete-query quantum algorithm for NAND trees. (arXiv:quant-ph/0702160v2 UPDATED)

Year: 2019

Type: preprint

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 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.

Source: arXiv (Cornell University)

Authors: Andrew M. Childs, Richard Cleve, Stephen P. Jordan, David L. Yonge-Mallo

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2972145752

Cites: 5

Cited by:

Related to: 10