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.11091 · Quantum Science and Technology

Inhomogeneous driving in quantum annealers can result in orders-of-magnitude improvements in performance

Juan I. Adame, Peter L. McMahon

Published May 14, 2020• 52 citations
arXivHTMLPDF

Abstract

Abstract Quantum annealers are special-purpose quantum computers that primarily target solving Ising optimization problems. Theoretical work has predicted that the probability of a quantum annealer ending in a ground state can be dramatically improved if the spin driving terms, which play a crucial role in the functioning of a quantum annealer, have different strengths for different spins; that is, they are inhomogeneous. In this paper we describe a time-shift-based protocol for inhomogeneous driving and demonstrate, using an experimental quantum annealer, the performance of our protocol on a range of hard Ising problems that have been well-studied in the literature. Compared to the homogeneous-driving case, we find that we are able to improve the probability of finding a ground state by up to 10 7 × for Weak–Strong–Cluster problem instances, and by up to 10 3 × for more general spin-glass problem instances. In addition to being of practical interest as a heuristic speedup method, inhomogeneous driving may also serve as a useful tool for investigations into the physics of experimental quantum annealers.

DOI
10.1088/2058-9565/ab935a

Related papers

Advantages of Unfair Quantum Ground-State Sampling

Brian Hu Zhang, Gene Wagenbreth, Víctor Martín-Mayor +1 more

The debate around the potential superiority of quantum annealers over their classical counterparts has been ongoing since the inception of the field. Recent technological breakthroughs, which have led to the manufacture of experimental prototypes of quantum annealing optimizers with sizes approaching the practical regime, have reignited this discussion. However, the demonstration of quantum annealing speedups remains to this day an elusive albeit coveted goal. We examine the power of quantum annealers to provide a different type of quantum enhancement of practical relevance, namely, their ability to serve as useful samplers from the ground-state manifolds of combinatorial optimization problems. We study, both numerically by simulating stoquastic and non-stoquastic quantum annealing processes, and experimentally, using a prototypical quantum annealing processor, the ability of quantum annealers to sample the ground-states of spin glasses differently than thermal samplers. We demonstrate that (i) quantum annealers sample the ground-state manifolds of spin glasses very differently than thermal optimizers (ii) the nature of the quantum fluctuations driving the annealing process has a decisive effect on the final distribution, and (iii) the experimental quantum annealer samples ground-state manifolds significantly differently than thermal and ideal quantum annealers. We illustrate how quantum annealers may serve as powerful tools when complementing standard sampling algorithms.

arXiv:1701.01524•Scientific Reports•Apr 13, 2017•27 citations

Nonstoquastic Hamiltonians and quantum annealing of an Ising spin glass

Layla Hormozi, Ethan Brown, Giuseppe Carleo +1 more

Quantum annealers are computing machines that utilize quantum effects to solve hard optimization problems. Understanding the circumstances under which quantum annealers are more efficient than other optimization methods is a challenging open problem. A clue to this conundrum comes from studying the complexity of quantum annealers. In general, the complexity of a physical system relates to how efficiently the system can be simulated by classical algorithms. One then asks: if some class of quantum annealers are hard to simulate classically, are they also more powerful optimization machines? Here, the authors study quantum annealers belonging to two different complexity classes: the so-called ``stoquastic'' systems, which can be efficiently simulated with classical algorithms, and ``nonstoquastic'' systems, currently with no efficient classical treatment. Applied to a prototypical optimization problem, the authors observe that, on average, the stoquastic systems perform better on easier instances of the problem, while the more complex nonstoquastic annealers show significant advantage when applied to the hardest instances. The authors conjecture that the performance of the nonstoquastic Hamiltonians is closely related to their internal structure during the annealing process and elucidate how properties such as magnetic frustration can play a key role in devising more powerful quantum annealers.

arXiv:1609.06558•Physical review. B./Physical review. B•May 15, 2017•109 citations

Quantum annealing of the p -spin model under inhomogeneous transverse field driving

Yuki Susa, Yu Yamashiro, Masayuki Yamamoto +3 more

We solve the mean-field-like $p$-spin Ising model under a spatiotemporal inhomogeneous transverse field to study the effects of inhomogeneity on the performance of quantum annealing. We previously found that the problematic first-order quantum phase transition that arises under the conventional homogeneous field protocol can be avoided if the temperature is zero and the local field is completely turned off site by site after a finite time. We show in the present paper that, when these ideal conditions are not satisfied, another series of first-order transitions appear, which prevents us from driving the system while avoiding first-order transitions. Nevertheless, under these nonideal conditions, quantitative improvements can be obtained in terms of narrower tunneling barriers in the free-energy landscape. A comparison with classical simulated annealing establishes a limited quantum advantage in the ideal case, since inhomogeneous temperature driving in simulated annealing cannot remove a first-order transition, in contrast to the quantum case. The classical model of spin-vector Monte Carlo is also analyzed, and we find it to have the same thermodynamic phase diagram as the quantum model in the ideal case, with deviations arising at nonzero temperature.

arXiv:1808.01582•Physical Review A•Oct 18, 2018•62 citations

Quantum annealing correction for random Ising problems

Kristen L. Pudenz, Tameem Albash, Daniel A. Lidar

We demonstrate that the performance of a quantum annealer on hard random Ising optimization problems can be substantially improved using quantum annealing correction (QAC). Our error correction strategy is tailored to the D-Wave Two device. We find that QAC provides a statistically significant enhancement in the performance of the device over a classical repetition code, improving as a function of problem size as well as hardness. Moreover, QAC provides a mechanism for overcoming the precision limit of the device, in addition to correcting calibration errors. Performance is robust even to missing qubits. We present evidence for a constructive role played by quantum effects in our experiments by contrasting the experimental results with the predictions of a classical model of the device. Our work demonstrates the importance of error correction in appropriately determining the performance of quantum annealers.

arXiv:1408.4382•Physical Review A•Apr 2, 2015•102 citations

Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods

Hamed Karimi, Gili Rosenberg, Helmut G. Katzgraber

We present and apply a general-purpose, multistart algorithm for improving the performance of low-energy samplers used for solving optimization problems. The algorithm iteratively fixes the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are smaller and less connected, and samplers tend to give better low-energy samples for these problems. The algorithm is trivially parallelizable since each start in the multistart algorithm is independent, and could be applied to any heuristic solver that can be run multiple times to give a sample. We present results for several classes of hard problems solved using simulated annealing, path-integral quantum Monte Carlo, parallel tempering with isoenergetic cluster moves, and a quantum annealer, and show that the success metrics and the scaling are improved substantially. When combined with this algorithm, the quantum annealer's scaling was substantially improved for native Chimera graph problems. In addition, with this algorithm the scaling of the time to solution of the quantum annealer is comparable to the Hamze-de Freitas-Selby algorithm on the weak-strong cluster problems introduced by Boixo et al. Parallel tempering with isoenergetic cluster moves was able to consistently solve three-dimensional spin glass problems with 8000 variables when combined with our method, whereas without our method it could not solve any.

arXiv:1706.07826•Physical review. E•Oct 31, 2017•38 citations

Unraveling Quantum Annealers using Classical Hardness

Víctor Martín-Mayor, Itay Hen

Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealing optimizers that contain hundreds of quantum bits. These optimizers, commonly referred to as 'D-Wave' chips, promise to solve practical optimization problems potentially faster than conventional 'classical' computers. Attempts to quantify the quantum nature of these chips have been met with both excitement and skepticism but have also brought up numerous fundamental questions pertaining to the distinguishability of experimental quantum annealers from their classical thermal counterparts. Inspired by recent results in spin-glass theory that recognize 'temperature chaos' as the underlying mechanism responsible for the computational intractability of hard optimization problems, we devise a general method to quantify the performance of quantum annealers on optimization problems suffering from varying degrees of temperature chaos: A superior performance of quantum annealers over classical algorithms on these may allude to the role that quantum effects play in providing speedup. We utilize our method to experimentally study the D-Wave Two chip on different temperature-chaotic problems and find, surprisingly, that its performance scales unfavorably as compared to several analogous classical algorithms. We detect, quantify and discuss several purely classical effects that possibly mask the quantum behavior of the chip.

arXiv:1502.02494•Scientific Reports•Oct 20, 2015•75 citations
Abstract Quantum annealers are special-purpose quantum computers that primarily target solving Ising optimization problems. Theoretical work has predicted that the probability of a quantum annealer ending in a ground state can be dramatically improved if the spin driving terms, which play a crucial role in the functioning of a quantum annealer, have different strengths for different spins; that is, they are inhomogeneous. In this paper we describe a time-shift-based protocol for inhomogeneous driving and demonstrate, using an experimental quantum annealer, the performance of our protocol on a range of hard Ising problems that have been well-studied in the literature. Compared to the homogeneous-driving case, we find that we are able to improve the probability of finding a ground state by up to 10 7 × for Weak–Strong–Cluster problem instances, and by up to 10 3 × for more general spin-glass problem instances. In addition to being of practical interest as a heuristic speedup method, inhomogeneous driving may also serve as a useful tool for investigations into the physics of experimental quantum annealers.
The debate around the potential superiority of quantum annealers over their classical counterparts has been ongoing since the inception of the field. Recent technological breakthroughs, which have led to the manufacture of experimental prototypes of quantum annealing optimizers with sizes approaching the practical regime, have reignited this discussion. However, the demonstration of quantum annealing speedups remains to this day an elusive albeit coveted goal. We examine the power of quantum annealers to provide a different type of quantum enhancement of practical relevance, namely, their ability to serve as useful samplers from the ground-state manifolds of combinatorial optimization problems. We study, both numerically by simulating stoquastic and non-stoquastic quantum annealing processes, and experimentally, using a prototypical quantum annealing processor, the ability of quantum annealers to sample the ground-states of spin glasses differently than thermal samplers. We demonstrate that (i) quantum annealers sample the ground-state manifolds of spin glasses very differently than thermal optimizers (ii) the nature of the quantum fluctuations driving the annealing process has a decisive effect on the final distribution, and (iii) the experimental quantum annealer samples ground-state manifolds significantly differently than thermal and ideal quantum annealers. We illustrate how quantum annealers may serve as powerful tools when complementing standard sampling algorithms.
Quantum annealers are computing machines that utilize quantum effects to solve hard optimization problems. Understanding the circumstances under which quantum annealers are more efficient than other optimization methods is a challenging open problem. A clue to this conundrum comes from studying the complexity of quantum annealers. In general, the complexity of a physical system relates to how efficiently the system can be simulated by classical algorithms. One then asks: if some class of quantum annealers are hard to simulate classically, are they also more powerful optimization machines? Here, the authors study quantum annealers belonging to two different complexity classes: the so-called ``stoquastic'' systems, which can be efficiently simulated with classical algorithms, and ``nonstoquastic'' systems, currently with no efficient classical treatment. Applied to a prototypical optimization problem, the authors observe that, on average, the stoquastic systems perform better on easier instances of the problem, while the more complex nonstoquastic annealers show significant advantage when applied to the hardest instances. The authors conjecture that the performance of the nonstoquastic Hamiltonians is closely related to their internal structure during the annealing process and elucidate how properties such as magnetic frustration can play a key role in devising more powerful quantum annealers.
We solve the mean-field-like ppp-spin Ising model under a spatiotemporal inhomogeneous transverse field to study the effects of inhomogeneity on the performance of quantum annealing. We previously found that the problematic first-order quantum phase transition that arises under the conventional homogeneous field protocol can be avoided if the temperature is zero and the local field is completely turned off site by site after a finite time. We show in the present paper that, when these ideal conditions are not satisfied, another series of first-order transitions appear, which prevents us from driving the system while avoiding first-order transitions. Nevertheless, under these nonideal conditions, quantitative improvements can be obtained in terms of narrower tunneling barriers in the free-energy landscape. A comparison with classical simulated annealing establishes a limited quantum advantage in the ideal case, since inhomogeneous temperature driving in simulated annealing cannot remove a first-order transition, in contrast to the quantum case. The classical model of spin-vector Monte Carlo is also analyzed, and we find it to have the same thermodynamic phase diagram as the quantum model in the ideal case, with deviations arising at nonzero temperature.
We demonstrate that the performance of a quantum annealer on hard random Ising optimization problems can be substantially improved using quantum annealing correction (QAC). Our error correction strategy is tailored to the D-Wave Two device. We find that QAC provides a statistically significant enhancement in the performance of the device over a classical repetition code, improving as a function of problem size as well as hardness. Moreover, QAC provides a mechanism for overcoming the precision limit of the device, in addition to correcting calibration errors. Performance is robust even to missing qubits. We present evidence for a constructive role played by quantum effects in our experiments by contrasting the experimental results with the predictions of a classical model of the device. Our work demonstrates the importance of error correction in appropriately determining the performance of quantum annealers.
We present and apply a general-purpose, multistart algorithm for improving the performance of low-energy samplers used for solving optimization problems. The algorithm iteratively fixes the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are smaller and less connected, and samplers tend to give better low-energy samples for these problems. The algorithm is trivially parallelizable since each start in the multistart algorithm is independent, and could be applied to any heuristic solver that can be run multiple times to give a sample. We present results for several classes of hard problems solved using simulated annealing, path-integral quantum Monte Carlo, parallel tempering with isoenergetic cluster moves, and a quantum annealer, and show that the success metrics and the scaling are improved substantially. When combined with this algorithm, the quantum annealer's scaling was substantially improved for native Chimera graph problems. In addition, with this algorithm the scaling of the time to solution of the quantum annealer is comparable to the Hamze-de Freitas-Selby algorithm on the weak-strong cluster problems introduced by Boixo et al. Parallel tempering with isoenergetic cluster moves was able to consistently solve three-dimensional spin glass problems with 8000 variables when combined with our method, whereas without our method it could not solve any.
Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealing optimizers that contain hundreds of quantum bits. These optimizers, commonly referred to as 'D-Wave' chips, promise to solve practical optimization problems potentially faster than conventional 'classical' computers. Attempts to quantify the quantum nature of these chips have been met with both excitement and skepticism but have also brought up numerous fundamental questions pertaining to the distinguishability of experimental quantum annealers from their classical thermal counterparts. Inspired by recent results in spin-glass theory that recognize 'temperature chaos' as the underlying mechanism responsible for the computational intractability of hard optimization problems, we devise a general method to quantify the performance of quantum annealers on optimization problems suffering from varying degrees of temperature chaos: A superior performance of quantum annealers over classical algorithms on these may allude to the role that quantum effects play in providing speedup. We utilize our method to experimentally study the D-Wave Two chip on different temperature-chaotic problems and find, surprisingly, that its performance scales unfavorably as compared to several analogous classical algorithms. We detect, quantify and discuss several purely classical effects that possibly mask the quantum behavior of the chip.