aiqbench analysis
This study advances variational quantum algorithms by introducing an exact block encoding of the discrete Laplacian, which reduces circuit complexity from quadratic to constant per cost evaluation. The research highlights critical practical constraints, specifically how classical optimizer selection dictates optimization convergence and performance on physically relevant benchmarks like heat conduction and fluid dynamics. These findings provide essential insights for researchers developing hybrid quantum-classical workflows for solving partial differential equations.
Variational Quantum Linear Solver via Block Encoding for the Poisson Equation
arXiv:2608.19655v1 Announce Type: new 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.
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.
arXiv:2608.19655 [quant-ph]
(or arXiv:2608.19655v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2608.19655 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 234 words
Related coverage

Maryland Team Solves Poisson Equations Using One Quantum Circuit
Quantum Zeitgeist · Aug 24, 2026

Explicit Block-Encodings Solve Biharmonic Equations on Quantum Computers
Quantum Zeitgeist · Jul 27, 2026
A QSVT-Based Quantum Jacobi Algorithm for Linear Systems with Application to the Poisson Equation
arXiv · Sep 22, 2026
Training Quantum Dragons
arXiv · Jul 30, 2026