Variational Quantum Linear Solver via Block Encoding for the Poisson Equation

• URL: http://arxiv.org/abs/2608.19655v1
• Date: Thu, 20 Aug 2026 05:50:37 GMT
• Title: Variational Quantum Linear Solver via Block Encoding for the Poisson Equation
• Abstract summary: We present a variational quantum linear solver (VQLS) for the Poisson equation built on an exact block encoding the discrete Laplacian.<n>We demonstrate its performance on physically motivated benchmarks.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• A Quantum Algorithm for Solving the Poisson Equation for Free Field Conditions via the Hockney Method [0.0]
  This work presents a quantum algorithm solving the problem of the Poisson equation.<n>The algorithm just uses a procedure for multiplying the state vector by a diagonal matrix w.r.t. amplitude encoding.<n>The functionality of the algorithm is verified via comparing the results obtained from state vector simulations for one- and two-dimensional test examples.
  arXiv  Detail & Related papers  (2026-08-11T11:29:12Z)
• Solving Differential Equations Using Continuous-Variable Quantum Annealing [0.0]
  We develop a continuous-variable quantum annealing formulation for solving linear differential equations.<n>The proposed formulation reproduces the corresponding analytical solutions.<n>These results establish a potential route toward solving differential equations without the discretization overhead inherent in qubit-based implementations.
  arXiv  Detail & Related papers  (2026-08-05T09:06:29Z)
• Circuit Depth Reduction of One-Ancilla Quantum Differential Equation Solver via Extrapolation [1.0742675209112622]
  A recent one-ancilla quantum differential equation solver provides a hardware-friendly and locality-preserving approach.<n>We reduce the maximum single-run circuit depth to $O(mathrmpolylog (1/)$ without adding quantum ancillae or sacrificing locality.<n> Numerical experiments on the Hatano-Nelson model (ODE) and the convection-diffusion equation (PDE) demonstrate the effectiveness of the approach.
  arXiv  Detail & Related papers  (2026-07-08T13:20:43Z)
• An HHL-Based Quantum-Classical Solver for the Incompressible Navier-Stokes Equations with Approximate QST [0.0]
  Harrow-Hassidim-Lloyd (HHL) offer the potential for exponential speedups for solving incompressible Navier-Stokes equations.<n>We demonstrate both accurate lid-driven cavity flow simulations as a fully integrated benchmark problem, and accurate flow of the Taylor-Green vortex.<n>We implement the solver using IBM's Qiskit framework and validate the hybrid quantum-classical simulation against standard classical numerical methods.
  arXiv  Detail & Related papers  (2026-03-18T19:13:06Z)
• Transmutation based Quantum Simulation for Non-unitary Dynamics [35.35971148847751]
  We present a quantum algorithm for simulating dissipative diffusion dynamics generated by positive semidefinite operators of the form $A=Ldagger L$.<n>Our main tool is the Kannai transform, which represents the diffusion semigroup $e-TA$ as a Gaussian-weighted superposition of unitary wave propagators.
  arXiv  Detail & Related papers  (2026-01-07T05:47:22Z)
• Self-Supervised Coarsening of Unstructured Grid with Automatic Differentiation [55.88862563823878]
  In this work, we present an original algorithm to coarsen an unstructured grid based on the concepts of differentiable physics.<n>We demonstrate performance of the algorithm on two PDEs: a linear equation which governs slightly compressible fluid flow in porous media and the wave equation.<n>Our results show that in the considered scenarios, we reduced the number of grid points up to 10 times while preserving the modeled variable dynamics in the points of interest.
  arXiv  Detail & Related papers  (2025-07-24T11:02:13Z)
• Solving wave equation problems on D-Wave quantum annealers [44.99833362998488]
  We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by the D-Wave systems within a pseudospectral scheme.<n>We assess the performance of different strategies of encoding based on algebraic arguments and the adiabatic condition.
  arXiv  Detail & Related papers  (2025-07-18T08:06:43Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations [0.0]
  We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS)<n>This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions.<n>We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation.
  arXiv  Detail & Related papers  (2025-01-19T19:03:29Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Solving Systems of Linear Equations: HHL from a Tensor Networks Perspective [37.57762772762448]
  This work presents a new approach for simulating the HHL linear systems of equations solver algorithm with tensor networks.<n>A novel HHL in the qudits formalism, the generalization of qubits, is developed, and then its operations are transformed into an equivalent classical HHL.
  arXiv  Detail & Related papers  (2023-09-11T08:18:41Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Noisy Tensor Ring approximation for computing gradients of Variational Quantum Eigensolver for Combinatorial Optimization [33.12181620473604]
  Variational Quantum algorithms have established their potential to provide computational advantage in the realm of optimization. These algorithms suffer from classically intractable gradients limiting the scalability. This work proposes a classical gradient method which utilizes the parameter shift rule but computes the expected values from the circuits using a tensor ring approximation.
  arXiv  Detail & Related papers  (2023-07-08T03:14:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.