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

arXiv:1408.4382 · Physical Review A

Quantum annealing correction for random Ising problems

Kristen L. Pudenz, Tameem Albash, Daniel A. Lidar

Published Apr 2, 2015• 102 citations
arXivHTMLPDF

Abstract

We demonstrate that the performance of a quantum annealer on hard random Ising optimization problems can be substantially improved using quantum annealing correction (QAC). Our error correction strategy is tailored to the D-Wave Two device. We find that QAC provides a statistically significant enhancement in the performance of the device over a classical repetition code, improving as a function of problem size as well as hardness. Moreover, QAC provides a mechanism for overcoming the precision limit of the device, in addition to correcting calibration errors. Performance is robust even to missing qubits. We present evidence for a constructive role played by quantum effects in our experiments by contrasting the experimental results with the predictions of a classical model of the device. Our work demonstrates the importance of error correction in appropriately determining the performance of quantum annealers.

DOI
10.1103/physreva.91.042302

Related papers

Mean Field Quantum Annealing Correction

Shunji Matsuura

In this review, how quantum annealing correction works is described from the statistical physics point of view. Quantum annealing correction (QAC) is a programmable error correction scheme in quantum annealing. It is designed to suppress errors by imposing energy penalties. There have been various experimental tests on D-wave machines demonstrating that QAC significantly improves the success probabilities of finding ground states of Ising models. We analyze QAC in the ferromagnetic and Hopfield models by using the mean field theory. The results of our analyses show that QAC efficiently suppresses the thermal fluctuations. In addition, it can significantly increase the energy gap during annealing by changing the energy penalties. In some instances, exponentially small energy gaps turn into polynomially small energy gaps. This suggests that QAC can drastically improve the computational efficiency.

Journal of the Physical Society of Japan•Mar 1, 2019•2 citations

Frustration-enhanced quantum annealing correction models with additional inter-replica interactions

Anonymous, Shu Tanaka

Quantum annealing correction (QAC) models provide a promising approach for mitigating errors in quantum annealers. Previous studies have established that QAC models are crucial for ensuring the robustness of the ground state of the Ising model on hardware. In this work, the effects of QAC models incorporating replicas with additional interactions, specifically, the and the , are investigated for problems characterized by a small energy gap between the ground and first excited states during quantum annealing, a well-known bottleneck to reaching the ground state. The results demonstrate that these QAC models can obtain the optimal solution within short annealing times by exploiting diabatic transitions, even for problems with a small energy gap. These findings highlight the potential of QAC models as practical near-term algorithms for hardware subject to runtime limitations and control noise.

arXiv:2509.11217•Physical Review A•Aug 14, 2026•2 citations

Analog errors in quantum annealing: doom and hope

Adam Pearson, Anurag Mishra, Itay Hen +1 more

Abstract Quantum annealing has the potential to provide a speedup over classical algorithms in solving optimization problems. Just as for any other quantum device, suppressing Hamiltonian control errors will be necessary before quantum annealers can achieve speedups. Such analog control errors are known to lead to $$J$$ J -chaos, wherein the probability of obtaining the optimal solution, encoded as the ground state of the intended Hamiltonian, varies widely depending on the control error. Here, we show that $$J$$ J -chaos causes a catastrophic failure of quantum annealing, in that the scaling of the time-to-solution metric becomes worse than that of a deterministic (exhaustive) classical solver. We demonstrate this empirically using random Ising spin glass problems run on the two latest generations of the D-Wave quantum annealers. We then proceed to show that this doomsday scenario can be mitigated using a simple error suppression and correction scheme known as quantum annealing correction (QAC). By using QAC, the time-to-solution scaling of the same D-Wave devices is improved to below that of the classical upper bound, thus restoring hope in the speedup prospects of quantum annealing.

arXiv:1907.12678•npj Quantum Information•Nov 28, 2019•84 citations

Mean field analysis of quantum error correction

秀稔 西森, Hidetoshi Nishimori, Shunji Matsuura +2 more

Quantum annealing correction (QAC) is a method that combines encoding with energy penalties and decoding to suppress and correct errors that degrade the performance of quantum annealers in solving optimization problems. While QAC has been experimentally demonstrated to successfully error correct a range of optimization problems, a clear understanding of its operating mechanism has been lacking. Here we bridge this gap using tools from quantum statistical mechanics. We study analytically tractable models using a mean-field analysis, specifically the p-body ferromagnetic infinite-range transverse-field Ising model as well as the quantum Hopfield model. We demonstrate that for p ¼ 2, where the phase transition is of second order, QAC pushes the transition to increasingly larger transverse field strengths. For p ≥ 3, where the phase transition is of first order, QAC softens the closing of the gap for small energy penalty values and prevents its closure for sufficiently large energy penalty values. Thus QAC provides protection from excitations that occur near the quantum critical point. We find similar results for the Hopfield model, thus demonstrating that our conclusions hold in the presence of disorder

•Jun 1, 2016•0 citations

Quantum-annealing correction at finite temperature: Ferromagnetic p -spin models

Shunji Matsuura, Hidetoshi Nishimori, Walter Vinci +2 more

The performance of open-system quantum annealing is adversely affected by thermal excitations out of the ground state. While the presence of energy gaps between the ground and excited states suppresses such excitations, error correction techniques are required to ensure full scalability of quantum annealing. Quantum annealing correction (QAC) is a method that aims to improve the performance of quantum annealers when control over only the problem (final) Hamiltonian is possible, along with decoding. Building on our earlier work [S. Matsuura et al., Phys. Rev. Lett. 116, 220501 (2016)], we study QAC using analytical tools of statistical physics by considering the effects of temperature and a transverse field on the penalty qubits in the ferromagnetic $p$-body infinite-range transverse-field Ising model. We analyze the effect of QAC on second ($p=2$) and first ($p\ensuremath{\ge}3$) order phase transitions, and construct the phase diagram as a function of temperature and penalty strength. Our analysis reveals that for sufficiently low temperatures and in the absence of a transverse field on the penalty qubit, QAC breaks up a single, large free-energy barrier into multiple smaller ones. We find theoretical evidence for an optimal penalty strength in the case of a transverse field on the penalty qubit, a feature observed in QAC experiments. Our results provide further compelling evidence that QAC provides an advantage over unencoded quantum annealing.

arXiv:1610.09535•Physical Review A•Feb 7, 2017•40 citations

Quantum annealing correction with minor embedding

Walter Vinci, Tameem Albash, Gerardo A. Paz-Silva +2 more

Quantum annealing provides a promising route for the development of quantum optimization devices, but the usefulness of such devices will be limited in part by the range of implementable problems as dictated by hardware constraints. To overcome constraints imposed by restricted connectivity between qubits, a larger set of interactions can be approximated using minor embedding techniques whereby several physical qubits are used to represent a single logical qubit. However, minor embedding introduces new types of errors due to its approximate nature. We introduce and study quantum annealing correction schemes designed to improve the performance of quantum annealers in conjunction with minor embedding, thus leading to a hybrid scheme defined over an encoded graph. We argue that this scheme can be efficiently decoded using an energy minimization technique provided the density of errors does not exceed the per-site percolation threshold of the encoded graph. We test the hybrid scheme using a D-Wave Two processor on problems for which the encoded graph is a two-level grid and the Ising model is known to be NP-hard. The problems we consider are frustrated Ising model problem instances with ``planted'' (a priori known) solutions. Applied in conjunction with optimized energy penalties and decoding techniques, we find that this approach enables the quantum annealer to solve minor embedded instances with significantly higher success probability than it would without error correction. Our work demonstrates that quantum annealing correction can and should be used to improve the robustness of quantum annealing not only for natively embeddable problems but also when minor embedding is used to extend the connectivity of physical devices.

arXiv:1507.02658•Physical Review A•Oct 9, 2015•102 citations
We demonstrate that the performance of a quantum annealer on hard random Ising optimization problems can be substantially improved using quantum annealing correction (QAC). Our error correction strategy is tailored to the D-Wave Two device. We find that QAC provides a statistically significant enhancement in the performance of the device over a classical repetition code, improving as a function of problem size as well as hardness. Moreover, QAC provides a mechanism for overcoming the precision limit of the device, in addition to correcting calibration errors. Performance is robust even to missing qubits. We present evidence for a constructive role played by quantum effects in our experiments by contrasting the experimental results with the predictions of a classical model of the device. Our work demonstrates the importance of error correction in appropriately determining the performance of quantum annealers.
In this review, how quantum annealing correction works is described from the statistical physics point of view. Quantum annealing correction (QAC) is a programmable error correction scheme in quantum annealing. It is designed to suppress errors by imposing energy penalties. There have been various experimental tests on D-wave machines demonstrating that QAC significantly improves the success probabilities of finding ground states of Ising models. We analyze QAC in the ferromagnetic and Hopfield models by using the mean field theory. The results of our analyses show that QAC efficiently suppresses the thermal fluctuations. In addition, it can significantly increase the energy gap during annealing by changing the energy penalties. In some instances, exponentially small energy gaps turn into polynomially small energy gaps. This suggests that QAC can drastically improve the computational efficiency.
Quantum annealing correction (QAC) models provide a promising approach for mitigating errors in quantum annealers. Previous studies have established that QAC models are crucial for ensuring the robustness of the ground state of the Ising model on hardware. In this work, the effects of QAC models incorporating replicas with additional interactions, specifically, the and the , are investigated for problems characterized by a small energy gap between the ground and first excited states during quantum annealing, a well-known bottleneck to reaching the ground state. The results demonstrate that these QAC models can obtain the optimal solution within short annealing times by exploiting diabatic transitions, even for problems with a small energy gap. These findings highlight the potential of QAC models as practical near-term algorithms for hardware subject to runtime limitations and control noise.
Abstract Quantum annealing has the potential to provide a speedup over classical algorithms in solving optimization problems. Just as for any other quantum device, suppressing Hamiltonian control errors will be necessary before quantum annealers can achieve speedups. Such analog control errors are known to lead to JJJ J -chaos, wherein the probability of obtaining the optimal solution, encoded as the ground state of the intended Hamiltonian, varies widely depending on the control error. Here, we show that JJJ J -chaos causes a catastrophic failure of quantum annealing, in that the scaling of the time-to-solution metric becomes worse than that of a deterministic (exhaustive) classical solver. We demonstrate this empirically using random Ising spin glass problems run on the two latest generations of the D-Wave quantum annealers. We then proceed to show that this doomsday scenario can be mitigated using a simple error suppression and correction scheme known as quantum annealing correction (QAC). By using QAC, the time-to-solution scaling of the same D-Wave devices is improved to below that of the classical upper bound, thus restoring hope in the speedup prospects of quantum annealing.
Quantum annealing correction (QAC) is a method that combines encoding with energy penalties and decoding to suppress and correct errors that degrade the performance of quantum annealers in solving optimization problems. While QAC has been experimentally demonstrated to successfully error correct a range of optimization problems, a clear understanding of its operating mechanism has been lacking. Here we bridge this gap using tools from quantum statistical mechanics. We study analytically tractable models using a mean-field analysis, specifically the p-body ferromagnetic infinite-range transverse-field Ising model as well as the quantum Hopfield model. We demonstrate that for p ¼ 2, where the phase transition is of second order, QAC pushes the transition to increasingly larger transverse field strengths. For p ≥ 3, where the phase transition is of first order, QAC softens the closing of the gap for small energy penalty values and prevents its closure for sufficiently large energy penalty values. Thus QAC provides protection from excitations that occur near the quantum critical point. We find similar results for the Hopfield model, thus demonstrating that our conclusions hold in the presence of disorder
The performance of open-system quantum annealing is adversely affected by thermal excitations out of the ground state. While the presence of energy gaps between the ground and excited states suppresses such excitations, error correction techniques are required to ensure full scalability of quantum annealing. Quantum annealing correction (QAC) is a method that aims to improve the performance of quantum annealers when control over only the problem (final) Hamiltonian is possible, along with decoding. Building on our earlier work [S. Matsuura et al., Phys. Rev. Lett. 116, 220501 (2016)], we study QAC using analytical tools of statistical physics by considering the effects of temperature and a transverse field on the penalty qubits in the ferromagnetic ppp-body infinite-range transverse-field Ising model. We analyze the effect of QAC on second (p=2p=2p=2) and first ($p\ensuremath{\ge}3$) order phase transitions, and construct the phase diagram as a function of temperature and penalty strength. Our analysis reveals that for sufficiently low temperatures and in the absence of a transverse field on the penalty qubit, QAC breaks up a single, large free-energy barrier into multiple smaller ones. We find theoretical evidence for an optimal penalty strength in the case of a transverse field on the penalty qubit, a feature observed in QAC experiments. Our results provide further compelling evidence that QAC provides an advantage over unencoded quantum annealing.
Quantum annealing provides a promising route for the development of quantum optimization devices, but the usefulness of such devices will be limited in part by the range of implementable problems as dictated by hardware constraints. To overcome constraints imposed by restricted connectivity between qubits, a larger set of interactions can be approximated using minor embedding techniques whereby several physical qubits are used to represent a single logical qubit. However, minor embedding introduces new types of errors due to its approximate nature. We introduce and study quantum annealing correction schemes designed to improve the performance of quantum annealers in conjunction with minor embedding, thus leading to a hybrid scheme defined over an encoded graph. We argue that this scheme can be efficiently decoded using an energy minimization technique provided the density of errors does not exceed the per-site percolation threshold of the encoded graph. We test the hybrid scheme using a D-Wave Two processor on problems for which the encoded graph is a two-level grid and the Ising model is known to be NP-hard. The problems we consider are frustrated Ising model problem instances with ``planted'' (a priori known) solutions. Applied in conjunction with optimized energy penalties and decoding techniques, we find that this approach enables the quantum annealer to solve minor embedded instances with significantly higher success probability than it would without error correction. Our work demonstrates that quantum annealing correction can and should be used to improve the robustness of quantum annealing not only for natively embeddable problems but also when minor embedding is used to extend the connectivity of physical devices.