A quantum search algorithm based on partial adiabatic evolution
This paper presents and implements a specified partial adiabatic search algorithm on a quantum circuit. It studies the minimum energy gap between the first excited state and the ground state of the system Hamiltonian and it finds that, in the case of M = 1, the algorithm has the same performance as...
Saved in:
Published in | Chinese physics B Vol. 20; no. 4; pp. 76 - 79 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
IOP Publishing
01.04.2011
|
Subjects | |
Online Access | Get full text |
ISSN | 1674-1056 2058-3834 |
DOI | 10.1088/1674-1056/20/4/040309 |
Cover
Summary: | This paper presents and implements a specified partial adiabatic search algorithm on a quantum circuit. It studies the minimum energy gap between the first excited state and the ground state of the system Hamiltonian and it finds that, in the case of M = 1, the algorithm has the same performance as the local adiabatic algorithm. However, the algorithm evolves globally only within a small interval, which implies that it keeps the advantages of global adiabatic algorithms without losing the speedup of the local adiabatic search algorithm. |
---|---|
Bibliography: | O413.1 TP301.6 11-5639/O4 quantum search, adiabatic evolution, quantum circuit |
ISSN: | 1674-1056 2058-3834 |
DOI: | 10.1088/1674-1056/20/4/040309 |