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

Applications of Mathematics

A regularization method based on HHL quantum algorithm and Levenberg-Marquardt method

Amir Hossein Salehi Shayegan, Laya Dejam

Published Sep 8, 2026• 0 citations
Publisher

Abstract

summary:To achieve exponential speed-up with the Harrow-Hassidim-Lloyd (HHL) quantum algorithm, the condition number of the matrix can scale at most poly-logarithmically with its size. This quantum algorithm significantly outperforms the best classical methods for solving well-conditioned linear systems of equations. However, well-conditioning is a stringent requirement that severely limits the range of problems benefiting from exponential speed-up. In this paper, we introduce a regularization method that combines the HHL quantum algorithm with the Levenberg-Marquardt method to mitigate ill-conditioning and enable exponential speed-up. Specifically, the Levenberg-Marquardt method acts as a regularization method, transforming an ill-conditioned linear system of equations into a sequence of well-conditioned linear systems of equations. The HHL quantum algorithm is then applied to solve these systems efficiently. This approach effectively addresses the ill-conditioning issue while preserving the exponential speed-up advantage.

DOI
10.21136/am.2026.0193-25

Related papers

Optimised Hybrid Classical-Quantum Algorithm for Accelerated Solution of Sparse Linear Systems Optimised Hybrid Classical-Quantum Algorithm for Accelerated Solution of Sparse Linear Systems: A Detailed Mathematical Integration of CUDA-Accelerated Preconditioning and the Quantum HHL Algorithm

Hakikat Singh

Efficiently solving large-scale sparse linear systems poses a significant challenge in computational science, especially in fields such as physics, engineering, machine learning, and finance. Traditional classical algorithms face scalability issues as the size of these systems increases, leading to performance degradation. On the other hand, quantum algorithms, like the Harrow-Hassidim-Lloyd (HHL) algorithm, offer exponential speedups for solving linear systems, yet they are constrained by the current state of quantum hardware and sensitivity to matrix condition numbers. This paper introduces a hybrid classical-quantum algorithm that combines CUDA-accelerated preconditioning techniques with the HHL algorithm to solve sparse linear systems more efficiently. The classical GPU parallelism is utilised to preprocess and precondition the matrix, reducing its condition number, while quantum computing is employed to solve the preconditioned system using the HHL algorithm. Additionally, the algorithm integrates machine learning models, particularly reinforcement learning, to dynamically optimise system parameters, such as block sizes and preconditioning stratgies, based on real-time performance data. Our experimental results show that the proposed approach not only surpasses traditional methods in speed and scalability but also mitigates some of the inherent limitations of quantum algorithms. This work pushes the boundaries of efficient computing and provides a foundation for future advancements in hybrid computational frameworks.

arXiv:2410.02408•Jan 1, 2024•0 citations

Quantum linear systems algorithms: a primer

Danial Dervovic, Mark Herbster, Peter Mountney +3 more

The Harrow-Hassidim-Lloyd (HHL) quantum algorithm for sampling from the solution of a linear system provides an exponential speed-up over its classical counterpart. The problem of solving a system of linear equations has a wide scope of applications, and thus HHL constitutes an important algorithmic primitive. In these notes, we present the HHL algorithm and its improved versions in detail, including explanations of the constituent sub- routines. More specifically, we discuss various quantum subroutines such as quantum phase estimation and amplitude amplification, as well as the important question of loading data into a quantum computer, via quantum RAM. The improvements to the original algorithm exploit variable-time amplitude amplification as well as a method for implementing linear combinations of unitary operations (LCUs) based on a decomposition of the operators using Fourier and Chebyshev series. Finally, we discuss a linear solver based on the quantum singular value estimation (QSVE) subroutine.

arXiv:1802.08227•Feb 22, 2018•140 citations

Solving the encoding bottleneck: of the HHL algorithm, by the HHL algorithm

Guang Ping He

The Harrow-Hassidim-Lloyd (HHL) algorithm offers exponential speedup for solving the quantum linear-system problem. But some caveats for the speedup could be hard to met. One of the difficulties is the encoding bottleneck, i.e., the efficient preparation of the initial quantum state. To prepare an arbitrary $N$-dimensional state exactly, existing state-preparation approaches generally require a runtime of $O(N)$, which will ruin the speedup of the HHL algorithm. Here we show that the states can be prepared approximately with a runtime of $O(poly(\log N))$ by employing a slightly modified version of the HHL algorithm itself. Thus, applying this approach to prepare the initial state of the original HHL algorithm can preserve the exponential speedup advantage. It can also serve as a standalone solution for other applications demanding fast state preparation.

arXiv:2502.13534•Feb 19, 2025•2 citations

An Iterative Improvement Method for HHL algorithm for Solving Linear System of Equations

Yoshiyuki Saito, Xinwei Lee, Dongsheng Cai +1 more

We propose an iterative improvement method for the Harrow-Hassidim-Lloyd (HHL) algorithm to solve a linear system of equations. This is a quantum-classical hybrid algorithm. The accuracy is essential to solve the linear system of equations. However, the accuracy of the HHL algorithm is limited by the number of quantum bits used to express the eigenvalues of the matrix. Our iterative method improves the accuracy of the HHL solutions, and gives higher accuracy which surpasses the accuracy limited by the number of quantum bits. In practical HHL algorithm, a huge number of measurements is required to obtain good accuracy, even if we provide a sufficient number of quantum bits for the eigenvalue expression, since the solution is statistically processed from the measurements. Our improved iterative method can reduce the number of measurements. Moreover, the sign information for each eigenstate of the solution is lost once the measurement is made, although the sign is significant. Therefore, the naïve iterative method of the HHL algorithm may slow down, especially, when the solution includes wrong signs. In this paper, we propose and evaluate an improved iterative method for the HHL algorithm that is robust against the sign information loss, in terms of the number of iterations and the computational accuracy.

arXiv:2108.07744•Aug 17, 2021•10 citations

Quantum-Enhanced DC Optimal Power Flow

Farshad Amani, Reza Mahroo, Amin Kargarian

Harrow-Hassidim-Lloyd (HHL) is a quantum computation algorithm that can solve a system of linear equations in a logarithmic time scale; hence, an exponential speed-up over best-known classical computers, which have polynomial time complexity, is accessible. This paper studies the integration of HHL into the DC optimal power flow problem. Optimality conditions are formulated as a system of equations in the form of $Ax=b$ that is solved by HHL. The performance of HHL for A-matrices appearing in DCOPF problems is discussed. The initialization of HHL for encoding data from classical data to a quantum state in an efficient manner is also investigated. The impact of HHL calculation error on DCOPF convergence and solution accuracy is analyzed. Qiskit module is used to test the HHL-based DCOPF problem on a 3-bus system. The impact of quantum computers and HHL errors on DCOPF is simulated for the IEEE 14- bus system.

IEEE Texas Power and Energy Conference (TPEC)•Feb 13, 2023•18 citations

Quantum linear system solvers: A survey of algorithms and applications

Mauro E. S. Morales, Lirandë Pira, Philipp Schleich +7 more

Solving linear systems of equations plays a fundamental role in numerous computational problems from different fields of science. The widespread use of numerical methods to solve these systems motivates investigating the feasibility of solving linear systems problems using quantum computers. In this work, we provide a survey of the main advances in quantum linear systems algorithms, together with some applications. We summarize and analyze the main ideas behind some of the algorithms for the quantum linear systems problem in the literature. The analysis begins by examining the Harrow-Hassidim-Lloyd (HHL) solver. We note its limitations and reliance on computationally expensive quantum methods, then highlight subsequent research efforts which aimed to address these limitations and optimize runtime efficiency and precision via various paradigms. We focus in particular on the post-HHL enhancements which have paved the way towards optimal lower bounds with respect to error tolerance and condition number. By doing so, we propose a taxonomy that categorizes these studies. Furthermore, by contextualizing these developments within the broader landscape of quantum computing, we explore the foundational work that have inspired and informed their development, as well as subsequent refinements. Finally, we discuss the potential applications of these algorithms in differential equations, quantum machine learning, and many-body physics.

arXiv:2411.02522•Reviews of Modern Physics•Jan 8, 2026•83 citations
summary:To achieve exponential speed-up with the Harrow-Hassidim-Lloyd (HHL) quantum algorithm, the condition number of the matrix can scale at most poly-logarithmically with its size. This quantum algorithm significantly outperforms the best classical methods for solving well-conditioned linear systems of equations. However, well-conditioning is a stringent requirement that severely limits the range of problems benefiting from exponential speed-up. In this paper, we introduce a regularization method that combines the HHL quantum algorithm with the Levenberg-Marquardt method to mitigate ill-conditioning and enable exponential speed-up. Specifically, the Levenberg-Marquardt method acts as a regularization method, transforming an ill-conditioned linear system of equations into a sequence of well-conditioned linear systems of equations. The HHL quantum algorithm is then applied to solve these systems efficiently. This approach effectively addresses the ill-conditioning issue while preserving the exponential speed-up advantage.
Efficiently solving large-scale sparse linear systems poses a significant challenge in computational science, especially in fields such as physics, engineering, machine learning, and finance. Traditional classical algorithms face scalability issues as the size of these systems increases, leading to performance degradation. On the other hand, quantum algorithms, like the Harrow-Hassidim-Lloyd (HHL) algorithm, offer exponential speedups for solving linear systems, yet they are constrained by the current state of quantum hardware and sensitivity to matrix condition numbers. This paper introduces a hybrid classical-quantum algorithm that combines CUDA-accelerated preconditioning techniques with the HHL algorithm to solve sparse linear systems more efficiently. The classical GPU parallelism is utilised to preprocess and precondition the matrix, reducing its condition number, while quantum computing is employed to solve the preconditioned system using the HHL algorithm. Additionally, the algorithm integrates machine learning models, particularly reinforcement learning, to dynamically optimise system parameters, such as block sizes and preconditioning stratgies, based on real-time performance data. Our experimental results show that the proposed approach not only surpasses traditional methods in speed and scalability but also mitigates some of the inherent limitations of quantum algorithms. This work pushes the boundaries of efficient computing and provides a foundation for future advancements in hybrid computational frameworks.
The Harrow-Hassidim-Lloyd (HHL) quantum algorithm for sampling from the solution of a linear system provides an exponential speed-up over its classical counterpart. The problem of solving a system of linear equations has a wide scope of applications, and thus HHL constitutes an important algorithmic primitive. In these notes, we present the HHL algorithm and its improved versions in detail, including explanations of the constituent sub- routines. More specifically, we discuss various quantum subroutines such as quantum phase estimation and amplitude amplification, as well as the important question of loading data into a quantum computer, via quantum RAM. The improvements to the original algorithm exploit variable-time amplitude amplification as well as a method for implementing linear combinations of unitary operations (LCUs) based on a decomposition of the operators using Fourier and Chebyshev series. Finally, we discuss a linear solver based on the quantum singular value estimation (QSVE) subroutine.
The Harrow-Hassidim-Lloyd (HHL) algorithm offers exponential speedup for solving the quantum linear-system problem. But some caveats for the speedup could be hard to met. One of the difficulties is the encoding bottleneck, i.e., the efficient preparation of the initial quantum state. To prepare an arbitrary NNN-dimensional state exactly, existing state-preparation approaches generally require a runtime of O(N)O(N)O(N), which will ruin the speedup of the HHL algorithm. Here we show that the states can be prepared approximately with a runtime of O(poly(log⁡N))O(poly(\log N))O(poly(logN)) by employing a slightly modified version of the HHL algorithm itself. Thus, applying this approach to prepare the initial state of the original HHL algorithm can preserve the exponential speedup advantage. It can also serve as a standalone solution for other applications demanding fast state preparation.
We propose an iterative improvement method for the Harrow-Hassidim-Lloyd (HHL) algorithm to solve a linear system of equations. This is a quantum-classical hybrid algorithm. The accuracy is essential to solve the linear system of equations. However, the accuracy of the HHL algorithm is limited by the number of quantum bits used to express the eigenvalues of the matrix. Our iterative method improves the accuracy of the HHL solutions, and gives higher accuracy which surpasses the accuracy limited by the number of quantum bits. In practical HHL algorithm, a huge number of measurements is required to obtain good accuracy, even if we provide a sufficient number of quantum bits for the eigenvalue expression, since the solution is statistically processed from the measurements. Our improved iterative method can reduce the number of measurements. Moreover, the sign information for each eigenstate of the solution is lost once the measurement is made, although the sign is significant. Therefore, the naïve iterative method of the HHL algorithm may slow down, especially, when the solution includes wrong signs. In this paper, we propose and evaluate an improved iterative method for the HHL algorithm that is robust against the sign information loss, in terms of the number of iterations and the computational accuracy.
Harrow-Hassidim-Lloyd (HHL) is a quantum computation algorithm that can solve a system of linear equations in a logarithmic time scale; hence, an exponential speed-up over best-known classical computers, which have polynomial time complexity, is accessible. This paper studies the integration of HHL into the DC optimal power flow problem. Optimality conditions are formulated as a system of equations in the form of Ax=bAx=bAx=b that is solved by HHL. The performance of HHL for A-matrices appearing in DCOPF problems is discussed. The initialization of HHL for encoding data from classical data to a quantum state in an efficient manner is also investigated. The impact of HHL calculation error on DCOPF convergence and solution accuracy is analyzed. Qiskit module is used to test the HHL-based DCOPF problem on a 3-bus system. The impact of quantum computers and HHL errors on DCOPF is simulated for the IEEE 14- bus system.
Solving linear systems of equations plays a fundamental role in numerous computational problems from different fields of science. The widespread use of numerical methods to solve these systems motivates investigating the feasibility of solving linear systems problems using quantum computers. In this work, we provide a survey of the main advances in quantum linear systems algorithms, together with some applications. We summarize and analyze the main ideas behind some of the algorithms for the quantum linear systems problem in the literature. The analysis begins by examining the Harrow-Hassidim-Lloyd (HHL) solver. We note its limitations and reliance on computationally expensive quantum methods, then highlight subsequent research efforts which aimed to address these limitations and optimize runtime efficiency and precision via various paradigms. We focus in particular on the post-HHL enhancements which have paved the way towards optimal lower bounds with respect to error tolerance and condition number. By doing so, we propose a taxonomy that categorizes these studies. Furthermore, by contextualizing these developments within the broader landscape of quantum computing, we explore the foundational work that have inspired and informed their development, as well as subsequent refinements. Finally, we discuss the potential applications of these algorithms in differential equations, quantum machine learning, and many-body physics.