Robustness of adiabatic quantum computation

Simple item page
dc.creatorChilds, Andrew M.
dc.creatorFarhi, Edward
dc.creatorPreskill, John
dc.date2001-08-09
dc.date.accessioned2026-07-07T06:02:33Z
dc.date.available2026-07-07T06:02:33Z
dc.descriptionWe 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.
dc.description11 pages, 5 figures, REVTeX
dc.identifierhttps://arxiv.org/abs/quant-ph/0108048
dc.identifierhttp://arxiv.org/abs/quant-ph/0108048
dc.identifierPhys.Rev. A65 (2002) 012322
dc.identifierdoi:10.1103/PhysRevA.65.012322
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89645
dc.subjectQuantum Physics
dc.titleRobustness of adiabatic quantum computation
dc.typetext

Files

Collections

arXiv