Local adiabatic quantum search with different paths

Simple item page
dc.creatorEryigit, Recep
dc.creatorGunduc, Yigit
dc.creatorEryigit, Resul
dc.date2003-09-28
dc.date2004-08-16
dc.date.accessioned2026-07-07T06:07:56Z
dc.date.available2026-07-07T06:07:56Z
dc.descriptionWe report on a detailed analysis of generalization of the local adiabatic search algorithm. Instead of evolving directly from an initial ground state Hamiltonian to a solution Hamiltonian a different evolution path is introduced and is shown that the time required to find an item in a database of size $N$ can be made to be independent of the size of the database by modifying the Hamiltonian used to evolve the system.
dc.description8 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0309201
dc.identifierhttp://arxiv.org/abs/quant-ph/0309201
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91471
dc.subjectQuantum Physics
dc.titleLocal adiabatic quantum search with different paths
dc.typetext

Files

Collections

arXiv