The most famous quantum linear system solving algorithm is the Harrow-Hassidim-Lloyd (HHL) algorithm, which accelerates the solution of linear systems through quantum superposition and interference.

Grade school math students are likely familiar with teachers admonishing them not to just guess the answer to a problem. But a new proof establishes that, in fact, the right kind of guessing is ...

One breakthrough came in 2010, when Dominic Berry, now at Macquarie University in Sydney, built the first algorithm for solving linear differential equations exponentially faster on quantum, rather ...

Efficient algorithms can solve large, “N by N” systems (systems having N linear equations and N unknowns) by computer.

Based on the work of paper [1], we propose a modified Levenberg-Marquardt algoithm for solving singular system of nonlinear equations F (x) = 0, where F (x) : Rn → Rn is continuously differentiate and ...

A sequential algorithm for solving a system of nonlinear equations based on the number-theoretic method is proposed. In order to illustrate the effectiveness of the method, the following two problems ...

This algorithm is based on a combination of Variational Quantum Algorithms (VQA) and the classical shadow framework, overcoming the hardware resource bottlenecks of traditional quantum linear solver ...