A Quantum Algorithm for the Hamiltonian NAND Tree

Details A Quantum Algorithm for the Hamiltonian NAND Tree A Quantum Algorithm for the Hamiltonian NAND Tree

2007-02-14

arxiv.org/abs/quant-ph/0702144v2

Physics

Quantum Physics

16 pages, 15 figures, v2 with run time improved to sqrt N by slight sharpening of estimates in section 3

Scientific paper

We give a quantum algorithm for the binary NAND tree problem in the
Hamiltonian oracle model. The algorithm uses a continuous time quantum walk
with a run time proportional to sqrt N. We also show a lower bound of sqrt N
for the NAND tree problem in the Hamiltonian oracle model.

Affiliated with

Also associated with

No associations

Rating

A Quantum Algorithm for the Hamiltonian NAND Tree 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 A Quantum Algorithm for the Hamiltonian NAND Tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Quantum Algorithm for the Hamiltonian NAND Tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-210272