Structured Adiabatic Quantum Search
classification
🪐 quant-ph
hep-th
keywords
adiabaticcomputationhamiltoniansnestedquantumsearchstructuredtimes
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.