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

Variational Quantum Linear Solver via Block Encoding for the Poisson Equation

Viraj Dsouza, Ayush Singhal, Alex Khan, Rut Lineswala, Abhishek Chopra

On Aqora:Viraj Daniel DsouzaViraj Daniel DsouzaAlex KhanAlex Khan
quant-phSubmitted Aug 20, 2026• Announced Aug 21, 2026• 0 citations
arXivHTMLPDF

Abstract

We present a variational quantum linear solver (VQLS) for the Poisson equation built on an exact block encoding of the discrete Laplacian, and demonstrate its performance on physically motivated benchmarks. Unlike LCU-based VQLS where the number of distinct circuits required per cost-function evaluation is $\mathcal{O}(L^2)$, where $L$ is the number of terms in the LCU decomposition of the discrete Laplacian operator, this approach requires only a single circuit for cost evaluation. We further empirically demonstrate that the choice of classical optimizer materially affects where the variational optimization ceases to make progress. The solver is benchmarked on three problems: a Poisson equation with sinusoidal forcing and a steady-state heat conduction problem with a localized Gaussian source, both with Dirichlet boundaries, and the pressure-Poisson equation of a two-dimensional lid-driven cavity flow, in which the solver is invoked once per time step under Neumann boundary conditions.

Comments
14 pages, 11 figures

Related papers

Distributed Variational Quantum Linear Solver

Chao Lu, Pooja Rao, Muralikrishnan Gopalakrishnan Meena +1 more

The Variational Quantum Linear Solver (VQLS), a hybrid quantum-classical algorithm for solving linear systems, faces a practical scalability bottleneck: the Linear Combination of Unitaries (LCU) decomposition requires $O(L^2)$ circuit evaluations per optimizer iteration, where $L$ can grow to $4^n$ in the worst case for an $n$-qubit system. We address this computational bottleneck through two complementary strategies. First, we present a distributed VQLS (D-VQLS) framework (https://code.ornl.gov/olcf-qcfd/DVQLS.git), built on NVIDIA CUDA-Q, that enables asynchronous, scalable distribution of the $O(L^2)$ cost evaluations. Second, a fast Walsh--Hadamard transform (FWHT)-based Pauli decomposition with coefficient-amplitude pruning threshold $τ=0.01$ curbs LCU growth for the structured Toeplitz family, reducing $L$ from $O(2^n)$ to 64 for $n>6$ and compressing the circuit complexity per optimizer iteration from $O(n4^n)$ to $O(n)$. We derive the exact top-$L$ Frobenius error and connect it to worst-case solution error. For a 10-qubit tridiagonal Toeplitz system, the $L=64$ pruning yields a $256\times$ reduction---from 23 million to 90k circuits per optimizer iteration. The D-VQLS framework is validated on the NERSC Perlmutter supercomputer using multi-node, multi-GPU ideal state-vector simulations, achieving over $99.99\%$ fidelity against classical solutions on tridiagonal Toeplitz and Hele--Shaw flow benchmarks, with near-ideal strong scaling up to 24 GPUs and $95.3\%$ weak scaling efficiency at 96 GPUs processing more than 360k circuits per optimizer iteration (from larger-$L$ pruning) for the 10-qubit system. Systematic profiling identifies the optimal resource allocation for distributed quantum circuit workloads, yielding a $2.52\times$ speedup for the configurations studied.

quant-pharXiv:2604.14435•Apr 17, 2026•1 citation

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

Solving 1D Poisson problem with a Variational Quantum Linear Solver

Giorgio Tosti Balducci, Boyang Chen, Matthias Möller +1 more

Different hybrid quantum-classical algorithms have recently been developed as a near-term way to solve linear systems of equations on quantum devices. However, the focus has so far been mostly on the methods, rather than the problems that they need to tackle. In fact, these algorithms have been run on real hardware only for problems in quantum physics, such as Hamiltonians of a few qubits systems. These problems are particularly favorable for quantum hardware, since their matrices are the sum of just a few unitary terms and since only shallow quantum circuits are required to estimate the cost function. However, for many interesting problems in linear algebra, it appears far less trivial to find an efficient decomposition and to trade it off with the depth of the cost quantum circuits. A first simple yet interesting instance to consider are tridiagonal systems of equations. These arise, for instance, in the discretization of one-dimensional finite element analyses. This work presents a method to solve a class of tridiagonal systems of equations with the variational quantum linear solver (VQLS), a recently proposed variational hybrid algorithm for solving linear systems. In particular, we present a new decomposition for this class of matrices based on both Pauli strings and multi--qubit gates, resulting in less terms than those obtained by just using Pauli gates. Based on this decomposition, we discuss the tradeoff between the number of terms and the near-term implementability of the quantum circuits. Furthermore, we present the first simulated and real-hardware results obtained by solving tridiagonal linear systems with VQLS, using the decomposition proposed.

arXiv:2412.04938•Dec 6, 2024•6 citations

Voxel-based block variational quantum linear solver: a hybrid quantum-classical method for static analysis of solids

Feng Wu, Chen Li, Li Zhu +2 more

In solid mechanics, finite element discretization of large-scale static problems produces large sparse linear systems whose solution requires substantial computation time and memory. The variational quantum linear solver (VQLS) offers a hybrid quantum-classical route, but its use in quantum finite element analysis is limited by the decomposition of nonunitary matrices, barren plateaus, and the measurement cost of expectation values. We propose a voxel-based block variational quantum linear solver (Voxel-BVQLS) that combines structured matrix decomposition, the principle of minimum potential energy, and batched quantum tests. First, we construct an LCU decomposition of the stiffness matrix from the recursive block-banded structure of voxel-grid finite element matrices, with the number of unitary terms bounded independently of the problem size. Second, we optimize the ansatz parameters using a minimum-potential-energy objective in place of a conventional VQLS loss function, thereby mitigating barren plateaus in the studied problems. Third, we introduce a block-Hadamard test whose circuit directly estimates weighted sums of multiple inner products, reducing the number of circuit configurations required per iteration. We assessed the proposed method in noiseless classical simulations using three examples. These examples show that the method reduces both the number of unitary terms in the LCU decomposition and the number of iterations required to converge, while still yielding solutions of finite accuracy. Voxel-BVQLS thus provides a structured hybrid quantum-classical framework for quantum finite element analysis on regular grids.

arXiv:2609.30208•Sep 24, 2026•0 citations

Variational quantum algorithms for Poisson equations based on the decomposition of sparse Hamiltonians

Huimin Li, Zhi‐Xi Wang, Shao-Ming Fei

Solving a Poisson equation is generally reduced to solving a linear system with a coefficient matrix $A$ of entries ${a}_{ij}, i,j=1,2,...,n$, from the discretized Poisson equation. Although the variational quantum algorithms are promising algorithms to solve the discretized Poisson equation, they generally require that $A$ be decomposed into a sum of $O[\text{poly}({\text{log}}_{2}n)]$ simple operators in order to evaluate efficiently the loss function. A tensor product decomposition of $A$ with $2{\text{log}}_{2}n+1$ terms has been explored in previous works. In this paper, based on the decomposition of sparse Hamiltonians we greatly reduce the number of terms. We first write the loss function in terms of the operator ${\ensuremath{\sigma}}_{x}\ensuremath{\bigotimes}A$ with ${\ensuremath{\sigma}}_{x}$ denoting the standard Pauli operator. Then for the one-dimensional Poisson equations with different boundary conditions and for the $d$-dimensional Poisson equations with Dirichlet boundary conditions, we decompose ${\ensuremath{\sigma}}_{x}\ensuremath{\bigotimes}A$ into a sum of at most 7 and $(4d+1)$ Hermitian, one-sparse, and self-inverse operators, respectively. We design explicitly the quantum circuits to evaluate efficiently the loss function. The decomposition method and the design of quantum circuits can also be easily extended to linear systems with Hermitian and sparse coefficient matrices satisfying ${a}_{i,i+c}={a}_{c}$ for $c=0,1,...,n\ensuremath{-}1$ and $i=0,\ensuremath{\cdots},n\ensuremath{-}1\ensuremath{-}c$.

arXiv:2309.12826•Physical Review A•Sep 20, 2023•18 citations

A variational quantum algorithm for the Poisson equation based on the banded Toeplitz systems

Xiaoqi Liu, Yue-Di Qu, Ming Li +1 more

Abstract To solve the Poisson equation it is usually possible to discretize it into solving the corresponding linear system Ax = b. Variational quantum algorithms (VQAs) for the discretized Poisson equation have been studied before. We present a VQA based on the banded Toeplitz systems for solving the Poisson equation with respect to the structural features of matrix A. In detail, we decompose the matrices A and A 2 into a linear combination of the corresponding banded Toeplitz matrix and sparse matrices with only a few non-zero elements. For the one-dimensional Poisson equation with different boundary conditions and the d-dimensional Poisson equation with Dirichlet boundary conditions, the number of decomposition terms is less than that reported in [Phys. Rev. A 2023 108, 032 418 ]. Based on the decomposition of the matrix, we design quantum circuits that efficiently evaluate the cost function. Additionally, numerical simulation verifies the feasibility of the proposed algorithm. Finally, the VQAs for linear systems of equations and matrix-vector multiplications with the K-banded Toeplitz matrix T n K are given, where T n K ∈ R n × n and K ∈ O ( ploylog n ) .

arXiv:2504.14828•Communications in Theoretical Physics•Oct 28, 2024•2 citations
We present a variational quantum linear solver (VQLS) for the Poisson equation built on an exact block encoding of the discrete Laplacian, and demonstrate its performance on physically motivated benchmarks. Unlike LCU-based VQLS where the number of distinct circuits required per cost-function evaluation is O(L2)\mathcal{O}(L^2)O(L2), where LLL is the number of terms in the LCU decomposition of the discrete Laplacian operator, this approach requires only a single circuit for cost evaluation. We further empirically demonstrate that the choice of classical optimizer materially affects where the variational optimization ceases to make progress. The solver is benchmarked on three problems: a Poisson equation with sinusoidal forcing and a steady-state heat conduction problem with a localized Gaussian source, both with Dirichlet boundaries, and the pressure-Poisson equation of a two-dimensional lid-driven cavity flow, in which the solver is invoked once per time step under Neumann boundary conditions.
The Variational Quantum Linear Solver (VQLS), a hybrid quantum-classical algorithm for solving linear systems, faces a practical scalability bottleneck: the Linear Combination of Unitaries (LCU) decomposition requires O(L2)O(L^2)O(L2) circuit evaluations per optimizer iteration, where LLL can grow to 4n4^n4n in the worst case for an nnn-qubit system. We address this computational bottleneck through two complementary strategies. First, we present a distributed VQLS (D-VQLS) framework (https://code.ornl.gov/olcf-qcfd/DVQLS.git), built on NVIDIA CUDA-Q, that enables asynchronous, scalable distribution of the O(L2)O(L^2)O(L2) cost evaluations. Second, a fast Walsh--Hadamard transform (FWHT)-based Pauli decomposition with coefficient-amplitude pruning threshold τ=0.01τ=0.01τ=0.01 curbs LCU growth for the structured Toeplitz family, reducing LLL from O(2n)O(2^n)O(2n) to 64 for n>6n>6n>6 and compressing the circuit complexity per optimizer iteration from O(n4n)O(n4^n)O(n4n) to O(n)O(n)O(n). We derive the exact top-LLL Frobenius error and connect it to worst-case solution error. For a 10-qubit tridiagonal Toeplitz system, the L=64L=64L=64 pruning yields a 256×256\times256× reduction---from 23 million to 90k circuits per optimizer iteration. The D-VQLS framework is validated on the NERSC Perlmutter supercomputer using multi-node, multi-GPU ideal state-vector simulations, achieving over 99.99%99.99\%99.99% fidelity against classical solutions on tridiagonal Toeplitz and Hele--Shaw flow benchmarks, with near-ideal strong scaling up to 24 GPUs and 95.3%95.3\%95.3% weak scaling efficiency at 96 GPUs processing more than 360k circuits per optimizer iteration (from larger-LLL pruning) for the 10-qubit system. Systematic profiling identifies the optimal resource allocation for distributed quantum circuit workloads, yielding a 2.52×2.52\times2.52× speedup for the configurations studied.
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.
Different hybrid quantum-classical algorithms have recently been developed as a near-term way to solve linear systems of equations on quantum devices. However, the focus has so far been mostly on the methods, rather than the problems that they need to tackle. In fact, these algorithms have been run on real hardware only for problems in quantum physics, such as Hamiltonians of a few qubits systems. These problems are particularly favorable for quantum hardware, since their matrices are the sum of just a few unitary terms and since only shallow quantum circuits are required to estimate the cost function. However, for many interesting problems in linear algebra, it appears far less trivial to find an efficient decomposition and to trade it off with the depth of the cost quantum circuits. A first simple yet interesting instance to consider are tridiagonal systems of equations. These arise, for instance, in the discretization of one-dimensional finite element analyses. This work presents a method to solve a class of tridiagonal systems of equations with the variational quantum linear solver (VQLS), a recently proposed variational hybrid algorithm for solving linear systems. In particular, we present a new decomposition for this class of matrices based on both Pauli strings and multi--qubit gates, resulting in less terms than those obtained by just using Pauli gates. Based on this decomposition, we discuss the tradeoff between the number of terms and the near-term implementability of the quantum circuits. Furthermore, we present the first simulated and real-hardware results obtained by solving tridiagonal linear systems with VQLS, using the decomposition proposed.
In solid mechanics, finite element discretization of large-scale static problems produces large sparse linear systems whose solution requires substantial computation time and memory. The variational quantum linear solver (VQLS) offers a hybrid quantum-classical route, but its use in quantum finite element analysis is limited by the decomposition of nonunitary matrices, barren plateaus, and the measurement cost of expectation values. We propose a voxel-based block variational quantum linear solver (Voxel-BVQLS) that combines structured matrix decomposition, the principle of minimum potential energy, and batched quantum tests. First, we construct an LCU decomposition of the stiffness matrix from the recursive block-banded structure of voxel-grid finite element matrices, with the number of unitary terms bounded independently of the problem size. Second, we optimize the ansatz parameters using a minimum-potential-energy objective in place of a conventional VQLS loss function, thereby mitigating barren plateaus in the studied problems. Third, we introduce a block-Hadamard test whose circuit directly estimates weighted sums of multiple inner products, reducing the number of circuit configurations required per iteration. We assessed the proposed method in noiseless classical simulations using three examples. These examples show that the method reduces both the number of unitary terms in the LCU decomposition and the number of iterations required to converge, while still yielding solutions of finite accuracy. Voxel-BVQLS thus provides a structured hybrid quantum-classical framework for quantum finite element analysis on regular grids.
Solving a Poisson equation is generally reduced to solving a linear system with a coefficient matrix AAA of entries aij,i,j=1,2,...,n{a}_{ij}, i,j=1,2,...,naij​,i,j=1,2,...,n, from the discretized Poisson equation. Although the variational quantum algorithms are promising algorithms to solve the discretized Poisson equation, they generally require that AAA be decomposed into a sum of O[poly(log2n)]O[\text{poly}({\text{log}}_{2}n)]O[poly(log2​n)] simple operators in order to evaluate efficiently the loss function. A tensor product decomposition of AAA with 2log2n+12{\text{log}}_{2}n+12log2​n+1 terms has been explored in previous works. In this paper, based on the decomposition of sparse Hamiltonians we greatly reduce the number of terms. We first write the loss function in terms of the operator ${\ensuremath{\sigma}}_{x}\ensuremath{\bigotimes}A$ with ${\ensuremath{\sigma}}_{x}$ denoting the standard Pauli operator. Then for the one-dimensional Poisson equations with different boundary conditions and for the ddd-dimensional Poisson equations with Dirichlet boundary conditions, we decompose ${\ensuremath{\sigma}}_{x}\ensuremath{\bigotimes}A$ into a sum of at most 7 and (4d+1)(4d+1)(4d+1) Hermitian, one-sparse, and self-inverse operators, respectively. We design explicitly the quantum circuits to evaluate efficiently the loss function. The decomposition method and the design of quantum circuits can also be easily extended to linear systems with Hermitian and sparse coefficient matrices satisfying ai,i+c=ac{a}_{i,i+c}={a}_{c}ai,i+c​=ac​ for $c=0,1,...,n\ensuremath{-}1$ and $i=0,\ensuremath{\cdots},n\ensuremath{-}1\ensuremath{-}c$.
Abstract To solve the Poisson equation it is usually possible to discretize it into solving the corresponding linear system Ax = b. Variational quantum algorithms (VQAs) for the discretized Poisson equation have been studied before. We present a VQA based on the banded Toeplitz systems for solving the Poisson equation with respect to the structural features of matrix A. In detail, we decompose the matrices A and A 2 into a linear combination of the corresponding banded Toeplitz matrix and sparse matrices with only a few non-zero elements. For the one-dimensional Poisson equation with different boundary conditions and the d-dimensional Poisson equation with Dirichlet boundary conditions, the number of decomposition terms is less than that reported in [Phys. Rev. A 2023 108, 032 418 ]. Based on the decomposition of the matrix, we design quantum circuits that efficiently evaluate the cost function. Additionally, numerical simulation verifies the feasibility of the proposed algorithm. Finally, the VQAs for linear systems of equations and matrix-vector multiplications with the K-banded Toeplitz matrix T n K are given, where T n K ∈ R n × n and K ∈ O ( ploylog n ) .