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

Physica E Low-dimensional Systems and Nanostructures

Quantum ferromagnetic annealing

Sei Suzuki, Hidetoshi Nishimori

Published Jun 18, 2007• 0 citations
Publisher
DOI
10.1016/j.physe.2007.06.024

Related papers

Quantum annealing by ferromagnetic interaction with the mean-field scheme

Sei Suzuki, Hidetoshi Nishimori

Physica A Statistical Mechanics and its Applications•Apr 30, 2007•3 citations

When quantum relaxation benefits quantum annealing: a case study of ferromagnetic chains with alternating sectors

Anurag Mishra, Daniel A. Lidar, Tameem Albash

APS•Jan 1, 2018•0 citations

Direct comparison of quantum and simulated annealing on a fully-connected Ising ferromagnet

秀稔 西森, Hidetoshi Nishimori

•Aug 1, 2017•0 citations

Quantum annealing of the random-field Ising model by transverse ferromagnetic interactions

正 鈴木, Sei Suzuki, 秀稔 西森 +2 more

•May 1, 2007•0 citations

Quantum annealing of the random-field Ising model by transverse ferromagnetic interactions

Sei Suzuki, Hidetoshi Nishimori, Masuo Suzuki

We introduce transverse ferromagnetic interactions, in addition to a simple transverse field, to accelerate the convergence of quantum annealing of the random-field Ising model. The conventional approach using only the transverse-field term is known to be plagued by slow convergence when the true ground state has strong ferromagnetic characteristics for the random-field Ising model. The transverse ferromagnetic interactions are shown to improve the performance significantly in such cases. This conclusion is drawn from the analyses of the energy eigenvalues of instantaneous stationary states as well as by the very fast algorithm of Bethe-type mean-field annealing adopted to quantum systems. The present study highlights the importance of a flexible choice of the type of quantum fluctuations to achieve the best possible performance in quantum annealing. The existence of such flexibility is an outstanding advantage of quantum annealing over simulated annealing.

arXiv:quant-ph/0702214•Physical Review E•May 16, 2007•36 citations

Inter-generational comparison of quantum annealers in solving hard scheduling problems

Bibek Pokharel, Zoe Gonzalez Izquierdo, P. Aaron Lott +6 more

Abstract We compare the performance of four quantum annealers, the D-Wave Two, 2X, 2000Q, and Advantage in solving an identical ensemble of a parametrized family of scheduling problems. These problems are NP-complete and, in fact, equivalent to vertex coloring problems. They are also practically motivated and closely connected to planning problems from artificial intelligence. We examine factors contributing to the performance differences while separating the contributions from hardware upgrades, support for shorter anneal times, and possible optimization of ferromagnetic couplings. While shorter anneal times can improve the time to solution (TTS) at any given problem size, the scaling of TTS with respect to the problem size worsens for shorter anneal times. In contrast, optimizing the ferromagnetic coupling improves both the absolute TTS and the scaling. There is a statistically significant improvement in performance between D-Wave Two and 2X and from all older generation annealers to Advantage, even when operated under identical anneal time and ferromagnetic couplings. However, the performance improvement from 2X to 2000Q requires the anneal time and ferromagnetic couplings to be optimized. Overall, owing to these inter-generational hardware improvements and optimizations, the scaling exponent reduces from $$1.01 \pm 0.01$$ 1.01 ± 0.01 on Two to $$0.259 \pm 0.008$$ 0.259 ± 0.008 on Advantage.

arXiv:2112.00727•Quantum Information Processing•Oct 4, 2023•5 citations
We introduce transverse ferromagnetic interactions, in addition to a simple transverse field, to accelerate the convergence of quantum annealing of the random-field Ising model. The conventional approach using only the transverse-field term is known to be plagued by slow convergence when the true ground state has strong ferromagnetic characteristics for the random-field Ising model. The transverse ferromagnetic interactions are shown to improve the performance significantly in such cases. This conclusion is drawn from the analyses of the energy eigenvalues of instantaneous stationary states as well as by the very fast algorithm of Bethe-type mean-field annealing adopted to quantum systems. The present study highlights the importance of a flexible choice of the type of quantum fluctuations to achieve the best possible performance in quantum annealing. The existence of such flexibility is an outstanding advantage of quantum annealing over simulated annealing.
Abstract We compare the performance of four quantum annealers, the D-Wave Two, 2X, 2000Q, and Advantage in solving an identical ensemble of a parametrized family of scheduling problems. These problems are NP-complete and, in fact, equivalent to vertex coloring problems. They are also practically motivated and closely connected to planning problems from artificial intelligence. We examine factors contributing to the performance differences while separating the contributions from hardware upgrades, support for shorter anneal times, and possible optimization of ferromagnetic couplings. While shorter anneal times can improve the time to solution (TTS) at any given problem size, the scaling of TTS with respect to the problem size worsens for shorter anneal times. In contrast, optimizing the ferromagnetic coupling improves both the absolute TTS and the scaling. There is a statistically significant improvement in performance between D-Wave Two and 2X and from all older generation annealers to Advantage, even when operated under identical anneal time and ferromagnetic couplings. However, the performance improvement from 2X to 2000Q requires the anneal time and ferromagnetic couplings to be optimized. Overall, owing to these inter-generational hardware improvements and optimizations, the scaling exponent reduces from 1.01±0.011.01 \pm 0.011.01±0.01 1.01 ± 0.01 on Two to 0.259±0.0080.259 \pm 0.0080.259±0.008 0.259 ± 0.008 on Advantage.