Rigorous convergence condition for quantum annealing
نویسندگان
چکیده
We derive a generic bound on the rate of decrease transverse field for quantum annealing to converge ground state Ising model when is formulated as an infinite-time process. Our theorem based rigorous upper excitation probability in limit and mathematically counterpart previously known result derived only from leading-order term asymptotic expansion adiabatic condition. Since our gives sufficient condition convergence transverse-field model, any specific problem may allow better, faster, control coefficient.
منابع مشابه
Convergence theorems for quantum annealing
Abstract. We prove several theorems to give sufficient conditions for convergence of quantum annealing, which is a protocol to solve generic optimization problems by quantum dynamics. In particular the property of strong ergodicity is proved for the path-integral Monte Carlo implementation of quantum annealing for the transverse Ising model under a power decay of the transverse field. This resu...
متن کاملConvergence of Quantum Annealing with Real-Time Schrödinger Dynamics
Convergence conditions for quantum annealing are derived for optimization problems represented by the Ising model of a general form. Quantum fluctuations are introduced as a transverse field and/or transverse ferromagnetic interactions, and the time evolution follows the real-time Schrödinger equation. It is shown that the system stays arbitrarily close to the instantaneous ground state, finall...
متن کاملFaster Annealing Schedules for Quantum Annealing
New annealing schedules for quantum annealing are proposed based on the adiabatic theorem. These schedules exhibit faster decrease of the excitation probability than a linear schedule. To derive this conclusion, the asymptotic form of the excitation probability for quantum annealing is explicitly obtained in the limit of long annealing time. Its first-order term, which is inversely proportional...
متن کاملQuantum Annealing for Clustering
This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an annealing schedule, which is crucial in practice. Experiments show the proposed QA algorithm finds better clustering assignments than SA. Furthermore, QA is as easy as SA to implement.
متن کاملQuantum annealing
Quantum annealing Quantum annealing (also known as alloy, crystallization or tempering) is analogous to simulated annealing but in substitution of thermal activation by quantum tunneling. The class of algorithmic methods for quantum annealing (dubbed: 'QA'), sometimes referred by the italian school as Quantum Stochastic Optimization ('QSO'), is a promising metaheuristic tool for solving local s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A
سال: 2022
ISSN: ['1751-8113', '1751-8121']
DOI: https://doi.org/10.1088/1751-8121/ac9dce