English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/9114
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Nonadiabatic quantum search algorithms

AuthorsPérez Cañellas, Armando ; Romanelli, Alejandro
Keywords[PACS] Quantum computation
[PACS] Semiclassical methods in quantum chaos
[PACS] Localization effects (metals/alloys) including Anderson or weak localization
Issue Date20-Nov-2007
PublisherAmerican Physical Society
CitationPhysical Review A 76(5): 052318 (2007)
AbstractWe present two continuous-time quantum search algorithms similar to the adiabatic search algorithm, but now without the requirement of adiabatic evolution. Both algorithms can find the marked state in a time proportional to sqrt(N). The behavior of the first algorithm is, essentially, similar to Grover's algorithm, but the second model possesses the important property that one does not need to single out a given time in order to find the searched state. After a well-defined transition time, this second algorithm will converge towards the marked state with a high probability, provided the parameters of the Hamiltonian are chosen appropriately. This convergence shows a resemblance to quantum search algorithms with a fixed point [L. K. Grover, Phys. Rev. Lett. 95, 150501 (2005)].
Description7 pages, 4 figures.-- PACS nrs.: 03.67.Lx, 05.45.Mt, 72.15.Rn.-- ISI Article Identifier: 000251326400049.-- ArXiv pre-print available at: http://arxiv.org/abs/0706.1139
Publisher version (URL)http://dx.doi.org/10.1103/PhysRevA.76.052318
Appears in Collections:(IFIC) Artículos
Files in This Item:
File Description SizeFormat 
Perez_PRA76_052318.pdf434,12 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.