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

Noise-enhanced performance of adiabatic quantum computing by lifting degeneracies

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

Published Nov 24, 2010• 6 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.82.052328

Related papers

Adiabatic quantum computing from an eigenvalue dynamics point of view

Richard D. Wilson

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.

•Sep 6, 2011•0 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

Adiabatic Quantum Computation in Open Systems

M. S. Sarandy, Daniel A. Lidar

We analyze the performance of adiabatic quantum computation (AQC) subject to decoherence. To this end, we introduce an inherently open-systems approach, based on a recent generalization of the adiabatic approximation. In contrast to closed systems, we show that a system may initially be in an adiabatic regime, but then undergo a transition to a regime where adiabaticity breaks down. As a consequence, the success of AQC depends sensitively on the competition between various pertinent rates, giving rise to optimality criteria.

arXiv:quant-ph/0502014•Physical Review Letters•Dec 16, 2005•230 citations

Adiabatic quantum optimization in the presence of discrete noise: Reducing the problem dimensionality

Salvatore Mandrà, Gian Giacomo Guerreschi, Alán Aspuru‐Guzik

Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the minimum energy gap encountered during the dynamics. Unfortunately, the direct calculation of the gap is strongly limited by the exponential growth in the dimensionality of the Hilbert space associated to the quantum system. Although many special-purpose methods have been devised to reduce the effective dimensionality, they are strongly limited to particular classes of problems with evident symmetries. Moreover, little is known about the computational power of adiabatic quantum optimizers in real-world conditions. Here we propose and implement a general purposes reduction method that does not rely on any explicit symmetry and which requires, under certain general conditions, only a polynomial amount of classical resources. Thanks to this method, we are able to analyze the performance of ``nonideal'' quantum adiabatic optimizers to solve the well-known Grover problem, namely the search of target entries in an unsorted database, in the presence of discrete local defects. In this case, we show that adiabatic quantum optimization, even if affected by random noise, is still potentially faster than any classical algorithm.

arXiv:1407.8183•Physical Review A•Dec 10, 2015•18 citations

The role of symmetries in adiabatic quantum algorithms

Gernot Schaller, Ralf Schützhold

Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to first-order transitions. Guided by simple examples we construct an alternative adiabatic algorithm for the NP-complete problem {\em Exact Cover 3}. We show numerically that its average performance (for the considered cases up to $\ord\{20\}$ qubits) is better than that of the conventional scheme. The run-time of adiabatic algorithms is not just determined by the minimum value of the fundamental energy gap (between the ground state and the exited states), but also by its curvature at the critical point. The proposed symmetry-restoring adiabatic quantum algorithm only contains contributions linear and quadratic in the Pauli matrices and can be generalized to other problem Hamiltonians which are decomposed of terms involving one and two qubits. We show how the factoring problem can be cast into such a quadratic form. These findings suggest that adiabatic quantum algorithms can solve a large class of NP problems much faster than the Grover search routine (which corresponds to a first-order transition and yields a quadratic enhancement only).

arXiv:0708.1882•Quantum Information and Computation•Jan 1, 2010•50 citations

An Alternative Approach to Construct the Initial Hamiltonian of the Adiabatic Quantum Computation

Qian-Heng Duan, Shuo Zhang, Wei Wu +1 more

The adiabatic quantum computation (AQC) has been proven to be equivalent to the standard circuit model. Conventionally, AQC evolves from the initial Hamiltonian which has a uniform equal superposition of the computational basis to the final Hamiltonian whose ground state encodes the solution to a computation problem. We propose an alternative approach to construct the initial Hamiltonian of the AQC which has an unequal superposition of the possible solutions to the problem and show that an educated guess can improve the performance of AQC.

Chinese Physics Letters•Jan 1, 2013•19 citations
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.
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.
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.
We analyze the performance of adiabatic quantum computation (AQC) subject to decoherence. To this end, we introduce an inherently open-systems approach, based on a recent generalization of the adiabatic approximation. In contrast to closed systems, we show that a system may initially be in an adiabatic regime, but then undergo a transition to a regime where adiabaticity breaks down. As a consequence, the success of AQC depends sensitively on the competition between various pertinent rates, giving rise to optimality criteria.
Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the minimum energy gap encountered during the dynamics. Unfortunately, the direct calculation of the gap is strongly limited by the exponential growth in the dimensionality of the Hilbert space associated to the quantum system. Although many special-purpose methods have been devised to reduce the effective dimensionality, they are strongly limited to particular classes of problems with evident symmetries. Moreover, little is known about the computational power of adiabatic quantum optimizers in real-world conditions. Here we propose and implement a general purposes reduction method that does not rely on any explicit symmetry and which requires, under certain general conditions, only a polynomial amount of classical resources. Thanks to this method, we are able to analyze the performance of ``nonideal'' quantum adiabatic optimizers to solve the well-known Grover problem, namely the search of target entries in an unsorted database, in the presence of discrete local defects. In this case, we show that adiabatic quantum optimization, even if affected by random noise, is still potentially faster than any classical algorithm.
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to first-order transitions. Guided by simple examples we construct an alternative adiabatic algorithm for the NP-complete problem {\em Exact Cover 3}. We show numerically that its average performance (for the considered cases up to $\ord\{20\}$ qubits) is better than that of the conventional scheme. The run-time of adiabatic algorithms is not just determined by the minimum value of the fundamental energy gap (between the ground state and the exited states), but also by its curvature at the critical point. The proposed symmetry-restoring adiabatic quantum algorithm only contains contributions linear and quadratic in the Pauli matrices and can be generalized to other problem Hamiltonians which are decomposed of terms involving one and two qubits. We show how the factoring problem can be cast into such a quadratic form. These findings suggest that adiabatic quantum algorithms can solve a large class of NP problems much faster than the Grover search routine (which corresponds to a first-order transition and yields a quadratic enhancement only).
The adiabatic quantum computation (AQC) has been proven to be equivalent to the standard circuit model. Conventionally, AQC evolves from the initial Hamiltonian which has a uniform equal superposition of the computational basis to the final Hamiltonian whose ground state encodes the solution to a computation problem. We propose an alternative approach to construct the initial Hamiltonian of the AQC which has an unequal superposition of the possible solutions to the problem and show that an educated guess can improve the performance of AQC.