Robustness of adiabatic quantum computation
classification
🪐 quant-ph
keywords
adiabaticcomputationquantumrobustnessalgorithmerrorscombinatorialcontrol
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.