★grads.net/bibliography

WIKINDX Resources

Report/Documentation:

BibTeX citation key: Farhi2007a

E. Farhi, J. Goldstone, and S. Gutmann, “A Quantum Algorithm for the Hamiltonian NAND Tree,” arXiv, 2007.
Added by: D. L. Yonge-Mallo 2008-10-03 16:04:21 Last edited by: D. L. Yonge-Mallo 2008-10-09 05:51:38

Categories: Quantum computing
Keywords: algorithms
Creators: Farhi, Goldstone, Gutmann
Publisher: arXiv

Number of views: 33
Popularity index: 62.26%

Abstract

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.
Added by: D. L. Yonge-Mallo Last edited by: D. L. Yonge-Mallo

Further information may be found at:

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

Notes

ArXiv:quant-ph/0702144v2
Added by: D. L. Yonge-Mallo Last edited by: D. L. Yonge-Mallo

Wikindx

Bookmarks

Resources

Metadata

Help

Statistics

WIKINDX Resources