Complete Adiabatic Quantum Search in Unsorted Databases

Simple item page
dc.creatorXu, Nanyang
dc.creatorPeng, Xinhua
dc.creatorShi, Mingjun
dc.creatorDu, Jiangfeng
dc.date2008-11-05
dc.date.accessioned2026-07-07T10:15:39Z
dc.date.available2026-07-07T10:15:39Z
dc.descriptionWe propose a new adiabatic algorithm for the unsorted database search problem. This algorithm saves two thirds of qubits than Grover's algorithm in realizations. Meanwhile, we analyze the time complexity of the algorithm by both perturbative method and numerical simulation. The results show it provides a better speedup than the previous adiabatic search algorithm.
dc.identifierhttps://arxiv.org/abs/0811.0663
dc.identifierhttp://arxiv.org/abs/0811.0663
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173239
dc.subjectQuantum Physics
dc.titleComplete Adiabatic Quantum Search in Unsorted Databases
dc.typetext

Files

Collections

arXiv