2005
DOI: 10.1103/physreva.72.042317
|View full text |Cite
|
Sign up to set email alerts
|

Quantum adiabatic search with decoherence in the instantaneous energy eigenbasis

Abstract: In Phys. Rev. A 71, 060312(R) (2005) the robustness of the local adiabatic quantum search to decoherence in the instantaneous eigenbasis of the search Hamiltonian was examined. We expand this analysis to include the case of the global adiabatic quantum search. As in the case of the local search the asymptotic time complexity for the global search is the same as for the ideal closed case, as long as the Hamiltonian dynamics is present. In the case of pure decoherence, where the environment monitors the search H… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
27
0
2

Year Published

2010
2010
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 35 publications
(29 citation statements)
references
References 19 publications
0
27
0
2
Order By: Relevance
“…In particular, we may consider monitoring the populations of the adiabatic levels or of the diabatic levels, with possibly different consequences on the ensuing time evolution. Such selective observation characterizes recently studied models of adiabatic quantum computing [25][26][27][28]. This distinction may come up in specific experimental situations.…”
Section: Introductionmentioning
confidence: 87%
“…In particular, we may consider monitoring the populations of the adiabatic levels or of the diabatic levels, with possibly different consequences on the ensuing time evolution. Such selective observation characterizes recently studied models of adiabatic quantum computing [25][26][27][28]. This distinction may come up in specific experimental situations.…”
Section: Introductionmentioning
confidence: 87%
“…In this Letter, we study the effect of an environment on the adiabatic quantum search (AQS) algorithm [3,15], the adiabatic equivalent of Grover's algorithm [16]. While the AQS algorithm in open systems has been the subject of numerous studies, a complete understanding of its scalability is missing [14,[17][18][19][20][21][22][23][24][25].…”
mentioning
confidence: 99%
“…In the closed system setting, starting in the ground state of H(0) and evolving adiabatically, the system is guaranteed to reach the ground state of H I with high probability [15][16][17]. Although adiabatic dynamics is robust against certain forms of decoherence appearing in the more realistic open system setting [10,[18][19][20][21][22][23], it remains susceptible to thermal noise and specification errors [24], which can jeopardize the efficiency of the quantum computation. Therefore, any scalable quantum annealing architecture will require quantum error correction [25].…”
Section: Introductionmentioning
confidence: 99%