Rapid Data Search using Adiabatic Quantum Computation

Simple item page
dc.creatorAhrensmeier, Daria
dc.creatorDas, Saurya
dc.creatorKobes, Randy
dc.creatorKunstatter, Gabor
dc.creatorZaraket, Haitham
dc.date2002-08-15
dc.date.accessioned2026-07-07T06:04:47Z
dc.date.available2026-07-07T06:04:47Z
dc.descriptionWe show that by a suitable choice of time-dependent Hamiltonian, the search for a marked item in an unstructured database can be achieved in unit time, using Adiabatic Quantum Computation. This is a considerable improvement over the O(sqrt(N)) time required in previous algorithms. The trade-off is that in the intermediate stages of the computation process, the ground state energy of the computer increases to a maximum of O(sqrt(N)), before returning to zero at the end of the process.
dc.descriptionTo appear in proceedings of 6th International Conference on Quantum Communication, Measurement and Computing, M.I.T., July 22-26, 2002. 4 Pages, uses Rinton-P9x6.cls
dc.identifierhttps://arxiv.org/abs/quant-ph/0208107
dc.identifierhttp://arxiv.org/abs/quant-ph/0208107
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90425
dc.subjectQuantum Physics
dc.subjectHigh Energy Physics - Theory
dc.titleRapid Data Search using Adiabatic Quantum Computation
dc.typetext

Files

Collections

arXiv