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

Mechanisms and machine science

Performance Study of Variational Quantum Linear Solver for Linear Elastic Problems

Xiang Rao, Kou Du

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-3-031-68775-4_6

Related papers

Decomposition-free variational quantum linear solver: Application in computational mechanics

Yongchun Xu, Heng Hu

Computer Methods in Applied Mechanics and Engineering•Sep 17, 2025•11 citations

A comparison of various classical optimizers for a variational quantum linear solver

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

arXiv:2106.08682•Quantum Information Processing•Jun 1, 2021•105 citations

Iterative Refinement for Variational Quantum Linear Solver

Yoshiyuki Saito, Xinwei Lee, Dongsheng Cai +2 more

Lecture notes in networks and systems•Jan 1, 2023•2 citations

Variational Quantum Linear Solver Enhanced Quantum Support Vector Machine

Yi, Jianming, Suresh, Kalyani, Moghiseh, Ali +1 more

•Nov 26, 2025•0 citations

Measurement-Efficient Variational Quantum Linear Solver for Carleman-Linearized Nonlinear Dynamics

Yunya Liu, Pai Wang

•Jan 1, 2026•0 citations

Variational Quantum Linear Solver via Block Encoding for the Poisson Equation

Viraj Dsouza, Ayush Singhal, Alex Khan +2 more

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.

quant-pharXiv:2608.19655•Aug 21, 2026•0 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.