Discrete-query quantum algorithm for NAND trees

Details Discrete-query quantum algorithm for NAND trees Discrete-query quantum algorithm for NAND trees

2007-02-16

arxiv.org/abs/quant-ph/0702160v1

Theory of Computing, Vol. 5 (2009) 119-123

Physics

Quantum Physics

2 pages

Scientific paper

10.4086/toc.2009.v005a005

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.

Affiliated with

Also associated with

No associations

Rating

Discrete-query quantum algorithm for NAND trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Discrete-query quantum algorithm for NAND trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Discrete-query quantum algorithm for NAND trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-348467