Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Fault Tolerant Adiabatic Quantum Computation

Daniel A. Lidar

Published Jul 2, 2007• 0 citations
OpenAlex

Related papers

Fault Tolerance in Adiabatic Quantum Computing.

Robin Blume-Kohout

•Feb 1, 2015•0 citations

Universal fault-tolerant adiabatic quantum computing with quantum dots or donors

Andrew J. Landahl

Bulletin of the American Physical Society•Mar 14, 2016•0 citations

Error Suppression and Error Correction in Adiabatic Quantum Computation: Techniques and Challenges

Kevin C. Young, Mohan Sarovar, Robin Blume-Kohout

Adiabatic quantum computing (AQC) has intrinsic robustness to noise, but whether it's fault-tolerant---robust to all forms of noise---has not been explored. While fault tolerance through error correction is theoretically achievable in standard quantum computing, scientists show that it may not be achievable in AQC.

arXiv:1307.5893•Physical Review X•Nov 13, 2013•86 citations

Fault-tolerant Quantum Computing

Yasunari Suzuki

The Journal of The Institute of Image Information and Television Engineers•Jan 1, 2022•0 citations

Towards Fault Tolerant Adiabatic Quantum Computation

Daniel A. Lidar

I show how to protect adiabatic quantum computation (AQC) against decoherence and certain control errors, using a hybrid methodology involving dynamical decoupling, subsystem and stabilizer codes, and energy gaps. Corresponding error bounds are derived. As an example, I show how to perform decoherence-protected AQC against local noise using at most two-body interactions.

arXiv:0707.0021•Physical Review Letters•Apr 25, 2008•132 citations

Fault-tolerant, Universal Adiabatic Quantum Computation

Ari Mizel

Quantum computation has revolutionary potential for speeding computational tasks such as factoring and simulating quantum systems, but the task of constructing a quantum computer is daunting. Adiabatic quantum computation and other ``hands-off approaches relieve the need for rapid, precise pulsing to control the system, inspiring at least one high-profile effort to realize a hands-off quantum computing device. But is hands-off incompatible with fault-tolerant? Concerted effort and many innovative ideas have not resolved this question but have instead deepened it, linking it to fundamental problems in quantum complexity theory. Here we present a hands-off approach that is provably (a) capable of scalable universal quantum computation in a non-degenerate ground state and (b) fault-tolerant against an analogue of the usual local stochastic fault model. A satisfying physical and numerical argument indicates that (c) it is also fault-tolerant against thermal excitation below a threshold temperature independent of the computation size.

•Mar 30, 2014•7 citations
Quantum computation has revolutionary potential for speeding computational tasks such as factoring and simulating quantum systems, but the task of constructing a quantum computer is daunting. Adiabatic quantum computation and other ``hands-off approaches relieve the need for rapid, precise pulsing to control the system, inspiring at least one high-profile effort to realize a hands-off quantum computing device. But is hands-off incompatible with fault-tolerant? Concerted effort and many innovative ideas have not resolved this question but have instead deepened it, linking it to fundamental problems in quantum complexity theory. Here we present a hands-off approach that is provably (a) capable of scalable universal quantum computation in a non-degenerate ground state and (b) fault-tolerant against an analogue of the usual local stochastic fault model. A satisfying physical and numerical argument indicates that (c) it is also fault-tolerant against thermal excitation below a threshold temperature independent of the computation size.