Robustness of adiabatic quantum computation
量子物理
2007-05-23 v1
摘要
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.
引用
@article{arxiv.quant-ph/0108048,
title = {Robustness of adiabatic quantum computation},
author = {Andrew M. Childs and Edward Farhi and John Preskill},
journal= {arXiv preprint arXiv:quant-ph/0108048},
year = {2007}
}
备注
11 pages, 5 figures, REVTeX