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:2410.02408

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

Published Jan 1, 2024• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.13140/rg.2.2.10406.95047

Related papers

Optimization of the HHL Algorithm

Dhruv Sood, Nilmani Mathur, Vikram Tripathi

The Harrow-Hassidim-Lloyd (HHL) algorithm is a quantum algorithm for solving systems of linear equations that, in principle, offers an exponential improvement in scaling with the system size compared to classical approaches. In this work, we investigate the practical implementation and optimisation of the HHL algorithm with a focus on improving its performance on near-term quantum simulators. After outlining the algorithm, we examine two optimisation strategies aimed at improving fidelity and scalability: Suzuki-Trotter decomposition of the Hamiltonian evolution operator and a block-encoding approach that embeds the problem matrix into a larger unitary operator. The performance of these methods is evaluated through simulations on matrices with varying sparsity, including diagonal, tridiagonal, moderately dense, and fully dense cases. Our results show that while HHL achieves near-ideal fidelity for highly structured matrices, performance degrades as sparsity decreases due to the increasing cost of Hamiltonian simulation and reduced post-selection probability due to higher condition number. Block encoding is found to provide improved fidelity for moderately dense matrices, whereas Trotterisation offers a qubit-efficient approach for sparse systems. These results highlight the importance of matrix structure in determining the practical efficiency of HHL and inform future implementations that combine algorithmic optimisation with hardware-aware design.

quant-pharXiv:2603.15756•International Symposium on Lattice Field Theory (LATTICE)•Mar 18, 2026•0 citations

Quantum–Classical Hybrid Architecture for Solving the Muskat–Leverett Model

Beimbet Daribayev, Aksultan Mukhanbet, Erlan Makhmut +2 more

ABSTRACT Hybrid quantum–classical architectures demonstrate significant potential for efficiently solving complex physical models. This study focuses on developing and implementing a hybrid quantum–classical algorithm to solve the Muskat–Leverett model by reformulating it as a system of linear equations. By expressing the Muskat–Leverett model in matrix form , we enable the application of quantum algorithms. We leverage classical computational platforms (CPU and GPU) alongside quantum computing to efficiently solve the model, achieving competitive accuracy and demonstrating potential for scalability compared to traditional methods. The Harrow–Hassidim–Lloyd algorithm and the variational quantum linear solver were utilised to design quantum circuits and variational ansatz. The study evaluates quantum solutions with classical optimisation, variational methods, fully classical solutions on graphical processors and purely quantum solutions. Experimental results show that the hybrid architecture, utilising cuQuantum and CUDA‐Q, achieves up to 6.42× faster execution compared to CPU implementations and provides a comparable speedup to GPU‐based solvers. When applied for large‐scale problems, the hybrid approach is also ∼10× faster than standard quantum simulators. Key factors, such as qubits, optimisers and cost functions, were analysed to determine optimal parameters. These results highlight the advantages of hybrid architecture in accelerating and optimising numerical solutions for complex physical models.

IET Quantum Communication•Jan 1, 2025•1 citation

The HHL algorithm: Implementation and research directions

Varsha Sambhaje, Anju Chaurasia

Linear systems of equations lie at the heart of numerous scientific and engineering challenges. In cutting-edge arena like artificial intelligence, machine learning and neuro-computation, these systems serve as a fundamental tool for mathematical modeling. Classical algorithms for solving linear systems have been extensively developed and forms the backbone of diverse applications across various scientific disciplines. While classical algorithms exist for solving linear systems, they often encounter limitations termed “NP-completeness” as data complexity increases. The emerging field of quantum computing offers a revolutionary approach to deal with these kinds of problems. The Harrow–Hassidim–Lloyd (HHL) algorithm tackles these challenges and opens new avenues for research. This study delves into the contemporary effectiveness of the HHL algorithm to address systems of linear equations. By examining recent research in quantum machine learning, we aim to assess the HHL algorithm’s potential to revolutionize the process of optimizing hyperparameters for machine learning models, resulting in increased efficiency and cost savings. This paper meticulously analyzes the HHL algorithm and explores its evolution from conception to the latest advancements. A comprehensive examination of the HHL algorithm, including its evolution over time, is thoroughly explored. The investigation delves into the potential challenges and limitations that might hinder the practical deployment of the HHL algorithm. Identifying these roadblocks will pave the way for future research and development efforts.

International Journal of Quantum Information•May 31, 2024•2 citations

COMPARATIVE ANALYSIS OF CLASSICAL AND QUANTUM ALGORITHMS FOR SOLVING LINEAR SYSTEMS OF EQUATIONS: THEORETICAL INSIGHTS AND BENCHMARKING CHALLENGES

Journal of Theoretical and Applied Information Technology

Modern computers utilize a model based on a simple Turing machine concept. This study contains an extensive comparative review of classical and quantum algorithm approaches to solving a system of linear equations. The study details standard classical approaches like Gaussian Elimination or Conjugate Gradient Method and compares these with the algorithm of quantum theory algorithm HHL (Harrow-Hassidim-Lloyd). It considers the logic behind each of them, their benchmarks, scalability, implementation difficulties and practical use. Benchmarking results illustrate the fact that a classical approach continues to do especially good for small to moderate sized problems. However, quantum computation has the potential for an exponential speedup using algorithms like HHL in well-conditioned sparse matrices. The current limits of the hardware are discussed and future research directions needed to be able to utilize quantum computing for larger scale linear algebra problems are presented.

Journal of Theoretical and Applied Information Technology•Jun 30, 2025•0 citations

Quantum Speedup for Linear Systems: An Analysis of the HHL Algorithm Using IBM Qiskit

V Shwetha, Abinaya Selvarajan, A Aarthi +1 more

One of the most significant developments in quantum computing is the Harrow-Hassidim-Lloyd (HHL) method, which can solve linear equation systems at exponential speedup. Because linear systems are essential to many scientific fields, including physics, engineering, and machine learning, this approach has great potential to revolutionize computational paradigms. The HHL algorithm is thoroughly examined in this work, with particular attention paid to its theoretical framework, real-world application utilizing IBM's Qiskit platform, and the difficulties in simulating quantum algorithms on noisy intermediate-scale quantum (NISQ) devices. Using parameters like fidelity, time complexity, and scalability, the research further evaluates the HHL algorithm's performance in comparison to traditional methods. According to the findings, quantum simulations work well for small-scale matrices like 2x2 and 4x4, but expanding the approach to bigger systems is still difficult because of hardware and software constraints. Finally, the research emphasizes the key directions for advancing quantum hardware and algorithms to overcome current scalability challenges, enabling broader applicability of the HHL algorithm in solving complex linear systems.

Journal of Electronics and Informatics•Jan 9, 2025•0 citations

Solving linear systems on quantum hardware with hybrid HHL++

Romina Yalovetzky, Pierre Minssen, Dylan Herman +1 more

The limited capabilities of current quantum hardware significantly constrain the scale of experimental demonstrations of most quantum algorithmic primitives. This makes it challenging to perform benchmarking of the current hardware using useful quantum algorithms, i.e., application-oriented benchmarking. In particular, the Harrow-Hassidim-Lloyd (HHL) algorithm is a critical quantum linear algebra primitive, but the majority of the components of HHL are far out of the reach of noisy intermediate-scale quantum devices, which has led to the proposal of hybrid classical-quantum variants. The goal of this work is to further bridge the gap between proposed near-term friendly implementations of HHL and the kinds of quantum circuits that can be executed on noisy hardware. Our proposal adds to the existing literature of hybrid quantum algorithms for linear algebra that are more compatible with the current scale of quantum devices. Specifically, we propose two modifications to the Hybrid HHL algorithm proposed by Lee et al., leading to our algorithm Hybrid $$\hbox {HHL}^{++}$$ : (1) propose a novel algorithm for determining a scaling factor for the linear system matrix that maximizes the utility of the amount of ancillary qubits allocated to the phase estimation component of HHL, and (2) introduce a heuristic for compressing the HHL circuit. We demonstrate the efficacy of our work by running our modified Hybrid HHL on Quantinuum System Model H-series trapped-ion quantum computers to solve different problem instances of small-scale portfolio optimization problems, leading to the largest experimental demonstrations of HHL for an application to date.

arXiv:2110.15958•Scientific Reports•Sep 10, 2024•58 citations
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) algorithm is a quantum algorithm for solving systems of linear equations that, in principle, offers an exponential improvement in scaling with the system size compared to classical approaches. In this work, we investigate the practical implementation and optimisation of the HHL algorithm with a focus on improving its performance on near-term quantum simulators. After outlining the algorithm, we examine two optimisation strategies aimed at improving fidelity and scalability: Suzuki-Trotter decomposition of the Hamiltonian evolution operator and a block-encoding approach that embeds the problem matrix into a larger unitary operator. The performance of these methods is evaluated through simulations on matrices with varying sparsity, including diagonal, tridiagonal, moderately dense, and fully dense cases. Our results show that while HHL achieves near-ideal fidelity for highly structured matrices, performance degrades as sparsity decreases due to the increasing cost of Hamiltonian simulation and reduced post-selection probability due to higher condition number. Block encoding is found to provide improved fidelity for moderately dense matrices, whereas Trotterisation offers a qubit-efficient approach for sparse systems. These results highlight the importance of matrix structure in determining the practical efficiency of HHL and inform future implementations that combine algorithmic optimisation with hardware-aware design.
ABSTRACT Hybrid quantum–classical architectures demonstrate significant potential for efficiently solving complex physical models. This study focuses on developing and implementing a hybrid quantum–classical algorithm to solve the Muskat–Leverett model by reformulating it as a system of linear equations. By expressing the Muskat–Leverett model in matrix form , we enable the application of quantum algorithms. We leverage classical computational platforms (CPU and GPU) alongside quantum computing to efficiently solve the model, achieving competitive accuracy and demonstrating potential for scalability compared to traditional methods. The Harrow–Hassidim–Lloyd algorithm and the variational quantum linear solver were utilised to design quantum circuits and variational ansatz. The study evaluates quantum solutions with classical optimisation, variational methods, fully classical solutions on graphical processors and purely quantum solutions. Experimental results show that the hybrid architecture, utilising cuQuantum and CUDA‐Q, achieves up to 6.42× faster execution compared to CPU implementations and provides a comparable speedup to GPU‐based solvers. When applied for large‐scale problems, the hybrid approach is also ∼10× faster than standard quantum simulators. Key factors, such as qubits, optimisers and cost functions, were analysed to determine optimal parameters. These results highlight the advantages of hybrid architecture in accelerating and optimising numerical solutions for complex physical models.
Linear systems of equations lie at the heart of numerous scientific and engineering challenges. In cutting-edge arena like artificial intelligence, machine learning and neuro-computation, these systems serve as a fundamental tool for mathematical modeling. Classical algorithms for solving linear systems have been extensively developed and forms the backbone of diverse applications across various scientific disciplines. While classical algorithms exist for solving linear systems, they often encounter limitations termed “NP-completeness” as data complexity increases. The emerging field of quantum computing offers a revolutionary approach to deal with these kinds of problems. The Harrow–Hassidim–Lloyd (HHL) algorithm tackles these challenges and opens new avenues for research. This study delves into the contemporary effectiveness of the HHL algorithm to address systems of linear equations. By examining recent research in quantum machine learning, we aim to assess the HHL algorithm’s potential to revolutionize the process of optimizing hyperparameters for machine learning models, resulting in increased efficiency and cost savings. This paper meticulously analyzes the HHL algorithm and explores its evolution from conception to the latest advancements. A comprehensive examination of the HHL algorithm, including its evolution over time, is thoroughly explored. The investigation delves into the potential challenges and limitations that might hinder the practical deployment of the HHL algorithm. Identifying these roadblocks will pave the way for future research and development efforts.
Modern computers utilize a model based on a simple Turing machine concept. This study contains an extensive comparative review of classical and quantum algorithm approaches to solving a system of linear equations. The study details standard classical approaches like Gaussian Elimination or Conjugate Gradient Method and compares these with the algorithm of quantum theory algorithm HHL (Harrow-Hassidim-Lloyd). It considers the logic behind each of them, their benchmarks, scalability, implementation difficulties and practical use. Benchmarking results illustrate the fact that a classical approach continues to do especially good for small to moderate sized problems. However, quantum computation has the potential for an exponential speedup using algorithms like HHL in well-conditioned sparse matrices. The current limits of the hardware are discussed and future research directions needed to be able to utilize quantum computing for larger scale linear algebra problems are presented.
One of the most significant developments in quantum computing is the Harrow-Hassidim-Lloyd (HHL) method, which can solve linear equation systems at exponential speedup. Because linear systems are essential to many scientific fields, including physics, engineering, and machine learning, this approach has great potential to revolutionize computational paradigms. The HHL algorithm is thoroughly examined in this work, with particular attention paid to its theoretical framework, real-world application utilizing IBM's Qiskit platform, and the difficulties in simulating quantum algorithms on noisy intermediate-scale quantum (NISQ) devices. Using parameters like fidelity, time complexity, and scalability, the research further evaluates the HHL algorithm's performance in comparison to traditional methods. According to the findings, quantum simulations work well for small-scale matrices like 2x2 and 4x4, but expanding the approach to bigger systems is still difficult because of hardware and software constraints. Finally, the research emphasizes the key directions for advancing quantum hardware and algorithms to overcome current scalability challenges, enabling broader applicability of the HHL algorithm in solving complex linear systems.
The limited capabilities of current quantum hardware significantly constrain the scale of experimental demonstrations of most quantum algorithmic primitives. This makes it challenging to perform benchmarking of the current hardware using useful quantum algorithms, i.e., application-oriented benchmarking. In particular, the Harrow-Hassidim-Lloyd (HHL) algorithm is a critical quantum linear algebra primitive, but the majority of the components of HHL are far out of the reach of noisy intermediate-scale quantum devices, which has led to the proposal of hybrid classical-quantum variants. The goal of this work is to further bridge the gap between proposed near-term friendly implementations of HHL and the kinds of quantum circuits that can be executed on noisy hardware. Our proposal adds to the existing literature of hybrid quantum algorithms for linear algebra that are more compatible with the current scale of quantum devices. Specifically, we propose two modifications to the Hybrid HHL algorithm proposed by Lee et al., leading to our algorithm Hybrid HHL++\hbox {HHL}^{++}HHL++ : (1) propose a novel algorithm for determining a scaling factor for the linear system matrix that maximizes the utility of the amount of ancillary qubits allocated to the phase estimation component of HHL, and (2) introduce a heuristic for compressing the HHL circuit. We demonstrate the efficacy of our work by running our modified Hybrid HHL on Quantinuum System Model H-series trapped-ion quantum computers to solve different problem instances of small-scale portfolio optimization problems, leading to the largest experimental demonstrations of HHL for an application to date.