Structured Adiabatic Quantum Search
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
We examine the use of adiabatic quantum algorithms to solve structured, or nested, search problems. We construct suitable time dependent Hamiltonians and derive the computation times for a general class of nested searches involving n qubits. As expected, we find that as additional structure is included, the Hamiltonians become more local and the computation times decrease.
12 pages, no figures
12 pages, no figures