Local adiabatic quantum search with different paths
We 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 si...
Saved in:
Main Authors: | , , |
---|---|
Format: | Journal Article |
Language: | English |
Published: |
28-09-2003
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We 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. |
---|---|
DOI: | 10.48550/arxiv.quant-ph/0309201 |