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:2111.07560 · Physical Review Applied

Breakdown of the Weak-Coupling Limit in Quantum Annealing

Yuki Bando, Ka-Wa Yip, Huo Chen, Daniel A. Lidar, Hidetoshi Nishimori

Published May 20, 2022• 18 citations
arXivHTMLPDF

Abstract

Reverse annealing is a variant of quantum annealing, in which the system is prepared in a classical state, reverse annealed to an inversion point, and then forward annealed. We report on reverse annealing experiments using the D-Wave 2000Q device, with a focus on the p=2p -spin problem, which undergoes a second-order quantum phase transition with a gap that closes polynomially in the number of spins. We concentrate on the total and partial success probabilities, with the latter being the probabilities of finding each of two degenerate ground states of all spins up or all spins down, and the former being their sum. The empirical partial success probabilities exhibit a strong asymmetry between the two degenerate ground states, depending on the initial state of the reverse anneal. To explain these results, we perform open-system simulations using master equations in the limits of weak and strong coupling to the bath. The former, known as the adiabatic master equation, with decoherence in the instantaneous energy eigenbasis, predicts perfect symmetry between the two degenerate ground states, thus failing to agree with the experiment. In contrast, the latter, known as the polaron transformed Redfield equation, is in close agreement with experiment. Thus, our results present a challenge to the sufficiency of the weak system-bath coupling limit in describing the dynamics of current experimental quantum annealers, at least for reverse annealing on timescales of a microsecond or longer.

DOI
10.1103/physrevapplied.17.054033

Related papers

Reverse quantum annealing of the p -spin model with relaxation

Gianluca Passarelli, Ka-Wa Yip, Daniel A. Lidar +2 more

In reverse quantum annealing, the initial state is an eigenstate of the final problem Hamiltonian and the transverse field is cycled rather than strictly decreased as in standard (forward) quantum annealing. We present a numerical study of the reverse quantum annealing protocol applied to the $p$-spin model ($p=3$), including pausing, in an open-system setting accounting for dephasing in the energy eigenbasis, which results in thermal relaxation. We consider both independent and collective dephasing and demonstrate that in both cases the open-system dynamics substantially enhances the performance of reverse annealing. Namely, including dephasing overcomes the failure of purely closed-system reverse annealing to converge to the ground state of the $p$-spin model. We demonstrate that pausing further improves the success probability. The collective dephasing model leads to somewhat better performance than independent dephasing. The protocol we consider corresponds closely to the one implemented in the current generation of commercial quantum annealers, and our results help to explain why recent experiments demonstrated enhanced success probabilities under reverse annealing and pausing.

arXiv:1911.07186•Physical Review A•Feb 25, 2020•58 citations

Adiabatic reverse annealing is robust to low-temperature decoherence

An Le, Christopher L. Baldwin

Adiabatic reverse annealing (ARA) is an improvement to conventional quantum annealing (QA) that uses an initial guess at the desired ground state to circumvent problematic phase transitions. Despite encouraging results in the closed-system setting, Ref. [1] has suggested on the basis of numerical simulations that ARA may lose its advantage in the presence of decoherence. Here, we revisit this problem from a more analytical perspective. Using the $p$-spin model as a solvable example, together with the adiabatic master equation to describe the effects of the environment (valid at weak coupling), we show that ARA can in fact succeed in open systems but that the temperature of the environment plays a key role. We first demonstrate that, in the adiabatic limit, the system will follow the instantaneous equilibrium state as long as the protocol does not pass through any (finite-temperature) phase transitions. Given this, there are two distinct mechanisms by which ARA can break down at high temperature: either there are no paths that avoid transitions, or the equilibrium state itself is disordered. When the temperature is sufficiently low that neither of these occur, then ARA succeeds. Remarkably, there are even situations in which the environment benefits ARA: we find parameter values for which no transition-avoiding paths exist at zero temperature but such paths appear at non-zero temperature.

quant-pharXiv:2511.16735•Physical Review A•Nov 24, 2025•1 citation

Decoherence in adiabatic quantum computation

Tameem Albash, Daniel A. Lidar

Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of the evolution can survive over the long time scales used for quantum annealing relative to standard measures of the decoherence time. We reconsider the role of decoherence in adiabatic quantum computation and quantum annealing using the adiabatic quantum master-equation formalism. We restrict ourselves to the weak-coupling and singular-coupling limits, which correspond to decoherence in the energy eigenbasis and in the computational basis, respectively. We demonstrate that decoherence in the instantaneous energy eigenbasis does not necessarily detrimentally affect adiabatic quantum computation, and in particular that a short single-qubit ${T}_{2}$ time need not imply adverse consequences for the success of the quantum adiabatic algorithm. We further demonstrate that boundary cancellation methods, designed to improve the fidelity of adiabatic quantum computing in the closed-system setting, remain beneficial in the open-system setting. To address the high computational cost of master-equation simulations, we also demonstrate that a quantum Monte Carlo algorithm that explicitly accounts for a thermal bosonic bath can be used to interpolate between classical and quantum annealing. Our study highlights and clarifies the significantly different role played by decoherence in the adiabatic and circuit models of quantum computing.

arXiv:1503.08767•Physical Review A•Jun 17, 2015•147 citations

How detrimental is decoherence in adiabatic quantum computation

Tameem Albash, Daniel A. Lidar

Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of the evolution can survive over the long time-scales used for quantum annealing relative to standard measures of the decoherence time. We reconsider the role of decoherence in adiabatic quantum computation and quantum annealing using the adiabatic quantum master equation formalism. We restrict ourselves to the weak-coupling and singular-coupling limits, which correspond to decoherence in the energy eigenbasis and in the computational basis, respectively. We demonstrate that decoherence in the instantaneous energy eigenbasis does not necessarily detrimentally affect adiabatic quantum computation, and in particular that a short single-qubit $T_2$ time need not imply adverse consequences for the success of the quantum adiabatic algorithm. We further demonstrate that boundary cancellation methods, designed to improve the fidelity of adiabatic quantum computing in the closed system setting, remain beneficial in the open system setting. To address the high computational cost of master equation simulations, we also demonstrate that a quantum Monte Carlo algorithm that explicitly accounts for a thermal bosonic bath can be used to interpolate between classical and quantum annealing. Our study highlights and clarifies the significantly different role played by decoherence in the adiabatic and circuit models of quantum computing.

•Mar 30, 2015•0 citations

Open-system modeling of quantum annealing: theory and applications

Ka-Wa Yip

In this dissertation, we explore how quantum annealing (QA) and its applications behave in an open system setting. We give derivations and numerical recipes for effective parallel simulation methods for time-dependent open dynamics of quantum annealing devices. We consider the weak-coupling limit to an environment and also the case of $1/f$ noise. The stochastic time-dependent quantum trajectories technique can be utilized in studying weak measurements and feedback error correction in quantum annealing. Then we focus on opensystem descriptions of reverse annealing (RA), which is a promising variant and application of quantum annealing. We show that, with various simulation tools, reverse annealing can benefit from the interaction between the annealer and its environment.

arXiv:2107.07231•Apr 15, 2021•3 citations

Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes

Ting-Jui Hsu, Fengping Jin, Christian Seidel +3 more

We study the effect of the anneal path control per qubit, a new user control feature offered on the D-Wave 2000Q quantum annealer, on the performance of quantum annealing for solving optimization problems by numerically solving the time-dependent Schrödinger equation for the time-dependent Hamiltonian modeling the annealing problems. The anneal path control is thereby modeled as a modified linear annealing scheme, resulting in an advanced and retarded scheme. The considered optimization problems are 2-SAT problems with 12 Boolean variables, a known unique ground state and a highly degenerate first excited state. We show that adjustment of the anneal path control can result in a widening of the minimal spectral gap by one or two orders of magnitude and an enhancement of the success probability of finding the solution of the optimization problem. We scrutinize various iterative methods based on the spin floppiness, the average spin value, and on the average energy and describe their performance in boosting the quantum annealing process.

arXiv:1810.00194•Communications in Computational Physics•Apr 28, 2019•15 citations
Reverse annealing is a variant of quantum annealing, in which the system is prepared in a classical state, reverse annealed to an inversion point, and then forward annealed. We report on reverse annealing experiments using the D-Wave 2000Q device, with a focus on the p=2p -spin problem, which undergoes a second-order quantum phase transition with a gap that closes polynomially in the number of spins. We concentrate on the total and partial success probabilities, with the latter being the probabilities of finding each of two degenerate ground states of all spins up or all spins down, and the former being their sum. The empirical partial success probabilities exhibit a strong asymmetry between the two degenerate ground states, depending on the initial state of the reverse anneal. To explain these results, we perform open-system simulations using master equations in the limits of weak and strong coupling to the bath. The former, known as the adiabatic master equation, with decoherence in the instantaneous energy eigenbasis, predicts perfect symmetry between the two degenerate ground states, thus failing to agree with the experiment. In contrast, the latter, known as the polaron transformed Redfield equation, is in close agreement with experiment. Thus, our results present a challenge to the sufficiency of the weak system-bath coupling limit in describing the dynamics of current experimental quantum annealers, at least for reverse annealing on timescales of a microsecond or longer.
In reverse quantum annealing, the initial state is an eigenstate of the final problem Hamiltonian and the transverse field is cycled rather than strictly decreased as in standard (forward) quantum annealing. We present a numerical study of the reverse quantum annealing protocol applied to the ppp-spin model (p=3p=3p=3), including pausing, in an open-system setting accounting for dephasing in the energy eigenbasis, which results in thermal relaxation. We consider both independent and collective dephasing and demonstrate that in both cases the open-system dynamics substantially enhances the performance of reverse annealing. Namely, including dephasing overcomes the failure of purely closed-system reverse annealing to converge to the ground state of the ppp-spin model. We demonstrate that pausing further improves the success probability. The collective dephasing model leads to somewhat better performance than independent dephasing. The protocol we consider corresponds closely to the one implemented in the current generation of commercial quantum annealers, and our results help to explain why recent experiments demonstrated enhanced success probabilities under reverse annealing and pausing.
Adiabatic reverse annealing (ARA) is an improvement to conventional quantum annealing (QA) that uses an initial guess at the desired ground state to circumvent problematic phase transitions. Despite encouraging results in the closed-system setting, Ref. [1] has suggested on the basis of numerical simulations that ARA may lose its advantage in the presence of decoherence. Here, we revisit this problem from a more analytical perspective. Using the ppp-spin model as a solvable example, together with the adiabatic master equation to describe the effects of the environment (valid at weak coupling), we show that ARA can in fact succeed in open systems but that the temperature of the environment plays a key role. We first demonstrate that, in the adiabatic limit, the system will follow the instantaneous equilibrium state as long as the protocol does not pass through any (finite-temperature) phase transitions. Given this, there are two distinct mechanisms by which ARA can break down at high temperature: either there are no paths that avoid transitions, or the equilibrium state itself is disordered. When the temperature is sufficiently low that neither of these occur, then ARA succeeds. Remarkably, there are even situations in which the environment benefits ARA: we find parameter values for which no transition-avoiding paths exist at zero temperature but such paths appear at non-zero temperature.
Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of the evolution can survive over the long time scales used for quantum annealing relative to standard measures of the decoherence time. We reconsider the role of decoherence in adiabatic quantum computation and quantum annealing using the adiabatic quantum master-equation formalism. We restrict ourselves to the weak-coupling and singular-coupling limits, which correspond to decoherence in the energy eigenbasis and in the computational basis, respectively. We demonstrate that decoherence in the instantaneous energy eigenbasis does not necessarily detrimentally affect adiabatic quantum computation, and in particular that a short single-qubit T2{T}_{2}T2​ time need not imply adverse consequences for the success of the quantum adiabatic algorithm. We further demonstrate that boundary cancellation methods, designed to improve the fidelity of adiabatic quantum computing in the closed-system setting, remain beneficial in the open-system setting. To address the high computational cost of master-equation simulations, we also demonstrate that a quantum Monte Carlo algorithm that explicitly accounts for a thermal bosonic bath can be used to interpolate between classical and quantum annealing. Our study highlights and clarifies the significantly different role played by decoherence in the adiabatic and circuit models of quantum computing.
Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of the evolution can survive over the long time-scales used for quantum annealing relative to standard measures of the decoherence time. We reconsider the role of decoherence in adiabatic quantum computation and quantum annealing using the adiabatic quantum master equation formalism. We restrict ourselves to the weak-coupling and singular-coupling limits, which correspond to decoherence in the energy eigenbasis and in the computational basis, respectively. We demonstrate that decoherence in the instantaneous energy eigenbasis does not necessarily detrimentally affect adiabatic quantum computation, and in particular that a short single-qubit T2T_2T2​ time need not imply adverse consequences for the success of the quantum adiabatic algorithm. We further demonstrate that boundary cancellation methods, designed to improve the fidelity of adiabatic quantum computing in the closed system setting, remain beneficial in the open system setting. To address the high computational cost of master equation simulations, we also demonstrate that a quantum Monte Carlo algorithm that explicitly accounts for a thermal bosonic bath can be used to interpolate between classical and quantum annealing. Our study highlights and clarifies the significantly different role played by decoherence in the adiabatic and circuit models of quantum computing.
In this dissertation, we explore how quantum annealing (QA) and its applications behave in an open system setting. We give derivations and numerical recipes for effective parallel simulation methods for time-dependent open dynamics of quantum annealing devices. We consider the weak-coupling limit to an environment and also the case of 1/f1/f1/f noise. The stochastic time-dependent quantum trajectories technique can be utilized in studying weak measurements and feedback error correction in quantum annealing. Then we focus on opensystem descriptions of reverse annealing (RA), which is a promising variant and application of quantum annealing. We show that, with various simulation tools, reverse annealing can benefit from the interaction between the annealer and its environment.
We study the effect of the anneal path control per qubit, a new user control feature offered on the D-Wave 2000Q quantum annealer, on the performance of quantum annealing for solving optimization problems by numerically solving the time-dependent Schrödinger equation for the time-dependent Hamiltonian modeling the annealing problems. The anneal path control is thereby modeled as a modified linear annealing scheme, resulting in an advanced and retarded scheme. The considered optimization problems are 2-SAT problems with 12 Boolean variables, a known unique ground state and a highly degenerate first excited state. We show that adjustment of the anneal path control can result in a widening of the minimal spectral gap by one or two orders of magnitude and an enhancement of the success probability of finding the solution of the optimization problem. We scrutinize various iterative methods based on the spin floppiness, the average spin value, and on the average energy and describe their performance in boosting the quantum annealing process.