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

Adiabatic quantum computing from an eigenvalue dynamics point of view

Richard D. Wilson

Published Sep 6, 2011• 0 citations
OpenAlex

Abstract

We investigate the effects of a generic noise source on a prototypical adiabatic quantum algorithm. We take an alternative eigenvalue dynamics viewpoint and derive a generalised, stochastic form of the Pechukas-Yukawa model. The distribution of avoided crossings in the energy spectra is then analysed in order to estimate the probability of level occupation. \nWe find that the probability of successfully finding the system in the solution state decreases polynomially with the computation speed and that this relationship is independent of the noise amplitude. The overall regularity of the eigenvalue dynamics is shown to be relatively unaffected by noise perturbations. These results imply that adiabatic quantum computation is a relatively stable process and possesses a degree of resistance against the effects of noise. We also show that generic noise will inherently break any symmetries, and therefore remove degeneracies, in the energy spectrum that might otherwise have impeded the computation process. This suggests that the conventional stipulation that the initial and final Hamiltonians do not commute is unnecessary in realistic physical systems. We explore the effects of an artificial noise source with a specifically engineered time-dependent amplitude and show that such a scheme could provide a significant enhancement to the performance of the computation.\nFinally, we formulate an extended version of the Pechukas-Yukawa formalism. This provides a complete description of the dynamics of a quantum system by way of an exact mapping to a system of classical equations of motion.

Related papers

Noise-enhanced performance of adiabatic quantum computing by lifting degeneracies

R. D. Wilson, Alexandre M. Zagoskin, Sergey E. Savel'ev

We investigate the symmetry breaking role of noise in adiabatic quantum computing using the example of the controlled-not gate. In particular, we analyze situations where the choice of initial Hamiltonian produces symmetries in the Hamiltonian and degeneracies in the spectrum. We show that, in these situations, the conventional stipulation that the initial and problem Hamiltonians do not commute is unnecessary, as noise will inherently play the role of a universal symmetry-breaking perturbation and split any level crossings that may impede or obstruct the computation. The effects of an artificial noise source with a tailored time-dependent amplitude are also explored and it is found that such a scheme could offer a considerable performance enhancement. These results are found using a generalized version of the Pechukas-Yukawa model of eigenvalue dynamics.

arXiv:1002.2574•Physical Review A•Nov 24, 2010•6 citations

Pechukas-Yukawa formalism for Landau-Zener transitions in the presence of external noise

Mumnuna A. Qureshi, Johnny Q. Zhong, Peter Mason +2 more

Quantum systems are prone to decoherence due to both intrinsic interactions as well as random fluctuations from the environment. Using the Pechukas-Yukawa formalism, we investigate the influence of noise on the dynamics of an adiabatically evolving Hamiltonian which can describe a quantum computer. Under this description, the level dynamics of a parametrically perturbed quantum Hamiltonian are mapped to the dynamics of one-dimensional classical gas. We show that our framework coincides with the results of the classical Landau-Zener transitions upon linearization. Furthermore, we determine the effects of external noise on the level dynamics and its impact on Landau-Zener transitions.

arXiv:1803.05034•Physical Review A•Jul 23, 2018•3 citations

Stochastic quantum adiabatic algorithm with fractional Brownian motion

Osanda Chinthila, Pani W. Fernando, Anuradha Mahasinghe +2 more

Adiabatic Quantum Computing relies on the quantum adiabatic theorem, which states that a quantum system evolves along its ground state with time if the governing Hamiltonian varies infinitely slowly. However, practical limitations force computations to be performed within limited times, exposing the system to transitions into excited states, and thereby reducing the success probability. Here we investigate the counterintuitive hypothesis that incorporating stochastic noise, specifically noise driven by fractional Brownian motion, in a non-Markovian setup can enhance the performance of adiabatic quantum computing by improving its success probability at limited evolution times. The study begins by developing the mathematical framework to introduce stochastic noise multiplicatively into the Schrödinger equation, resulting in a stochastic Schrödinger equation. To preserve Itô integrability within the non-Markovian framework, a semimartingale approximation for fractional Brownian motion is employed. We perform numerical simulations to compare the performance of the quantum adiabatic algorithm with and without noise driven by fractional Brownian motion using the NP-complete Exact Cover-3 problem, transformed into the Ising model. Our results exhibit an improvement in success probability in the presence of noise driven by fractional Brownian motion with Hurst parameter $0

arXiv:2504.19801•Apr 28, 2025•1 citation

Adiabatic dynamics of entanglement

Einar Gabbassov, Achim Kempf

Abstract We show that, during adiabatic evolution, any changes in entanglement can be attributed to a succession of avoided energy level crossings at which eigenvalues swap their eigenvectors. These swaps mediate the generation and redistribution of entanglement in multipartite systems. The efficiency of this redistribution depends on the narrowness of the avoided level crossings and thus constrains the speed of adiabatic evolution. Moreover, we relate the amount of entanglement involved to the ruggedness of the energy landscape, which directly affects the hardness of a computational problem. This enables an analysis of computational complexity and quantum advantage from the point of view of entanglement requirements. Applied to adiabatic quantum computation, our findings directly relate the computation’s speed to its utilization of entanglement as a resource. The same principles extend to gate-based discretized adiabatic quantum algorithms, including those for Hamiltonian simulation and combinatorial optimization.

arXiv:2407.18301•Quantum Science and Technology•Sep 4, 2025•1 citation

Pechukas-Yukawa approach to the evolution of the quantum state of a parametrically perturbed system

Mumnuna A. Qureshi, Johnny Q. Zhong, Zihad Qureshi +3 more

We consider the evolution of the quantum states of a Hamiltonian that is parametrically perturbed via a term proportional to the adiabatic parameter $\ensuremath{\lambda}(t)$. Starting with the Pechukas-Yukawa mapping of the energy eigenvalue evolution in a generalized Calogero-Sutherland model of a one-dimensional classical gas, we consider the adiabatic approximation with two different expansions of the quantum state in powers of $d\ensuremath{\lambda}/dt$ and compare them with a direct numerical simulation. We show that one of these expansions (Magnus series) is especially convenient for the description of nonadiabatic evolution of the system. Applying the expansion to the exact cover 3-satisfiability problem, we obtain the occupation dynamics, which provides insight into the population of states and sources of decoherence in a quantum system.

arXiv:1706.05243•Physical Review A•Mar 16, 2018•3 citations

Random matrix approach to quantum adiabatic evolution algorithms

A. Boulatov, Vadim Smelyanskiy

We analyze the power of the quantum adiabatic evolution algorithm (QAA) for solving random computationally hard optimization problems within a theoretical framework based on random matrix theory (RMT). We present two types of driven RMT models. In the first model, the driving Hamiltonian is represented by Brownian motion in the matrix space. We use the Brownian motion model to obtain a description of multiple avoided crossing phenomena. We show that nonadiabatic corrections in the QAA are due to the interaction of the ground state with the ``cloud'' formed by most of the excited states, confirming that in driven RMT models, the Landau-Zener scenario of pairwise level repulsions is not relevant for the description of nonadiabatic corrections. We show that the QAA has a finite probability of success in a certain range of parameters, implying a polynomial complexity of the algorithm. The second model corresponds to the standard QAA with the problem Hamiltonian taken from the RMT Gaussian unitary ensemble (GUE). We show that the level dynamics in this model can be mapped onto the dynamics in the Brownian motion model. For this reason, the driven GUE model can also lead to polynomial complexity of the QAA. The main contribution to the failure probability of the QAA comes from the nonadiabatic corrections to the eigenstates, which only depend on the absolute values of the transition amplitudes. Due to the mapping between the two models, these absolute values are the same in both cases. Our results indicate that this ``phase irrelevance'' is the leading effect that can make both the Markovian- and GUE-type QAAs successful.

Physical Review A•May 6, 2005•4 citations
We investigate the effects of a generic noise source on a prototypical adiabatic quantum algorithm. We take an alternative eigenvalue dynamics viewpoint and derive a generalised, stochastic form of the Pechukas-Yukawa model. The distribution of avoided crossings in the energy spectra is then analysed in order to estimate the probability of level occupation. \nWe find that the probability of successfully finding the system in the solution state decreases polynomially with the computation speed and that this relationship is independent of the noise amplitude. The overall regularity of the eigenvalue dynamics is shown to be relatively unaffected by noise perturbations. These results imply that adiabatic quantum computation is a relatively stable process and possesses a degree of resistance against the effects of noise. We also show that generic noise will inherently break any symmetries, and therefore remove degeneracies, in the energy spectrum that might otherwise have impeded the computation process. This suggests that the conventional stipulation that the initial and final Hamiltonians do not commute is unnecessary in realistic physical systems. We explore the effects of an artificial noise source with a specifically engineered time-dependent amplitude and show that such a scheme could provide a significant enhancement to the performance of the computation.\nFinally, we formulate an extended version of the Pechukas-Yukawa formalism. This provides a complete description of the dynamics of a quantum system by way of an exact mapping to a system of classical equations of motion.
We investigate the symmetry breaking role of noise in adiabatic quantum computing using the example of the controlled-not gate. In particular, we analyze situations where the choice of initial Hamiltonian produces symmetries in the Hamiltonian and degeneracies in the spectrum. We show that, in these situations, the conventional stipulation that the initial and problem Hamiltonians do not commute is unnecessary, as noise will inherently play the role of a universal symmetry-breaking perturbation and split any level crossings that may impede or obstruct the computation. The effects of an artificial noise source with a tailored time-dependent amplitude are also explored and it is found that such a scheme could offer a considerable performance enhancement. These results are found using a generalized version of the Pechukas-Yukawa model of eigenvalue dynamics.
Quantum systems are prone to decoherence due to both intrinsic interactions as well as random fluctuations from the environment. Using the Pechukas-Yukawa formalism, we investigate the influence of noise on the dynamics of an adiabatically evolving Hamiltonian which can describe a quantum computer. Under this description, the level dynamics of a parametrically perturbed quantum Hamiltonian are mapped to the dynamics of one-dimensional classical gas. We show that our framework coincides with the results of the classical Landau-Zener transitions upon linearization. Furthermore, we determine the effects of external noise on the level dynamics and its impact on Landau-Zener transitions.
Adiabatic Quantum Computing relies on the quantum adiabatic theorem, which states that a quantum system evolves along its ground state with time if the governing Hamiltonian varies infinitely slowly. However, practical limitations force computations to be performed within limited times, exposing the system to transitions into excited states, and thereby reducing the success probability. Here we investigate the counterintuitive hypothesis that incorporating stochastic noise, specifically noise driven by fractional Brownian motion, in a non-Markovian setup can enhance the performance of adiabatic quantum computing by improving its success probability at limited evolution times. The study begins by developing the mathematical framework to introduce stochastic noise multiplicatively into the Schrödinger equation, resulting in a stochastic Schrödinger equation. To preserve Itô integrability within the non-Markovian framework, a semimartingale approximation for fractional Brownian motion is employed. We perform numerical simulations to compare the performance of the quantum adiabatic algorithm with and without noise driven by fractional Brownian motion using the NP-complete Exact Cover-3 problem, transformed into the Ising model. Our results exhibit an improvement in success probability in the presence of noise driven by fractional Brownian motion with Hurst parameter $0
Abstract We show that, during adiabatic evolution, any changes in entanglement can be attributed to a succession of avoided energy level crossings at which eigenvalues swap their eigenvectors. These swaps mediate the generation and redistribution of entanglement in multipartite systems. The efficiency of this redistribution depends on the narrowness of the avoided level crossings and thus constrains the speed of adiabatic evolution. Moreover, we relate the amount of entanglement involved to the ruggedness of the energy landscape, which directly affects the hardness of a computational problem. This enables an analysis of computational complexity and quantum advantage from the point of view of entanglement requirements. Applied to adiabatic quantum computation, our findings directly relate the computation’s speed to its utilization of entanglement as a resource. The same principles extend to gate-based discretized adiabatic quantum algorithms, including those for Hamiltonian simulation and combinatorial optimization.
We consider the evolution of the quantum states of a Hamiltonian that is parametrically perturbed via a term proportional to the adiabatic parameter $\ensuremath{\lambda}(t)$. Starting with the Pechukas-Yukawa mapping of the energy eigenvalue evolution in a generalized Calogero-Sutherland model of a one-dimensional classical gas, we consider the adiabatic approximation with two different expansions of the quantum state in powers of $d\ensuremath{\lambda}/dt$ and compare them with a direct numerical simulation. We show that one of these expansions (Magnus series) is especially convenient for the description of nonadiabatic evolution of the system. Applying the expansion to the exact cover 3-satisfiability problem, we obtain the occupation dynamics, which provides insight into the population of states and sources of decoherence in a quantum system.
We analyze the power of the quantum adiabatic evolution algorithm (QAA) for solving random computationally hard optimization problems within a theoretical framework based on random matrix theory (RMT). We present two types of driven RMT models. In the first model, the driving Hamiltonian is represented by Brownian motion in the matrix space. We use the Brownian motion model to obtain a description of multiple avoided crossing phenomena. We show that nonadiabatic corrections in the QAA are due to the interaction of the ground state with the ``cloud'' formed by most of the excited states, confirming that in driven RMT models, the Landau-Zener scenario of pairwise level repulsions is not relevant for the description of nonadiabatic corrections. We show that the QAA has a finite probability of success in a certain range of parameters, implying a polynomial complexity of the algorithm. The second model corresponds to the standard QAA with the problem Hamiltonian taken from the RMT Gaussian unitary ensemble (GUE). We show that the level dynamics in this model can be mapped onto the dynamics in the Brownian motion model. For this reason, the driven GUE model can also lead to polynomial complexity of the QAA. The main contribution to the failure probability of the QAA comes from the nonadiabatic corrections to the eigenstates, which only depend on the absolute values of the transition amplitudes. Due to the mapping between the two models, these absolute values are the same in both cases. Our results indicate that this ``phase irrelevance'' is the leading effect that can make both the Markovian- and GUE-type QAAs successful.