Robustness of adiabatic quantum computation

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
11 pages, 5 figures, REVTeX

Keywords

Quantum Physics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/89645

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/quant-ph/0108048
 http://arxiv.org/abs/quant-ph/0108048
 Phys.Rev. A65 (2002) 012322
 doi:10.1103/PhysRevA.65.012322

Collections

arXiv