Discrete-query quantum algorithm for NAND trees

DOI10.4086/toc.2009.v005a005zbMath1213.68283arXivquant-ph/0702160OpenAlexW3103735887MaRDI QIDQ3002804

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

Publication date: 24 May 2011

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0702160

zbMATH Keywords

quantum computationquantum walkquantum query complexityformula evaluationHamiltonian simulation

Mathematics Subject Classification ID

Quantum computation (81P68) Eulerian and Hamiltonian graphs (05C45) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (8)

Challenges of adiabatic quantum evaluation of NAND trees ⋮ A strong direct product theorem for quantum query complexity ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ Intricacies of quantum computational paths ⋮ Quantum algorithm design: techniques and applications ⋮ Green's function approach for quantum graphs: an overview ⋮ Asymptotic behavior of quantum walks with spatio-temporal coin fluctuations ⋮ Disordered quantum walks in one lattice dimension

This page was built for publication: Discrete-query quantum algorithm for NAND trees