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

Steering random spin systems to speed up the quantum adiabatic algorithm

A. Barış Özgüler, Robert Joynt, Maxim Vavilov

Published Dec 7, 2018• 28 citations
arXivHTMLPDF

Abstract

A general time-dependent quantum system can be driven fast from its initial ground state to its final ground state without generating transitions by adding a steering term to the Hamiltonian. We show how this technique can be modified to improve on the standard quantum adiabatic algorithm by making a single-particle and cluster approximation to the steering term. The method is applied to a one-dimensional Ising model in a random field. For the limit of strong disorder, the correction terms significantly enhance the probability for the whole system to remain in the ground state for the proposed nonstoquastic annealing protocol. We demonstrate that even when transitions occur for stronger interaction between qubits, the most probable quantum state is one of the lower-energy states of the final Hamiltonian. Since the method can be applied to any model, and more sophisticated approximations to the steering term are possible, the alternative technique opens up an avenue for the improvement of the quantum adiabatic algorithm.

DOI
10.1103/physreva.98.062311

Related papers

Speedup of the quantum adiabatic algorithm using delocalization catalysis

Chenfeng Cao, Jian Xue, Nic Shannon +1 more

We propose a method to speed up the quantum adiabatic algorithm using catalysis by many-body delocalization.This is applied to random-field antiferromagnetic Ising spin models.The algorithm is catalyzed in such a way that the evolution approximates a Heisenberg model in the middle of its course, and the model is in a delocalized phase.We show numerically that we can speed up the standard algorithm for finding the ground state of the random-field Ising model using this idea.We also demonstrate that the speedup is due to gap amplification, even though the underlying model is not frustration-free.The crossover to speedup occurs at roughly the value of the interaction which is known to be the critical one for the delocalization transition.We also calculate the participation ratio and entanglement entropy as a function of time: Their time dependencies indicate that the system is exploring more states and that they are more entangled than when there is no catalyst.Together, all these pieces of evidence demonstrate that the speedup is related to delocalization.Even though only relatively small systems can be investigated, the evidence suggests that the scaling of the method with system size is favorable.Our method is illustrated by experimental results from a small online IBM quantum computer, showing how to verify the method in future as such machines improve.The cost of the catalytic method compared with the standard algorithm is only a constant factor.

arXiv:2007.11212•Physical Review Research•Jan 29, 2021•17 citations

Steered quantum annealing: improving time efficiency with partial information

Ana Palacios de Luis, Artur García-Sáez, Marta P. Estarellas

In the computational model of quantum annealing, the size of the minimum gap between the ground state and the first excited state of the system is of particular importance, since it is inversely proportional to the running time of the algorithm. Thus, it is desirable to keep the gap as large as possible during the annealing process, since it allows the computation to remain under the protection of the adiabatic theorem while staying efficient. We propose steered quantum annealing as a new method to enlarge the gap throughout the process, in the case of diagonal final Hamiltonians, based on the exploitation of some assumptions we can make about the particular problem instance. In order to introduce this information, we propose beginning the anneal from a biased Hamiltonian that incorporates reliable assumptions about the final ground state. Our simulations show that this method yields a larger average gap throughout the whole computation, which results in an increased robustness of the overall annealing process.

arXiv:2206.07646•Jun 15, 2022•2 citations

Fast forward of the adiabatic spin dynamics of entangled states

Iwan Setiawan, Bobby Eka Gunara, Shumpei Masuda +1 more

We develop a fast-forward scheme of the adiabatic spin dynamics of quantum entangled states. We settle the quasiadiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with the use of a large time-scaling factor. Assuming the experimentally realizable candidate Hamiltonian consisting of the exchange interactions and magnetic field, we solve the regularization terms. These terms, multiplied by the velocity function, give rise to the state-dependent counterdiabatic terms. The scheme needs neither knowledge of full spectral properties of the system nor solving the initial- and boundary-value problem. Our fast forward Hamiltonian generates a variety of state-dependent counterdiabatic terms for each of adiabatic states, which can include the state-independent one. We highlight this fact by using minimum (two-spin) models for a simple transverse Ising model, quantum annealing, and generation of entanglement.

arXiv:1711.04074•Physical Review A•Nov 8, 2017•40 citations

Fast forward of adiabatic spin dynamics : An application to quantum annealing model in triangle spin systems.

Iwan Setiawan, Bobby Eka Gunara, Katsuhiro Nakamura

Abstract We propose a scheme of the fast forward of adiabatic spin dynamics in a triangular 3 spin cluster of quantum annealing model and reveal the structure and role of driving pair-wise interaction and three-body interactions. We settle the quasi-adiabatic spin dynamics (QASD) by adding the regularization terms to the original Hamiltonian and accelerate it with use of a large time-scaling factor which realizes QASD on shortened time scale. Assuming the candidate regularization Hamiltonian consisting of three-body interactions besides the pair-wise exchange interactions and magnetic field, we solved the regularization terms. These terms multiplied by the velocity function give rise to the state-dependent counter-diabatic terms (CDTs) for each of adiabatic states. Applying this method to quantum annealing model, we find CDTs which include pair-wise interaction and the 3-body interactions. The driving pairwise and three-body interaction in the fast-forward scheme guarantees the complete fidelity of accelerated states.

Journal of Physics Conference Series•Aug 1, 2019•8 citations

Two-parameter counter-diabatic driving in quantum annealing

Luise Prielinger, Andreas Hartmann, Yu Yamashiro +3 more

We introduce a two-parameter approximate counter-diabatic term into the Hamiltonian of the transversefield Ising model for quantum annealing to accelerate convergence to the solution, generalizing an existing single-parameter approach.The protocol is equivalent to unconventional diabatic control of the longitudinal and transverse fields in the transverse-field Ising model and thus makes it more feasible for experimental realization than an introduction of new terms such as nonstoquastic catalysts toward the same goal of performance enhancement.We test the idea for the p-spin model with p = 3, which has a first-order quantum phase transition, and show that our two-parameter approach leads to significantly larger ground-state fidelity and lower residual energy than those by traditional quantum annealing and by the single-parameter method.We also find a scaling advantage in terms of the time-to-solution as a function of the system size in a certain range of parameters as compared to the traditional methods in the sense that an exponential time complexity is reduced to another exponential complexity with a smaller coefficient.Although the present method may not always lead to a drastic exponential speedup in difficult optimization problems, it is useful because of its versatility and applicability for any problem after a simple algebraic manipulation, in contrast to some other powerful prescriptions for acceleration such as nonstoquastic catalysts in which one should carefully study in advance if it works in a given problem and should identify a proper way to meticulously control the system parameters to achieve the goal, which is generally highly nontrivial.

arXiv:2011.02691•Physical Review Research•Mar 9, 2021•45 citations

Adiabatic preparation without quantum phase transitions

Gernot Schaller

Many physically interesting models show a quantum phase transition when a single parameter is varied through a critical point, where the ground state and the first excited state become degenerate. When this parameter appears as a coupling constant, these models can be understood as straight-line interpolations between different Hamiltonians ${H}_{\mathrm{I}}$ and ${H}_{\mathrm{F}}$. For finite-size realizations however, there will usually be a finite energy gap between ground and first excited state. By slowly changing the coupling constant through the point with the minimum energy gap one thereby has an adiabatic algorithm that prepares the ground state of ${H}_{\mathrm{F}}$ from the ground state of ${H}_{\mathrm{I}}$. The adiabatic theorem implies that in order to obtain a good preparation fidelity the runtime $\ensuremath{\tau}$ should scale with the inverse energy gap and thereby also with the system size. In addition, for open quantum systems not only nonadiabatic but also thermal excitations are likely to occur. It is shown that---using only local Hamiltonians---for the one-dimensional quantum Ising model and the cluster model in a transverse field the conventional straight-line path can be replaced by a series of straight-line interpolations, along which the fundamental energy gap is always greater than a constant independent on the system size. The results are of interest for adiabatic quantum computation since strong similarities between adiabatic quantum algorithms and quantum phase transitions exist.

arXiv:0807.2516•Physical Review A•Sep 23, 2008•28 citations
A general time-dependent quantum system can be driven fast from its initial ground state to its final ground state without generating transitions by adding a steering term to the Hamiltonian. We show how this technique can be modified to improve on the standard quantum adiabatic algorithm by making a single-particle and cluster approximation to the steering term. The method is applied to a one-dimensional Ising model in a random field. For the limit of strong disorder, the correction terms significantly enhance the probability for the whole system to remain in the ground state for the proposed nonstoquastic annealing protocol. We demonstrate that even when transitions occur for stronger interaction between qubits, the most probable quantum state is one of the lower-energy states of the final Hamiltonian. Since the method can be applied to any model, and more sophisticated approximations to the steering term are possible, the alternative technique opens up an avenue for the improvement of the quantum adiabatic algorithm.
We propose a method to speed up the quantum adiabatic algorithm using catalysis by many-body delocalization.This is applied to random-field antiferromagnetic Ising spin models.The algorithm is catalyzed in such a way that the evolution approximates a Heisenberg model in the middle of its course, and the model is in a delocalized phase.We show numerically that we can speed up the standard algorithm for finding the ground state of the random-field Ising model using this idea.We also demonstrate that the speedup is due to gap amplification, even though the underlying model is not frustration-free.The crossover to speedup occurs at roughly the value of the interaction which is known to be the critical one for the delocalization transition.We also calculate the participation ratio and entanglement entropy as a function of time: Their time dependencies indicate that the system is exploring more states and that they are more entangled than when there is no catalyst.Together, all these pieces of evidence demonstrate that the speedup is related to delocalization.Even though only relatively small systems can be investigated, the evidence suggests that the scaling of the method with system size is favorable.Our method is illustrated by experimental results from a small online IBM quantum computer, showing how to verify the method in future as such machines improve.The cost of the catalytic method compared with the standard algorithm is only a constant factor.
In the computational model of quantum annealing, the size of the minimum gap between the ground state and the first excited state of the system is of particular importance, since it is inversely proportional to the running time of the algorithm. Thus, it is desirable to keep the gap as large as possible during the annealing process, since it allows the computation to remain under the protection of the adiabatic theorem while staying efficient. We propose steered quantum annealing as a new method to enlarge the gap throughout the process, in the case of diagonal final Hamiltonians, based on the exploitation of some assumptions we can make about the particular problem instance. In order to introduce this information, we propose beginning the anneal from a biased Hamiltonian that incorporates reliable assumptions about the final ground state. Our simulations show that this method yields a larger average gap throughout the whole computation, which results in an increased robustness of the overall annealing process.
We develop a fast-forward scheme of the adiabatic spin dynamics of quantum entangled states. We settle the quasiadiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with the use of a large time-scaling factor. Assuming the experimentally realizable candidate Hamiltonian consisting of the exchange interactions and magnetic field, we solve the regularization terms. These terms, multiplied by the velocity function, give rise to the state-dependent counterdiabatic terms. The scheme needs neither knowledge of full spectral properties of the system nor solving the initial- and boundary-value problem. Our fast forward Hamiltonian generates a variety of state-dependent counterdiabatic terms for each of adiabatic states, which can include the state-independent one. We highlight this fact by using minimum (two-spin) models for a simple transverse Ising model, quantum annealing, and generation of entanglement.
Abstract We propose a scheme of the fast forward of adiabatic spin dynamics in a triangular 3 spin cluster of quantum annealing model and reveal the structure and role of driving pair-wise interaction and three-body interactions. We settle the quasi-adiabatic spin dynamics (QASD) by adding the regularization terms to the original Hamiltonian and accelerate it with use of a large time-scaling factor which realizes QASD on shortened time scale. Assuming the candidate regularization Hamiltonian consisting of three-body interactions besides the pair-wise exchange interactions and magnetic field, we solved the regularization terms. These terms multiplied by the velocity function give rise to the state-dependent counter-diabatic terms (CDTs) for each of adiabatic states. Applying this method to quantum annealing model, we find CDTs which include pair-wise interaction and the 3-body interactions. The driving pairwise and three-body interaction in the fast-forward scheme guarantees the complete fidelity of accelerated states.
We introduce a two-parameter approximate counter-diabatic term into the Hamiltonian of the transversefield Ising model for quantum annealing to accelerate convergence to the solution, generalizing an existing single-parameter approach.The protocol is equivalent to unconventional diabatic control of the longitudinal and transverse fields in the transverse-field Ising model and thus makes it more feasible for experimental realization than an introduction of new terms such as nonstoquastic catalysts toward the same goal of performance enhancement.We test the idea for the p-spin model with p = 3, which has a first-order quantum phase transition, and show that our two-parameter approach leads to significantly larger ground-state fidelity and lower residual energy than those by traditional quantum annealing and by the single-parameter method.We also find a scaling advantage in terms of the time-to-solution as a function of the system size in a certain range of parameters as compared to the traditional methods in the sense that an exponential time complexity is reduced to another exponential complexity with a smaller coefficient.Although the present method may not always lead to a drastic exponential speedup in difficult optimization problems, it is useful because of its versatility and applicability for any problem after a simple algebraic manipulation, in contrast to some other powerful prescriptions for acceleration such as nonstoquastic catalysts in which one should carefully study in advance if it works in a given problem and should identify a proper way to meticulously control the system parameters to achieve the goal, which is generally highly nontrivial.
Many physically interesting models show a quantum phase transition when a single parameter is varied through a critical point, where the ground state and the first excited state become degenerate. When this parameter appears as a coupling constant, these models can be understood as straight-line interpolations between different Hamiltonians HI{H}_{\mathrm{I}}HI​ and HF{H}_{\mathrm{F}}HF​. For finite-size realizations however, there will usually be a finite energy gap between ground and first excited state. By slowly changing the coupling constant through the point with the minimum energy gap one thereby has an adiabatic algorithm that prepares the ground state of HF{H}_{\mathrm{F}}HF​ from the ground state of HI{H}_{\mathrm{I}}HI​. The adiabatic theorem implies that in order to obtain a good preparation fidelity the runtime $\ensuremath{\tau}$ should scale with the inverse energy gap and thereby also with the system size. In addition, for open quantum systems not only nonadiabatic but also thermal excitations are likely to occur. It is shown that---using only local Hamiltonians---for the one-dimensional quantum Ising model and the cluster model in a transverse field the conventional straight-line path can be replaced by a series of straight-line interpolations, along which the fundamental energy gap is always greater than a constant independent on the system size. The results are of interest for adiabatic quantum computation since strong similarities between adiabatic quantum algorithms and quantum phase transitions exist.