For slow adiabatic evolution, the time-averaged typical error scales as a power law and depends only on the endpoints of the Hamiltonian path.
Robustness of adiabatic quantum computation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm.
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Asymptotic errors in adiabatic evolution
For slow adiabatic evolution, the time-averaged typical error scales as a power law and depends only on the endpoints of the Hamiltonian path.