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:2310.15441 · Computational Mathematics and Mathematical Physics

Convergence Rate of Algorithm for Solving Linear Equations by Quantum Annealing

Sergey B. Tikhomirov, V. S. Shalgin

Published May 1, 2024• 0 citations
arXivHTMLPDF

Abstract

Various iterative algorithms for solving the linear equation $$ax = b$$ using a quantum computer operating on the principle of quantum annealing are studied. Assuming that the result produced by the computer is described by the Boltzmann distribution, conditions under which these algorithms converge are obtained and an estimate of their convergence rate is provided. Application of this approach for algorithms that use an infinite number of qubits and a small number of qubits is considered.

DOI
10.1134/s0965542524700325

Related papers

CONVERGENCE RATE OF ALGORITHM FOR SOLVING LINEAR EQUATIONS BY QUANTUM ANNEALING

Sergey B. Tikhomirov, V. S. Shalgin

Various iterative algorithms for solving the linear equation ax = b using a quantum computer operating on the principle of quantum annealing are studied. Assuming that the result produced by the computer is described by the Boltzmann distribution, conditions under which these algorithms converge are obtained and an estimate of their convergence rate is provided. Application of this approach for algorithms that use an infinite number of qubits and a small number of qubits is considered.

Журнал вычислительной математики и математической физики•Nov 16, 2024•1 citation

How viable is quantum annealing for solving linear algebra problems?

Ajinkya Borle, Samuel J. Lomonaco

With the increasing popularity of quantum computing and in particular quantum annealing, there has been growing research to evaluate the meta-heuristic for various problems in linear algebra: from linear least squares to matrix and tensor factorization. At the core of this effort is to evaluate quantum annealing for solving linear least squares and linear systems of equations. In this work, we focus on the viability of using quantum annealing for solving these problems. We use simulations based on the adiabatic principle to provide new insights for previously observed phenomena with the D-wave machines, such as quantum annealing being robust against ill-conditioned systems of equations and scaling quite well against the number of rows in a system. We then propose a hybrid approach which uses a quantum annealer to provide a initial guess of the solution $x_0$, which would then be iteratively improved with classical fixed point iteration methods.

arXiv:2206.10576•Jun 21, 2022•10 citations

Quantum annealing for systems of polynomial equations

Chia Cheng Chang, Arjun Singh Gambhir, Travis S. Humble +1 more

Abstract Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct matrix inversion or iteratively with judicious preconditioning. However, the convergence of iterative algorithms is highly variable and depends, in part, on the condition number. We present a direct method for solving general systems of polynomial equations based on quantum annealing, and we validate this method using a system of second-order polynomial equations solved on a commercially available quantum annealer. We then demonstrate applications for linear regression, and discuss in more detail the scaling behavior for general systems of linear equations with respect to problem size, condition number, and search precision. Finally, we define an iterative annealing process and demonstrate its efficacy in solving a linear system to a tolerance of 10−8.

arXiv:1812.06917•Scientific Reports•Jul 16, 2019•42 citations

Quantum Annealing for Electromagnetic Engineers—Part I: A computational method to solve various types of optimization problems.

Sangbin Lee, Qi Jian Lim, Charles Ross +5 more

It is well known that electromagnetic computations are computationally demanding. Interestingly, many such problems can be recast to be solved by quantum annealing. Quantum annealing, a kind of quantum computer, utilizes quantum tunneling for state transitions, which enables one to find the global minimum in a complex energy landscape. Part I of this article explains quantum annealing for the classical electromagnetic community, assuming little knowledge of quantum theory. It reviews the basic principle and recent advances in quantum annealing to extend its applications, such as a hybrid quantum-classical annealing algorithm. Part II presents various examples of electromagnetic problems that can be solved by quantum annealing. These are 1) optimization of a reconfigurable directional metasurface, 2) finding current distribution in an arbitrary wire antenna, 3) finding charge and field distributions in a static condition, and 4) optimization of source excitation to focus fields in hyperthermia. Lastly, the performance of the quantum annealer is compared with classical solvers to deduce the type of applications in which a quantum annealer of current technologies can be preferred in practice.

IEEE Antennas and Propagation Magazine•Dec 13, 2024•10 citations

Quantum Annealing Algorithm Optimization and Application

Jincheng Zhang

Quantum annealing (QA) is a promising quantum computing paradigm for solving optimization problems. However, the performance of QA is often limited by issues such as slow convergence rates and sensitivity to parameter settings. This paper presents a novel optimization method designed to address these limitations. The approach introduces refined parameters and an adaptive strategy to enhance the algorithm's convergence speed and solution accuracy. We explore the application of this optimized QA method to complex problems, demonstrating its potential for improved performance. The core of the optimization lies in modifying the annealing schedule and incorporating a dynamic adjustment of the magnetic field strength, denoted as $H(t)$, where $t$ represents time. The objective function to be minimized is typically represented as $E[s]$, where $s$ is the state vector of the quantum annealer. We introduce a variance reduction technique, denoted as $\sigma(t)$, which is dynamically adjusted based on the error estimates of the current state. The overall optimization process can be summarized as: $\min_{s} E[s] \quad \text{subject to} \quad \frac{dS}{dt} = - \beta(t) E[s] - \gamma(t) H(t)s$ where $\beta(t)$ is the annealing rate and $\gamma(t)$ is the magnetic field strength. The adaptive strategy involves updating $\beta(t)$ and $\gamma(t)$ based on the error in the current solution, aiming to reduce the variance $\sigma(t)$ and improve the convergence. The theoretical analysis suggests that this approach can significantly reduce the computational cost and improve the solution quality compared to traditional QA methods. Furthermore, we investigate the impact of different parameter settings on the algorithm's performance, highlighting the importance of careful tuning for optimal results. The results demonstrate a notable improvement in solution quality and convergence speed across various benchmark problems.

•Sep 3, 2026•0 citations

Quantum Algorithm for Linear Systems of Equations

Aram W. Harrow, Avinatan Hassidim, Seth Lloyd

Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix $A$ and a vector $\stackrel{\ensuremath{\rightarrow}}{b}$, find a vector $\stackrel{\ensuremath{\rightarrow}}{x}$ such that $A\stackrel{\ensuremath{\rightarrow}}{x}=\stackrel{\ensuremath{\rightarrow}}{b}$. We consider the case where one does not need to know the solution $\stackrel{\ensuremath{\rightarrow}}{x}$ itself, but rather an approximation of the expectation value of some operator associated with $\stackrel{\ensuremath{\rightarrow}}{x}$, e.g., ${\stackrel{\ensuremath{\rightarrow}}{x}}^{\ifmmode\dagger\else\textdagger\fi{}}M\stackrel{\ensuremath{\rightarrow}}{x}$ for some matrix $M$. In this case, when $A$ is sparse, $N\ifmmode\times\else\texttimes\fi{}N$ and has condition number $\ensuremath{\kappa}$, the fastest known classical algorithms can find $\stackrel{\ensuremath{\rightarrow}}{x}$ and estimate ${\stackrel{\ensuremath{\rightarrow}}{x}}^{\ifmmode\dagger\else\textdagger\fi{}}M\stackrel{\ensuremath{\rightarrow}}{x}$ in time scaling roughly as $N\sqrt{\ensuremath{\kappa}}$. Here, we exhibit a quantum algorithm for estimating ${\stackrel{\ensuremath{\rightarrow}}{x}}^{\ifmmode\dagger\else\textdagger\fi{}}M\stackrel{\ensuremath{\rightarrow}}{x}$ whose runtime is a polynomial of $\mathrm{log}(N)$ and $\ensuremath{\kappa}$. Indeed, for small values of $\ensuremath{\kappa}$ [i.e., $\mathrm{poly}\mathrm{log}(N)$], we prove (using some common complexity-theoretic assumptions) that any classical algorithm for this problem generically requires exponentially more time than our quantum algorithm.

arXiv:0811.3171•Physical Review Letters•Oct 7, 2009•3,798 citations
Various iterative algorithms for solving the linear equation ax=bax = bax=b using a quantum computer operating on the principle of quantum annealing are studied. Assuming that the result produced by the computer is described by the Boltzmann distribution, conditions under which these algorithms converge are obtained and an estimate of their convergence rate is provided. Application of this approach for algorithms that use an infinite number of qubits and a small number of qubits is considered.
With the increasing popularity of quantum computing and in particular quantum annealing, there has been growing research to evaluate the meta-heuristic for various problems in linear algebra: from linear least squares to matrix and tensor factorization. At the core of this effort is to evaluate quantum annealing for solving linear least squares and linear systems of equations. In this work, we focus on the viability of using quantum annealing for solving these problems. We use simulations based on the adiabatic principle to provide new insights for previously observed phenomena with the D-wave machines, such as quantum annealing being robust against ill-conditioned systems of equations and scaling quite well against the number of rows in a system. We then propose a hybrid approach which uses a quantum annealer to provide a initial guess of the solution x0x_0x0​, which would then be iteratively improved with classical fixed point iteration methods.
Abstract Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct matrix inversion or iteratively with judicious preconditioning. However, the convergence of iterative algorithms is highly variable and depends, in part, on the condition number. We present a direct method for solving general systems of polynomial equations based on quantum annealing, and we validate this method using a system of second-order polynomial equations solved on a commercially available quantum annealer. We then demonstrate applications for linear regression, and discuss in more detail the scaling behavior for general systems of linear equations with respect to problem size, condition number, and search precision. Finally, we define an iterative annealing process and demonstrate its efficacy in solving a linear system to a tolerance of 10−8.
It is well known that electromagnetic computations are computationally demanding. Interestingly, many such problems can be recast to be solved by quantum annealing. Quantum annealing, a kind of quantum computer, utilizes quantum tunneling for state transitions, which enables one to find the global minimum in a complex energy landscape. Part I of this article explains quantum annealing for the classical electromagnetic community, assuming little knowledge of quantum theory. It reviews the basic principle and recent advances in quantum annealing to extend its applications, such as a hybrid quantum-classical annealing algorithm. Part II presents various examples of electromagnetic problems that can be solved by quantum annealing. These are 1) optimization of a reconfigurable directional metasurface, 2) finding current distribution in an arbitrary wire antenna, 3) finding charge and field distributions in a static condition, and 4) optimization of source excitation to focus fields in hyperthermia. Lastly, the performance of the quantum annealer is compared with classical solvers to deduce the type of applications in which a quantum annealer of current technologies can be preferred in practice.
Quantum annealing (QA) is a promising quantum computing paradigm for solving optimization problems. However, the performance of QA is often limited by issues such as slow convergence rates and sensitivity to parameter settings. This paper presents a novel optimization method designed to address these limitations. The approach introduces refined parameters and an adaptive strategy to enhance the algorithm's convergence speed and solution accuracy. We explore the application of this optimized QA method to complex problems, demonstrating its potential for improved performance. The core of the optimization lies in modifying the annealing schedule and incorporating a dynamic adjustment of the magnetic field strength, denoted as H(t)H(t)H(t), where ttt represents time. The objective function to be minimized is typically represented as E[s]E[s]E[s], where sss is the state vector of the quantum annealer. We introduce a variance reduction technique, denoted as σ(t)\sigma(t)σ(t), which is dynamically adjusted based on the error estimates of the current state. The overall optimization process can be summarized as: min⁡sE[s]subject todSdt=−β(t)E[s]−γ(t)H(t)s\min_{s} E[s] \quad \text{subject to} \quad \frac{dS}{dt} = - \beta(t) E[s] - \gamma(t) H(t)smins​E[s]subject todtdS​=−β(t)E[s]−γ(t)H(t)s where β(t)\beta(t)β(t) is the annealing rate and γ(t)\gamma(t)γ(t) is the magnetic field strength. The adaptive strategy involves updating β(t)\beta(t)β(t) and γ(t)\gamma(t)γ(t) based on the error in the current solution, aiming to reduce the variance σ(t)\sigma(t)σ(t) and improve the convergence. The theoretical analysis suggests that this approach can significantly reduce the computational cost and improve the solution quality compared to traditional QA methods. Furthermore, we investigate the impact of different parameter settings on the algorithm's performance, highlighting the importance of careful tuning for optimal results. The results demonstrate a notable improvement in solution quality and convergence speed across various benchmark problems.
Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix AAA and a vector $\stackrel{\ensuremath{\rightarrow}}{b}$, find a vector $\stackrel{\ensuremath{\rightarrow}}{x}$ such that $A\stackrel{\ensuremath{\rightarrow}}{x}=\stackrel{\ensuremath{\rightarrow}}{b}$. We consider the case where one does not need to know the solution $\stackrel{\ensuremath{\rightarrow}}{x}$ itself, but rather an approximation of the expectation value of some operator associated with $\stackrel{\ensuremath{\rightarrow}}{x}$, e.g., ${\stackrel{\ensuremath{\rightarrow}}{x}}^{\ifmmode\dagger\else\textdagger\fi{}}M\stackrel{\ensuremath{\rightarrow}}{x}$ for some matrix MMM. In this case, when AAA is sparse, $N\ifmmode\times\else\texttimes\fi{}N$ and has condition number $\ensuremath{\kappa}$, the fastest known classical algorithms can find $\stackrel{\ensuremath{\rightarrow}}{x}$ and estimate ${\stackrel{\ensuremath{\rightarrow}}{x}}^{\ifmmode\dagger\else\textdagger\fi{}}M\stackrel{\ensuremath{\rightarrow}}{x}$ in time scaling roughly as $N\sqrt{\ensuremath{\kappa}}$. Here, we exhibit a quantum algorithm for estimating ${\stackrel{\ensuremath{\rightarrow}}{x}}^{\ifmmode\dagger\else\textdagger\fi{}}M\stackrel{\ensuremath{\rightarrow}}{x}$ whose runtime is a polynomial of log(N)\mathrm{log}(N)log(N) and $\ensuremath{\kappa}$. Indeed, for small values of $\ensuremath{\kappa}$ [i.e., polylog(N)\mathrm{poly}\mathrm{log}(N)polylog(N)], we prove (using some common complexity-theoretic assumptions) that any classical algorithm for this problem generically requires exponentially more time than our quantum algorithm.