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

Optimal quantum annealing: A variational shortcut-to-adiabaticity approach

Gianluca Passarelli, Rosario Fazio, Procolo Lucignano

Published Feb 23, 2022• 30 citations
arXivHTMLPDF

Abstract

Suppressing unwanted transitions out of the instantaneous ground state is a major challenge in unitary adiabatic quantum computation. A recent approach consists in building counterdiabatic potentials approximated using variational strategies. In this contribution, we extend this variational approach to Lindbladian dynamics, having as a goal the suppression of diabatic transitions between pairs of Jordan blocks in quantum annealing. We show that, surprisingly, unitary counterdiabatic Ans\"atze are successful for dissipative dynamics as well, allowing for easier experimental implementations compared to Lindbladian Ans\"atze involving dissipation. Our approach not only guarantees improvements of open-system adiabaticity but also enhances the success probability of quantum annealing.

DOI
10.1103/physreva.105.022618

Related papers

Optimizing counterdiabaticity by variational quantum circuits

Dan Sun, Pranav Chandarana, Zi‐Hua Xin +1 more

Using counterdiabatic (CD) driving-aiming at suppression of diabatic transition-in digitized adiabatic evolution has garnered immense interest in quantum protocols and algorithms. However, improving the approximate CD terms with a nested commutator ansatz is a challenging task. In this work, we propose a technique of finding optimal coefficients of the CD terms using a variational quantum circuit. By classical optimization routines, the parameters of this circuit are optimized to provide the coefficients corresponding to the CD terms. Then their improved performance is exemplified in Greenberger-Horne-Zeilinger state preparation on the nearest-neighbour Ising model. Finally, we also show the advantage over the usual quantum approximation optimization algorithm, in terms of fidelity with bounded time. This article is part of the theme issue 'Shortcuts to adiabaticity: theoretical, experimental and interdisciplinary perspectives'.

arXiv:2208.02087•Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Nov 6, 2022•20 citations

Counterdiabatic driving in the quantum annealing of the p -spin model: A variational approach

G. Passarelli, V. Cataudella, Rosario Fazio +1 more

In this paper, the issue of reducing the time-to-solution in adiabatic quantum computation is addressed. The authors apply a variational principle to derive approximations of the counterdiabatic driving operator as a shortcut to adiabaticity. Two different ansatzes are discussed for the ferromagnetic $p$-spin model and its generalizations, including short-range interactions and random couplings. Numerical simulations show good performances, almost independently of the system size, up to hundreds of qubits

arXiv:1912.09711•Physical Review Research•Mar 9, 2020•66 citations

Genetic optimization of quantum annealing

Pratibha Raghupati Hegde, Gianluca Passarelli, Annarita Scocco +1 more

The study of optimal control of quantum annealing by modulating the pace of evolution and by introducing a counterdiabatic potential has gained significant attention in recent times. In this work, we present a numerical approach based on genetic algorithms to improve the performance of quantum annealing, which evades the Landau-Zener transitions to navigate to the ground state of the final Hamiltonian with high probability. We optimize the annealing schedules starting from the polynomial ansatz by treating their coefficients as chromosomes of the genetic algorithm. We also explore shortcuts to adiabaticity by computing a practically feasible $k$-local optimal driving operator, showing that even for $k=1$ we achieve substantial improvement of the fidelity over the standard annealing solution. With these genetically optimized annealing schedules and/or optimal driving operators, we are able to perform quantum annealing in relatively short timescales and with higher fidelity compared to traditional approaches.

arXiv:2108.03185•Physical Review A•Jan 26, 2022•41 citations

Geometrical scheduling of adiabatic control without information of energy spectra

Yuta Shingu, Takuya Hatomura

Adiabatic control is a fundamental technique for manipulating quantum systems, guided by the quantum adiabatic theorem, which ensures suppressed nonadiabatic transitions under slow parameter variations. Quantum annealing, a heuristic algorithm leveraging adiabatic control, seeks the ground states of Ising spin glass models and has drawn attention for addressing combinatorial optimization problems. However, exponentially small energy gaps in such models often necessitate impractically long runtime to satisfy the adiabatic condition. Despite this limitation, improving the quality of approximate solutions remains crucial for practical applications. The quantum adiabatic brachistochrone provides a method to enhance adiabaticity by minimizing an action representing nonadiabaticity via the variational principle. While effective, its implementation requires detailed energy spectra, complicating its use in quantum annealing. Shortcuts to adiabaticity by counterdiabatic driving offer alternative approaches for accelerating adiabatic processes. However, the theory of shortcuts to adiabaticity often faces challenges such as nonlocal control requirements, high computational cost, and trade-offs between speed and energy efficiency. In this work, we propose a novel quantum adiabatic brachistochrone protocol tailored for quantum annealing that eliminates the need for energy spectrum information. Our approach builds on advancements in counterdiabatic driving to design efficient parameter schedules. We demonstrate the effectiveness of our method through numerical simulations on the transverse-field Ising chain and axial next-nearest neighbor Ising models.

arXiv:2501.11846•Physical Review A•Jul 16, 2025•4 citations

Diabatic quantum annealing for the frustrated ring model

Jeremy Côté, Frédéric Sauvage, Martín Larocca +3 more

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.

arXiv:2212.02624•Quantum Science and Technology•Sep 20, 2023•15 citations

Leveraging Landau-Zener-Stückelberg interference for accelerating diabatic quantum annealing

Matthias Werner, Matías Jonsson, Artur García-Sáez +2 more

Diabatic quantum annealing with variationally optimized schedules can exhibit exponential speedups over conventional adiabatic quantum annealing, as was demonstrated numerically for a frustrated Ising ring model by C{ô}t{é} et al. Here we identify Landau-Zener-St{ü}ckelberg interference as the underlying mechanism for this speedup, and based on this insight we propose a variational schedule ansatz with far fewer parameters. This simplified ansatz allows us to show analytically that the classical optimization of the schedule parameters can be done in polynomial time and discuss conditions when we expect this type of mechanism to provide speedups over adiabatic annealing. Furthermore, we provide an analytical argument that coherence is an essential resource for this mechanism, which we verify numerically. We perform extensive numerical tests of the proposed ansatz and observe substantial improvements over adiabatic annealing and competitive performance in particularly challenging problem instances, including a well-studied MAXCUT instance commonly used for benchmarking. Our work shows that explicitly leveraging physical mechanisms can lead to more effective designs of variational annealing algorithms.

quant-pharXiv:2606.09706•Jun 9, 2026•2 citations
Suppressing unwanted transitions out of the instantaneous ground state is a major challenge in unitary adiabatic quantum computation. A recent approach consists in building counterdiabatic potentials approximated using variational strategies. In this contribution, we extend this variational approach to Lindbladian dynamics, having as a goal the suppression of diabatic transitions between pairs of Jordan blocks in quantum annealing. We show that, surprisingly, unitary counterdiabatic Ans"atze are successful for dissipative dynamics as well, allowing for easier experimental implementations compared to Lindbladian Ans"atze involving dissipation. Our approach not only guarantees improvements of open-system adiabaticity but also enhances the success probability of quantum annealing.
Using counterdiabatic (CD) driving-aiming at suppression of diabatic transition-in digitized adiabatic evolution has garnered immense interest in quantum protocols and algorithms. However, improving the approximate CD terms with a nested commutator ansatz is a challenging task. In this work, we propose a technique of finding optimal coefficients of the CD terms using a variational quantum circuit. By classical optimization routines, the parameters of this circuit are optimized to provide the coefficients corresponding to the CD terms. Then their improved performance is exemplified in Greenberger-Horne-Zeilinger state preparation on the nearest-neighbour Ising model. Finally, we also show the advantage over the usual quantum approximation optimization algorithm, in terms of fidelity with bounded time. This article is part of the theme issue 'Shortcuts to adiabaticity: theoretical, experimental and interdisciplinary perspectives'.
In this paper, the issue of reducing the time-to-solution in adiabatic quantum computation is addressed. The authors apply a variational principle to derive approximations of the counterdiabatic driving operator as a shortcut to adiabaticity. Two different ansatzes are discussed for the ferromagnetic ppp-spin model and its generalizations, including short-range interactions and random couplings. Numerical simulations show good performances, almost independently of the system size, up to hundreds of qubits
The study of optimal control of quantum annealing by modulating the pace of evolution and by introducing a counterdiabatic potential has gained significant attention in recent times. In this work, we present a numerical approach based on genetic algorithms to improve the performance of quantum annealing, which evades the Landau-Zener transitions to navigate to the ground state of the final Hamiltonian with high probability. We optimize the annealing schedules starting from the polynomial ansatz by treating their coefficients as chromosomes of the genetic algorithm. We also explore shortcuts to adiabaticity by computing a practically feasible kkk-local optimal driving operator, showing that even for k=1k=1k=1 we achieve substantial improvement of the fidelity over the standard annealing solution. With these genetically optimized annealing schedules and/or optimal driving operators, we are able to perform quantum annealing in relatively short timescales and with higher fidelity compared to traditional approaches.
Adiabatic control is a fundamental technique for manipulating quantum systems, guided by the quantum adiabatic theorem, which ensures suppressed nonadiabatic transitions under slow parameter variations. Quantum annealing, a heuristic algorithm leveraging adiabatic control, seeks the ground states of Ising spin glass models and has drawn attention for addressing combinatorial optimization problems. However, exponentially small energy gaps in such models often necessitate impractically long runtime to satisfy the adiabatic condition. Despite this limitation, improving the quality of approximate solutions remains crucial for practical applications. The quantum adiabatic brachistochrone provides a method to enhance adiabaticity by minimizing an action representing nonadiabaticity via the variational principle. While effective, its implementation requires detailed energy spectra, complicating its use in quantum annealing. Shortcuts to adiabaticity by counterdiabatic driving offer alternative approaches for accelerating adiabatic processes. However, the theory of shortcuts to adiabaticity often faces challenges such as nonlocal control requirements, high computational cost, and trade-offs between speed and energy efficiency. In this work, we propose a novel quantum adiabatic brachistochrone protocol tailored for quantum annealing that eliminates the need for energy spectrum information. Our approach builds on advancements in counterdiabatic driving to design efficient parameter schedules. We demonstrate the effectiveness of our method through numerical simulations on the transverse-field Ising chain and axial next-nearest neighbor Ising models.
Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.
Diabatic quantum annealing with variationally optimized schedules can exhibit exponential speedups over conventional adiabatic quantum annealing, as was demonstrated numerically for a frustrated Ising ring model by C{ô}t{é} et al. Here we identify Landau-Zener-St{ü}ckelberg interference as the underlying mechanism for this speedup, and based on this insight we propose a variational schedule ansatz with far fewer parameters. This simplified ansatz allows us to show analytically that the classical optimization of the schedule parameters can be done in polynomial time and discuss conditions when we expect this type of mechanism to provide speedups over adiabatic annealing. Furthermore, we provide an analytical argument that coherence is an essential resource for this mechanism, which we verify numerically. We perform extensive numerical tests of the proposed ansatz and observe substantial improvements over adiabatic annealing and competitive performance in particularly challenging problem instances, including a well-studied MAXCUT instance commonly used for benchmarking. Our work shows that explicitly leveraging physical mechanisms can lead to more effective designs of variational annealing algorithms.