Robustness of adiabatic quantum computation

Andrew M. Childs; Edward Farhi; John Preskill

Robustness of adiabatic quantum computation

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0108048 v1 pith:2NTZGDIU submitted 2001-08-09 quant-ph

Andrew M. Childs , Edward Farhi , John Preskill This is my paper · ORCID

classification quant-ph

keywords adiabaticcomputationquantumrobustnessalgorithmerrorscombinatorialcontrol

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Asymptotic errors in adiabatic evolution
quant-ph 2025-01 conditional novelty 5.0 of 10

For slow adiabatic evolution, the time-averaged typical error scales as a power law and depends only on the endpoints of the Hamiltonian path.

Pith tools