Structured Adiabatic Quantum Search

Simple item page
dc.creatorAhrensmeier, Daria
dc.creatorDas, Saurya
dc.creatorKobes, Randy
dc.creatorKunstatter, Gabor
dc.creatorZaraket, Haitham
dc.date2002-08-09
dc.date.accessioned2026-07-07T06:04:45Z
dc.date.available2026-07-07T06:04:45Z
dc.descriptionWe 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.
dc.description12 pages, no figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0208065
dc.identifierhttp://arxiv.org/abs/quant-ph/0208065
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90411
dc.subjectQuantum Physics
dc.subjectHigh Energy Physics - Theory
dc.titleStructured Adiabatic Quantum Search
dc.typetext

Files

Collections

arXiv