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

Scientific Reports

Quantum linear solvers for scientific computing: a comparison of VQLS, HHL and quantum annealing on time-fractional diffusion problems

Amir Hossein Salehi Shayegan

Published Feb 23, 2026• 3 citations
Publisher

Abstract

Time-fractional diffusion equations have emerged as powerful models for describing anomalous transport phenomena in physics, biology and engineering. To address the computational challenges arising from their non-local operators, we employ the WEB-spline finite element method, which provides a flexible and accurate discretization framework. The resulting linear system of equations are then explored in the context of quantum computing. Specifically, we investigate three prominent quantum linear solvers: the variational quantum linear solver (VQLS), the Harrow-Hassidim-Lloyd (HHL) algorithm and quantum annealing (QA). VQLS leverages hybrid variational techniques and shallow circuits, making it well-suited for noisy intermediate-scale quantum (NISQ) devices, while HHL offers a theoretically exponential speedup for sparse systems but requires deep fault-tolerant circuits. QA, in contrast, reformulates the problem into a quadratic unconstrained binary optimization (QUBO) instance, enabling approximate solutions through energy minimization on specialized hardware. We present a comparative analysis in terms of circuit depth, noise resilience, scalability and solution extraction, including the role of quantum state tomography in reconstructing classical information. Numerical experiments on a time-fractional diffusion problem highlight the complementary strengths and limitations of each method. This study bridges advanced numerical discretization with emerging quantum algorithms, providing insights into the feasibility and future potential of quantum-enhanced solvers for fractional partial differential equations.

DOI
10.1038/s41598-026-40910-y

Related papers

Near term algorithms for linear systems of equations

Aidan Pellow-Jarman, Ilya Sinayskiy, Anban W. Pillay +1 more

Abstract Finding solutions to systems of linear equations is a common problem in many areas of science and engineering, with much potential for a speed up on quantum devices. While the Harrow–Hassidim–Lloyd (HHL) quantum algorithm yields up to an exponential speed up over classical algorithms in some cases, it requires a fault-tolerant quantum computer, which is unlikely to be available in the near-term. Thus, attention has turned to the investigation of quantum algorithms for noisy intermediate-scale quantum (NISQ) devices where several near-term approaches to solving systems of linear equations have been proposed. This paper focuses on the Variational Quantum Linear Solvers (VQLS), and other closely related methods and adaptions. Several contributions are made in this paper, which include: the first application of the Evolutionary Ansatz to the VQLS (EAVQLS), the first implementation of the Logical Ansatz VQLS (LAVQLS), based on the Classical Combination of Quantum States (CQS) method, a proof of principle demonstration of the CQS method on real quantum hardware and a method for the implementation of the Adiabatic Ansatz on the VQLS (AAVQLS). These approaches are implemented and contrasted. The CQS method is run with moderate success on a real quantum device. The EAVQLS and AAVQLS show promise as possible improvements to the standard VQLS algorithm once refined.

arXiv:2108.11362•Quantum Information Processing•Jun 24, 2023•11 citations

A Variational Quantum Linear Solver Application to Discrete Finite-Element Methods

Corey Jason Trahan, Mark Loveland, Noah A. Davis +1 more

Finite-element methods are industry standards for finding numerical solutions to partial differential equations. However, the application scale remains pivotal to the practical use of these methods, even for modern-day supercomputers. Large, multi-scale applications, for example, can be limited by their requirement of prohibitively large linear system solutions. It is therefore worthwhile to investigate whether near-term quantum algorithms have the potential for offering any kind of advantage over classical linear solvers. In this study, we investigate the recently proposed variational quantum linear solver (VQLS) for discrete solutions to partial differential equations. This method was found to scale polylogarithmically with the linear system size, and the method can be implemented using shallow quantum circuits on noisy intermediate-scale quantum (NISQ) computers. Herein, we utilize the hybrid VQLS to solve both the steady Poisson equation and the time-dependent heat and wave equations.

Entropy•Mar 28, 2023•43 citations

Two quantum algorithms for solving the one-dimensional advection–diffusion equation

Julia Ingelmann, Sachin S. Bharadwaj, Philipp Pfeffer +2 more

Two quantum algorithms are presented for the numerical solution of a linear one-dimensional advection–diffusion equation with periodic boundary conditions. Their accuracy and performance with increasing qubit number are compared point-by-point with each other. Specifically, we solve the linear partial differential equation with a Quantum Linear Systems Algorithm (QLSA) based on the Harrow–Hassidim–Lloyd method and a Variational Quantum Algorithm (VQA), for resolutions that can be encoded using up to 6 qubits, which corresponds to N=64 grid points on the unit interval. Both algorithms are hybrid in nature, i.e., they involve a combination of classical and quantum computing building blocks. The QLSA and VQA are solved as ideal statevector simulations using the in-house solver QFlowS and open-access Qiskit software, respectively. We discuss several aspects of both algorithms which are crucial for a successful performance in both cases. These are the accurate eigenvalue estimation with the quantum phase estimation for the QLSA and the choice of the algorithm of the minimization of the cost function for the VQA. The latter algorithm is also implemented in the noisy Qiskit framework including measurement noise. We reflect on the current limitations and suggest some possible routes of future research for the numerical simulation of classical fluid flows on a quantum computer.

arXiv:2401.00326•Computers & Fluids•Jul 18, 2024•45 citations

Quantum Algorithms for Computational Fluid Dynamics

Mario Guillaume Cecile, Nis-Luca van Hülst, Tomohiro Hashizume +19 more

We present a comprehensive review of quantum approaches for solving partial differential equations (PDEs) arising in computational fluid dynamics (CFD). We examine fully quantum approaches, including quantum linear system algorithms (QLSAs), ranging from the Harrow--Hassidim--Lloyd (HHL) algorithm to quantum singular value transformation (QSVT), Hamiltonian simulation, and quantum lattice Boltzmann methods (QLBMs), while emphasizing hybrid quantum--classical approaches, including quantum physics-informed neural networks (QPINNs) and amplitude-encoded variational PDE solvers. We focus on hardware-agnostic algorithms compatible with present noisy processors and emerging fault-tolerant architectures. For each framework, we analyze the mathematical formulation, algorithmic structure, and principal limitations. We also examine tensor-network (TN) representations, since CFD fields, differential operators, and geometrical information can often be encoded efficiently in low-rank form. The TN formalism bridges CFD discretizations and quantum states, operators, and circuits, enabling compact representations to be translated into tensor-programmable variational quantum algorithms (TP-VQAs). We further review benchmark problems, including Poisson, reaction, diffusion, and nonlinear model equations, and assess how well quantum algorithms capture key features of fluid dynamics. Our analysis highlights that potential quantum advantage is highly problem dependent and governed by condition number, representational complexity, state preparation, and measurement constraints. We outline capabilities, limitations, and challenges toward scalable quantum algorithms for CFD.

quant-pharXiv:2609.39962•Oct 1, 2026•1 citation

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

NISQ-Compatible Variational Quantum Solver for Lyapunov Equations

Amir Hossein Salehi Shayegan

Abstract \noindent This paper applies the Variational Quantum Linear Solver (VQLS) to the continuous-time Lyapunov equation $A^T X + X A = -Q$. Using the Kronecker product formulation, the matrix equation is transformed into the linear system $H z = b$, where $H = I_n \otimes A^T + A^T \otimes I_n$ and $z = \mathrm{vec}(X)$. VQLS approximates the solution via parameterized quantum circuits optimized in a hybrid quantum-classical loop. Numerical experiments on four control system benchmarks with Kronecker dimensions up to $25 \times 25$ demonstrate residual norms as low as $10^{-9}$, with logarithmic qubit scaling (2-5 qubits) and shallow circuit depths (6-14 layers) suitable for near-term quantum devices. Compared to the HHL algorithm, VQLS offers reduced circuit complexity and qubit overhead, making it practical for noisy intermediate-scale quantum (NISQ) hardware. This paper demonstrates the potential of variational quantum algorithms for solving Lyapunov equations in control and dynamical systems applications.

•Jun 12, 2026•0 citations
Time-fractional diffusion equations have emerged as powerful models for describing anomalous transport phenomena in physics, biology and engineering. To address the computational challenges arising from their non-local operators, we employ the WEB-spline finite element method, which provides a flexible and accurate discretization framework. The resulting linear system of equations are then explored in the context of quantum computing. Specifically, we investigate three prominent quantum linear solvers: the variational quantum linear solver (VQLS), the Harrow-Hassidim-Lloyd (HHL) algorithm and quantum annealing (QA). VQLS leverages hybrid variational techniques and shallow circuits, making it well-suited for noisy intermediate-scale quantum (NISQ) devices, while HHL offers a theoretically exponential speedup for sparse systems but requires deep fault-tolerant circuits. QA, in contrast, reformulates the problem into a quadratic unconstrained binary optimization (QUBO) instance, enabling approximate solutions through energy minimization on specialized hardware. We present a comparative analysis in terms of circuit depth, noise resilience, scalability and solution extraction, including the role of quantum state tomography in reconstructing classical information. Numerical experiments on a time-fractional diffusion problem highlight the complementary strengths and limitations of each method. This study bridges advanced numerical discretization with emerging quantum algorithms, providing insights into the feasibility and future potential of quantum-enhanced solvers for fractional partial differential equations.
Abstract Finding solutions to systems of linear equations is a common problem in many areas of science and engineering, with much potential for a speed up on quantum devices. While the Harrow–Hassidim–Lloyd (HHL) quantum algorithm yields up to an exponential speed up over classical algorithms in some cases, it requires a fault-tolerant quantum computer, which is unlikely to be available in the near-term. Thus, attention has turned to the investigation of quantum algorithms for noisy intermediate-scale quantum (NISQ) devices where several near-term approaches to solving systems of linear equations have been proposed. This paper focuses on the Variational Quantum Linear Solvers (VQLS), and other closely related methods and adaptions. Several contributions are made in this paper, which include: the first application of the Evolutionary Ansatz to the VQLS (EAVQLS), the first implementation of the Logical Ansatz VQLS (LAVQLS), based on the Classical Combination of Quantum States (CQS) method, a proof of principle demonstration of the CQS method on real quantum hardware and a method for the implementation of the Adiabatic Ansatz on the VQLS (AAVQLS). These approaches are implemented and contrasted. The CQS method is run with moderate success on a real quantum device. The EAVQLS and AAVQLS show promise as possible improvements to the standard VQLS algorithm once refined.
Finite-element methods are industry standards for finding numerical solutions to partial differential equations. However, the application scale remains pivotal to the practical use of these methods, even for modern-day supercomputers. Large, multi-scale applications, for example, can be limited by their requirement of prohibitively large linear system solutions. It is therefore worthwhile to investigate whether near-term quantum algorithms have the potential for offering any kind of advantage over classical linear solvers. In this study, we investigate the recently proposed variational quantum linear solver (VQLS) for discrete solutions to partial differential equations. This method was found to scale polylogarithmically with the linear system size, and the method can be implemented using shallow quantum circuits on noisy intermediate-scale quantum (NISQ) computers. Herein, we utilize the hybrid VQLS to solve both the steady Poisson equation and the time-dependent heat and wave equations.
Two quantum algorithms are presented for the numerical solution of a linear one-dimensional advection–diffusion equation with periodic boundary conditions. Their accuracy and performance with increasing qubit number are compared point-by-point with each other. Specifically, we solve the linear partial differential equation with a Quantum Linear Systems Algorithm (QLSA) based on the Harrow–Hassidim–Lloyd method and a Variational Quantum Algorithm (VQA), for resolutions that can be encoded using up to 6 qubits, which corresponds to N=64 grid points on the unit interval. Both algorithms are hybrid in nature, i.e., they involve a combination of classical and quantum computing building blocks. The QLSA and VQA are solved as ideal statevector simulations using the in-house solver QFlowS and open-access Qiskit software, respectively. We discuss several aspects of both algorithms which are crucial for a successful performance in both cases. These are the accurate eigenvalue estimation with the quantum phase estimation for the QLSA and the choice of the algorithm of the minimization of the cost function for the VQA. The latter algorithm is also implemented in the noisy Qiskit framework including measurement noise. We reflect on the current limitations and suggest some possible routes of future research for the numerical simulation of classical fluid flows on a quantum computer.
We present a comprehensive review of quantum approaches for solving partial differential equations (PDEs) arising in computational fluid dynamics (CFD). We examine fully quantum approaches, including quantum linear system algorithms (QLSAs), ranging from the Harrow--Hassidim--Lloyd (HHL) algorithm to quantum singular value transformation (QSVT), Hamiltonian simulation, and quantum lattice Boltzmann methods (QLBMs), while emphasizing hybrid quantum--classical approaches, including quantum physics-informed neural networks (QPINNs) and amplitude-encoded variational PDE solvers. We focus on hardware-agnostic algorithms compatible with present noisy processors and emerging fault-tolerant architectures. For each framework, we analyze the mathematical formulation, algorithmic structure, and principal limitations. We also examine tensor-network (TN) representations, since CFD fields, differential operators, and geometrical information can often be encoded efficiently in low-rank form. The TN formalism bridges CFD discretizations and quantum states, operators, and circuits, enabling compact representations to be translated into tensor-programmable variational quantum algorithms (TP-VQAs). We further review benchmark problems, including Poisson, reaction, diffusion, and nonlinear model equations, and assess how well quantum algorithms capture key features of fluid dynamics. Our analysis highlights that potential quantum advantage is highly problem dependent and governed by condition number, representational complexity, state preparation, and measurement constraints. We outline capabilities, limitations, and challenges toward scalable quantum algorithms for CFD.
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.
Abstract \noindent This paper applies the Variational Quantum Linear Solver (VQLS) to the continuous-time Lyapunov equation ATX+XA=−QA^T X + X A = -QATX+XA=−Q. Using the Kronecker product formulation, the matrix equation is transformed into the linear system Hz=bH z = bHz=b, where H=In⊗AT+AT⊗InH = I_n \otimes A^T + A^T \otimes I_nH=In​⊗AT+AT⊗In​ and z=vec(X)z = \mathrm{vec}(X)z=vec(X). VQLS approximates the solution via parameterized quantum circuits optimized in a hybrid quantum-classical loop. Numerical experiments on four control system benchmarks with Kronecker dimensions up to 25×2525 \times 2525×25 demonstrate residual norms as low as 10−910^{-9}10−9, with logarithmic qubit scaling (2-5 qubits) and shallow circuit depths (6-14 layers) suitable for near-term quantum devices. Compared to the HHL algorithm, VQLS offers reduced circuit complexity and qubit overhead, making it practical for noisy intermediate-scale quantum (NISQ) hardware. This paper demonstrates the potential of variational quantum algorithms for solving Lyapunov equations in control and dynamical systems applications.