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:1806.02542 · Physical Review A

Reverse annealing for the fully connected p -spin model

Masaki Ohkuwa, Hidetoshi Nishimori, Daniel A. Lidar

Published Aug 13, 2018• 117 citations
arXivHTMLPDF

Abstract

Reverse annealing is a variant of quantum annealing that starts from a given classical configuration of spins (qubits). In contrast to the conventional formulation, where one starts from a uniform superposition of all possible states (classical configurations), quantum fluctuations are first increased and only then decreased. One then reads out the state as a proposed solution to the given combinatorial optimization problem. We formulate a mean-field theory of reverse annealing using the fully connected ferromagnetic $p$-spin model, with and without random longitudinal fields, and analyze it in order to understand how and when reverse annealing is effective at solving this problem. We find that the difficulty arising from the existence of a first-order quantum phase transition, which leads to an exponentially long computation time in conventional quantum annealing, is circumvented in the context of this particular problem by reverse annealing if the proximity of the initial state to the (known) solution exceeds a threshold. Even when a first-order transition is unavoidable, the difficulty is mitigated due to a smaller jump in the order parameter at a first-order transition, which implies a larger rate of quantum tunneling. Reverse annealing has not been studied analytically before, and this study paves the way toward a systematic understanding of this relatively unexplored protocol in a broader context.

DOI
10.1103/physreva.98.022314

Related papers

Quantum annealing with antiferromagnetic fluctuations

Yuya Seki, Hidetoshi Nishimori

We introduce antiferromagnetic quantum fluctuations into quantum annealing in addition to the conventional transverse-field term. We apply this method to the infinite-range ferromagnetic p-spin model, for which the conventional quantum annealing has been shown to have difficulties in finding the ground state efficiently due to a first-order transition. We study the phase diagram of this system both analytically and numerically. Using the static approximation, we find that there exists a quantum path to reach the final ground state from the trivial initial state that avoids first-order transitions for intermediate values of p. We also study numerically the energy gap between the ground state and the first excited state and find evidence for intermediate values of p for which the time complexity scales polynomially with the system size at a second-order transition point along the quantum path that avoids first-order transitions. These results suggest that quantum annealing would be able to solve this problem with intermediate values of p efficiently, in contrast to the case with only simple transverse-field fluctuations.

arXiv:1203.2418•Physical Review E•May 10, 2012•141 citations

Control of quantum phase transitions in mean-field models for quantum annealing

優也 関, Yuya Seki

The present thesis studies statistical-mechanical properties of mean-field models to reveal an effect of various types of quantum fluctuations against the efficiency of quantum annealing.Quantum annealing is a quantum computation model to search the ground state of Ising spin systems by taking advantage of quantum fluctuations.The quantum fluctuations are usually induced by the transverse-field term.However, it has been reported that the quantum annealing with the transverse-field term has a difficulty of exponentially long running time for certain problems.For example, quantum annealing cannot find even the ground state of a simple ferromagnetic system.The difficulty is closely related to the phenomena of quantum phase transitions.Quantum annealing typically requires exponentially long time to find the ground state of a system, if the system undergoes a first-order quantum phase transition in the thermodynamics limit.Hence, avoiding firstorder quantum phase transitions is a critical issue for quantum annealing.A solution to avoid the difficulty mentioned above is to use a degree of freedom of quantum annealing.Although many studies adopt the transverse-field term to induce quantum fluctuations, there is no restriction to use the term.The present thesis shows that the difficulty for the simple ferromagnetic system can be avoided by using transverse antiferromagnetic interactions.Furthermore, the antiferromagnetic term turns out to be also effective for a random spin system.We next focus on the macroscopic degeneracy of the ground states of the antiferromagnetic term.In order to reveal the effect of the macroscopic degeneracy, the Wajnflasz-Pick model is analyzed.The Wajnflasz-Pick model is interesting also in terms of providing an alternative way to control the order of quantum phase transitions.iii I would like to thank my supervisor Prof. Hidetoshi Nishimori for his guidance and revisions of the thesis and the papers we co-authored.The studies in the present thesis could not have been accomplished without his insightful advice.I am also grateful to Dr. Kazutaka Takahashi for fruitful discussions.I would like to

•Mar 26, 2016•0 citations

Efficient Quantum and Simulated Annealing of Potts Models Using a Half-hot Constraint

Shuntaro Okada, Masayuki Ohzeki, Kazuyuki Tanaka

The Potts model is a generalization of the Ising model with $Q>2$ components. In the fully connected ferromagnetic Potts model, a first-order phase transition is induced by varying thermal fluctuations. Therefore, the computational time required to obtain the ground states by simulated annealing exponentially increases with the system size. This study analytically confirms that the transverse magnetic-field quantum annealing induces a first-order phase transition. This result implies that quantum annealing does not exponentially accelerate the ground-state search of the ferromagnetic Potts model. To avoid the first-order phase transition, we propose an iterative optimization method using a half-hot constraint that is applicable to both quantum and simulated annealing. In the limit of $Q \to \infty$, a saddle point equation under the half-hot constraint is identical to the equation describing the behavior of the fully connected ferromagnetic Ising model, thus confirming a second-order phase transition. Furthermore, we verify the same relation between the fully connected Potts glass model and the Sherrington--Kirkpatrick model under assumptions of static approximation and replica symmetric solution. The proposed method is expected to obtain low-energy states of the Potts models with high efficiency using Ising-type computers such as the D-Wave quantum annealer and the Fujitsu Digital Annealer.

arXiv:1904.01522•Journal of the Physical Society of Japan•Jul 28, 2020•10 citations

Dynamics of reverse annealing for the fully connected p -spin model

Yu Yamashiro, Masaki Ohkuwa, Hidetoshi Nishimori +1 more

Reverse annealing, a variant of quantum annealing, is investigated by probing quantum transitions in a $p$-spin model and comparing it with the predictions offered by equilibrium statistical mechanics. It is shown that reverse annealing can provide an exponential speedup over conventional quantum annealing for this particular problem.

arXiv:1906.10889•Physical Review A•Nov 18, 2019•84 citations

Simulated outperforms quantum reverse annealing in mean-field models

Christopher L. Baldwin

Adiabatic reverse annealing (ARA) has been proposed as an improvement to conventional quantum annealing for solving optimization problems, in which one takes advantage of an initial guess at the solution to suppress problematic phase transitions. Here we interpret the performance of ARA through its effects on the free energy landscape, and use the intuition gained to introduce a classical analogue to ARA termed ``simulated reverse annealing'' (SRA). This makes it more difficult to claim that ARA provides a quantum advantage in solving a given problem, as not only must ARA succeed but the corresponding SRA must fail. As a solvable example, we analyze how both protocols behave in the infinite-range (non-disordered) $p$-spin model. Through both the thermodynamic phase diagrams and explicit dynamical behavior, we establish that the quantum algorithm has no advantage over its classical counterpart: SRA succeeds not only in every case where ARA does but even in a narrow range of parameters where ARA fails.

arXiv:2511.00150•Oct 31, 2025•2 citations

Ising formulation of integer optimization problems for utilizing quantum annealing in iterative improvement strategy

Shuntaro Okada, Masayuki Ohzeki

Quantum annealing is a heuristic algorithm for searching the ground state of an Ising model. Heuristic algorithms aim to obtain near-optimal solutions with a reasonable computation time. Accordingly, many algorithms have so far been proposed. In general, the performance of heuristic algorithms strongly depends on the instance of the combinatorial optimization problem to be solved because they escape the local minima in different ways. Therefore, combining several algorithms to exploit their complementary strength is effective for obtaining highly accurate solutions for a wide range of combinatorial optimization problems. However, quantum annealing cannot be used to improve a candidate solution obtained by other algorithms because it starts from an initial state where all spin configurations are found with a uniform probability. In this study, we propose an Ising formulation of integer optimization problems to utilize quantum annealing in the iterative improvement strategy. Our formulation exploits the biased sampling of degenerated ground states in transverse magnetic field quantum annealing. We also analytically show that a first-order phase transition is successfully avoided for a fully connected ferromagnetic Potts model if the overlap between a ground state and a candidate solution exceeds a threshold. The proposed formulation is applicable to a wide range of integer optimization problems and enables us to hybridize quantum annealing with other optimization algorithms.

arXiv:2211.03957•Nov 8, 2022•0 citations
Reverse annealing is a variant of quantum annealing that starts from a given classical configuration of spins (qubits). In contrast to the conventional formulation, where one starts from a uniform superposition of all possible states (classical configurations), quantum fluctuations are first increased and only then decreased. One then reads out the state as a proposed solution to the given combinatorial optimization problem. We formulate a mean-field theory of reverse annealing using the fully connected ferromagnetic ppp-spin model, with and without random longitudinal fields, and analyze it in order to understand how and when reverse annealing is effective at solving this problem. We find that the difficulty arising from the existence of a first-order quantum phase transition, which leads to an exponentially long computation time in conventional quantum annealing, is circumvented in the context of this particular problem by reverse annealing if the proximity of the initial state to the (known) solution exceeds a threshold. Even when a first-order transition is unavoidable, the difficulty is mitigated due to a smaller jump in the order parameter at a first-order transition, which implies a larger rate of quantum tunneling. Reverse annealing has not been studied analytically before, and this study paves the way toward a systematic understanding of this relatively unexplored protocol in a broader context.
We introduce antiferromagnetic quantum fluctuations into quantum annealing in addition to the conventional transverse-field term. We apply this method to the infinite-range ferromagnetic p-spin model, for which the conventional quantum annealing has been shown to have difficulties in finding the ground state efficiently due to a first-order transition. We study the phase diagram of this system both analytically and numerically. Using the static approximation, we find that there exists a quantum path to reach the final ground state from the trivial initial state that avoids first-order transitions for intermediate values of p. We also study numerically the energy gap between the ground state and the first excited state and find evidence for intermediate values of p for which the time complexity scales polynomially with the system size at a second-order transition point along the quantum path that avoids first-order transitions. These results suggest that quantum annealing would be able to solve this problem with intermediate values of p efficiently, in contrast to the case with only simple transverse-field fluctuations.
The present thesis studies statistical-mechanical properties of mean-field models to reveal an effect of various types of quantum fluctuations against the efficiency of quantum annealing.Quantum annealing is a quantum computation model to search the ground state of Ising spin systems by taking advantage of quantum fluctuations.The quantum fluctuations are usually induced by the transverse-field term.However, it has been reported that the quantum annealing with the transverse-field term has a difficulty of exponentially long running time for certain problems.For example, quantum annealing cannot find even the ground state of a simple ferromagnetic system.The difficulty is closely related to the phenomena of quantum phase transitions.Quantum annealing typically requires exponentially long time to find the ground state of a system, if the system undergoes a first-order quantum phase transition in the thermodynamics limit.Hence, avoiding firstorder quantum phase transitions is a critical issue for quantum annealing.A solution to avoid the difficulty mentioned above is to use a degree of freedom of quantum annealing.Although many studies adopt the transverse-field term to induce quantum fluctuations, there is no restriction to use the term.The present thesis shows that the difficulty for the simple ferromagnetic system can be avoided by using transverse antiferromagnetic interactions.Furthermore, the antiferromagnetic term turns out to be also effective for a random spin system.We next focus on the macroscopic degeneracy of the ground states of the antiferromagnetic term.In order to reveal the effect of the macroscopic degeneracy, the Wajnflasz-Pick model is analyzed.The Wajnflasz-Pick model is interesting also in terms of providing an alternative way to control the order of quantum phase transitions.iii I would like to thank my supervisor Prof. Hidetoshi Nishimori for his guidance and revisions of the thesis and the papers we co-authored.The studies in the present thesis could not have been accomplished without his insightful advice.I am also grateful to Dr. Kazutaka Takahashi for fruitful discussions.I would like to
The Potts model is a generalization of the Ising model with Q>2Q>2Q>2 components. In the fully connected ferromagnetic Potts model, a first-order phase transition is induced by varying thermal fluctuations. Therefore, the computational time required to obtain the ground states by simulated annealing exponentially increases with the system size. This study analytically confirms that the transverse magnetic-field quantum annealing induces a first-order phase transition. This result implies that quantum annealing does not exponentially accelerate the ground-state search of the ferromagnetic Potts model. To avoid the first-order phase transition, we propose an iterative optimization method using a half-hot constraint that is applicable to both quantum and simulated annealing. In the limit of Q→∞Q \to \inftyQ→∞, a saddle point equation under the half-hot constraint is identical to the equation describing the behavior of the fully connected ferromagnetic Ising model, thus confirming a second-order phase transition. Furthermore, we verify the same relation between the fully connected Potts glass model and the Sherrington--Kirkpatrick model under assumptions of static approximation and replica symmetric solution. The proposed method is expected to obtain low-energy states of the Potts models with high efficiency using Ising-type computers such as the D-Wave quantum annealer and the Fujitsu Digital Annealer.
Reverse annealing, a variant of quantum annealing, is investigated by probing quantum transitions in a ppp-spin model and comparing it with the predictions offered by equilibrium statistical mechanics. It is shown that reverse annealing can provide an exponential speedup over conventional quantum annealing for this particular problem.
Adiabatic reverse annealing (ARA) has been proposed as an improvement to conventional quantum annealing for solving optimization problems, in which one takes advantage of an initial guess at the solution to suppress problematic phase transitions. Here we interpret the performance of ARA through its effects on the free energy landscape, and use the intuition gained to introduce a classical analogue to ARA termed ``simulated reverse annealing'' (SRA). This makes it more difficult to claim that ARA provides a quantum advantage in solving a given problem, as not only must ARA succeed but the corresponding SRA must fail. As a solvable example, we analyze how both protocols behave in the infinite-range (non-disordered) ppp-spin model. Through both the thermodynamic phase diagrams and explicit dynamical behavior, we establish that the quantum algorithm has no advantage over its classical counterpart: SRA succeeds not only in every case where ARA does but even in a narrow range of parameters where ARA fails.
Quantum annealing is a heuristic algorithm for searching the ground state of an Ising model. Heuristic algorithms aim to obtain near-optimal solutions with a reasonable computation time. Accordingly, many algorithms have so far been proposed. In general, the performance of heuristic algorithms strongly depends on the instance of the combinatorial optimization problem to be solved because they escape the local minima in different ways. Therefore, combining several algorithms to exploit their complementary strength is effective for obtaining highly accurate solutions for a wide range of combinatorial optimization problems. However, quantum annealing cannot be used to improve a candidate solution obtained by other algorithms because it starts from an initial state where all spin configurations are found with a uniform probability. In this study, we propose an Ising formulation of integer optimization problems to utilize quantum annealing in the iterative improvement strategy. Our formulation exploits the biased sampling of degenerated ground states in transverse magnetic field quantum annealing. We also analytically show that a first-order phase transition is successfully avoided for a fully connected ferromagnetic Potts model if the overlap between a ground state and a candidate solution exceeds a threshold. The proposed formulation is applicable to a wide range of integer optimization problems and enables us to hybridize quantum annealing with other optimization algorithms.