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:2409.20538 · Annals of Physics

Quantum annealing with chaotic driver Hamiltonians

Henning Schlömer, Subir Sachdev A

Published Apr 29, 2025• 4 citations
arXivHTMLPDF
DOI
10.1016/j.aop.2025.170042

Related papers

Catastrophic failure of quantum annealing owing to non-stoquastic Hamiltonian and its avoidance by decoherence

Takashi Imoto, Yuichiro Matsuzaki

Abstract Quantum annealing (QA) is a promising method for solving combinatorial optimization problems whose solutions are embedded into a ground state of the Ising Hamiltonian. This method employs two types of Hamiltonians, namely a driver Hamiltonian and a problem Hamiltonian. After a sufficiently slow change from the driver Hamiltonian to the problem Hamiltonian, the target ground state that corresponds to the solution can be obtained. The inclusion of non-stoquastic terms in the driver Hamiltonian is believed to enhance the efficiency of the QA. Meanwhile, decoherence is regarded as one of the main obstacles for QA. This paper presents examples to show that non- stoquastic Hamiltonians can lead to catastrophic failure of QA, whereas a certain decoherence process can be adopted to avoid such failure. More specifically, when anti-ferromagnetic interactions (i.e., typical non-stoquastic terms) are included in the Hamiltonian, the target ground state cannot be prepared even with an infinitely long annealing time for some specific cases. In the example presented herein, owing to a symmetry, the Hamiltonian is block-diagonalized, and a crossing occurs during the QA, which leads to a complete failure of the ground-state search. Moreover, it is shown that adding a certain type of decoherence can yield the ground state after QA for these cases. This is because, even when a symmetry exists in isolated quantum systems, the environment breaks the symmetry. In summary, the counter-intuitive results presented herein provide an insight into the fundamental mechanism of QA.

arXiv:2209.10983•Journal of Physics Communications•Nov 9, 2026•2 citations

Updates to Hybrid Quantum-Classical Annealing

Peter Schuhmacher, Aditi Misra, Salil Bedkihal +3 more

Bulletin of the American Physical Society•Mar 4, 2020•0 citations

Quantum annealing with parametrically driven nonlinear oscillators

Shruti Puri

Bulletin of the American Physical Society•Mar 13, 2017•0 citations

Experimental demonstration of perturbative anticrossing mitigation using nonuniform driver Hamiltonians

Trevor M. Lanting, Andrew D. King, Bram Evert +1 more

Perturbative anticrossings have long been identified as a potential computational bottleneck for quantum annealing. This bottleneck can appear, for example, when a uniform transverse driver Hamiltonian is applied to each qubit. Previous theoretical research sought to alleviate such anticrossings by adjusting the transverse driver Hamiltonians on individual qubits according to a perturbative approximation. Here we apply this principle to a physical implementation of quantum annealing in a D-Wave 2000Q system. We use samples from the quantum annealing hardware and per-qubit anneal offsets to produce nonuniform driver Hamiltonians. On small instances with severe perturbative anticrossings, our algorithm yields an increase in minimum eigengaps, ground-state success probabilities, and escape rates from metastable valleys. We also demonstrate that the same approach can mitigate biased sampling of degenerate ground states.

arXiv:1708.03049•Physical Review A•Oct 16, 2017•44 citations

Ground-State Sampling Correspondence between Penalty-Based and Constrained Quantum Annealing

Shunta Ide, Shu Tanaka

Quantum annealing generally samples degenerate ground states with nonuniform probabilities. This unfair sampling depends on how the driver Hamiltonian couples these states near the end of annealing. For combinatorial optimization problems with a cardinality constraint, the penalty method and constrained quantum annealing (CQA) differ in these couplings. The transverse-field driver of the penalty method does not directly couple feasible ground states, whereas the fully connected XY driver of CQA couples pairs of them related by a single spin exchange. We investigate how this difference affects ground-state sampling, using closed-system simulations of random graph bipartitioning instances together with degenerate perturbation theory. For the instances studied, the conditional ground-state distribution of penalty-based quantum annealing approaches that of CQA at sufficiently large penalties and long annealing times. This convergence can be explained by the effective Hamiltonian of penalty-based quantum annealing, in which virtual single-spin flips to infeasible states generate a second-order interaction proportional to the CQA driver projected onto the feasible ground-state manifold, which is the leading term of the effective Hamiltonian of CQA. In the numerical simulations, the Jensen--Shannon divergence between the conditional ground-state distributions of penalty-based quantum annealing and CQA decreases approximately as the inverse square of the penalty-to-objective energy ratio, consistent with the perturbative analysis. This correspondence between the effective Hamiltonians extends to equal-weight fixed-magnetization constraints under the same perturbative conditions, providing a common mechanism for sampling bias in the two implementations.

quant-pharXiv:2610.26687•Oct 20, 2026•0 citations

Uncertain fate of fair sampling in quantum annealing

Mario S. Könz, Guglielmo Mazzola, Andrew J. Ochoa +2 more

Recently, it was demonstrated both theoretically and experimentally on the D-Wave quantum annealer that transverse-field quantum annealing does not find all ground states with equal probability. In particular, it was proposed that more complex driver Hamiltonians beyond transverse fields might mitigate this shortcoming. Here, we investigate the mechanisms of (un)fair sampling in quantum annealing. While higher-order terms can improve the sampling for selected small problems, we present multiple counterexamples where driver Hamiltonians that go beyond transverse fields do not remove the sampling bias. Using perturbation theory we explain why this is the case. In addition, we present large-scale quantum Monte Carlo simulations for spin glasses with known degeneracy in two space dimensions and demonstrate that the fair-sampling performance of quadratic driver terms is comparable to standard transverse-field drivers. Our results suggest that quantum annealing machines are not well suited for sampling applications, unless postprocessing techniques to improve the sampling are applied.

arXiv:1806.06081•Physical Review A•Sep 20, 2019•52 citations
Abstract Quantum annealing (QA) is a promising method for solving combinatorial optimization problems whose solutions are embedded into a ground state of the Ising Hamiltonian. This method employs two types of Hamiltonians, namely a driver Hamiltonian and a problem Hamiltonian. After a sufficiently slow change from the driver Hamiltonian to the problem Hamiltonian, the target ground state that corresponds to the solution can be obtained. The inclusion of non-stoquastic terms in the driver Hamiltonian is believed to enhance the efficiency of the QA. Meanwhile, decoherence is regarded as one of the main obstacles for QA. This paper presents examples to show that non- stoquastic Hamiltonians can lead to catastrophic failure of QA, whereas a certain decoherence process can be adopted to avoid such failure. More specifically, when anti-ferromagnetic interactions (i.e., typical non-stoquastic terms) are included in the Hamiltonian, the target ground state cannot be prepared even with an infinitely long annealing time for some specific cases. In the example presented herein, owing to a symmetry, the Hamiltonian is block-diagonalized, and a crossing occurs during the QA, which leads to a complete failure of the ground-state search. Moreover, it is shown that adding a certain type of decoherence can yield the ground state after QA for these cases. This is because, even when a symmetry exists in isolated quantum systems, the environment breaks the symmetry. In summary, the counter-intuitive results presented herein provide an insight into the fundamental mechanism of QA.
Perturbative anticrossings have long been identified as a potential computational bottleneck for quantum annealing. This bottleneck can appear, for example, when a uniform transverse driver Hamiltonian is applied to each qubit. Previous theoretical research sought to alleviate such anticrossings by adjusting the transverse driver Hamiltonians on individual qubits according to a perturbative approximation. Here we apply this principle to a physical implementation of quantum annealing in a D-Wave 2000Q system. We use samples from the quantum annealing hardware and per-qubit anneal offsets to produce nonuniform driver Hamiltonians. On small instances with severe perturbative anticrossings, our algorithm yields an increase in minimum eigengaps, ground-state success probabilities, and escape rates from metastable valleys. We also demonstrate that the same approach can mitigate biased sampling of degenerate ground states.
Quantum annealing generally samples degenerate ground states with nonuniform probabilities. This unfair sampling depends on how the driver Hamiltonian couples these states near the end of annealing. For combinatorial optimization problems with a cardinality constraint, the penalty method and constrained quantum annealing (CQA) differ in these couplings. The transverse-field driver of the penalty method does not directly couple feasible ground states, whereas the fully connected XY driver of CQA couples pairs of them related by a single spin exchange. We investigate how this difference affects ground-state sampling, using closed-system simulations of random graph bipartitioning instances together with degenerate perturbation theory. For the instances studied, the conditional ground-state distribution of penalty-based quantum annealing approaches that of CQA at sufficiently large penalties and long annealing times. This convergence can be explained by the effective Hamiltonian of penalty-based quantum annealing, in which virtual single-spin flips to infeasible states generate a second-order interaction proportional to the CQA driver projected onto the feasible ground-state manifold, which is the leading term of the effective Hamiltonian of CQA. In the numerical simulations, the Jensen--Shannon divergence between the conditional ground-state distributions of penalty-based quantum annealing and CQA decreases approximately as the inverse square of the penalty-to-objective energy ratio, consistent with the perturbative analysis. This correspondence between the effective Hamiltonians extends to equal-weight fixed-magnetization constraints under the same perturbative conditions, providing a common mechanism for sampling bias in the two implementations.
Recently, it was demonstrated both theoretically and experimentally on the D-Wave quantum annealer that transverse-field quantum annealing does not find all ground states with equal probability. In particular, it was proposed that more complex driver Hamiltonians beyond transverse fields might mitigate this shortcoming. Here, we investigate the mechanisms of (un)fair sampling in quantum annealing. While higher-order terms can improve the sampling for selected small problems, we present multiple counterexamples where driver Hamiltonians that go beyond transverse fields do not remove the sampling bias. Using perturbation theory we explain why this is the case. In addition, we present large-scale quantum Monte Carlo simulations for spin glasses with known degeneracy in two space dimensions and demonstrate that the fair-sampling performance of quadratic driver terms is comparable to standard transverse-field drivers. Our results suggest that quantum annealing machines are not well suited for sampling applications, unless postprocessing techniques to improve the sampling are applied.