Quantum Hamiltonian simulation of linearised Euler equations in complex geometries

• URL: http://arxiv.org/abs/2510.17978v1
• Date: Mon, 20 Oct 2025 18:00:16 GMT
• Title: Quantum Hamiltonian simulation of linearised Euler equations in complex geometries
• Authors: Vladyslav Bohun, Andrij Kuzmak, Maciej Koch-Janusz,
• Abstract summary: Quantum computing promises exponential improvements in solving systems of partial differential equations.<n>One approach is via mapping classical CFD problems to a quantum Hamiltonian evolution.<n>Here we extend this method to more complex and practically relevant cases.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing promises exponential improvements in solving large systems of partial differential equations (PDE), which forms a bottleneck in high-resolution computational fluid dynamics (CFD) simulations, in, among others, aerospace applications and weather forecasting. One approach is via mapping classical CFD problems to a quantum Hamiltonian evolution, for which recently an explicit quantum circuit construction has been shown in simple cases, allowing proof-of-concept execution on quantum processors. Here we extended this method to more complex and practically relevant cases. We first demonstrate how boundary conditions corresponding to arbitrary complex-shaped obstacles can be introduced in the quantum representations of elementary difference operators used to implement the PDE. We provide explicit and efficient circuit constructions, and show they neither increase the Trotter error, nor asymptotic gate complexity with respect to the free space equation. Using these methods we then derive quantum circuits for simulating the linearized Euler equations in a presence of a background fluid flow and obstacles. We illustrate our results by simulating the obtained quantum circuits for a number of boundary conditions, and compare the errors of the quantum solution to classical finite difference methods.

Related papers

• Trotter-based quantum algorithm for solving transport equations with exponentially fewer time-steps [0.0]
  We present a quantum numerical scheme based on three steps: quantum state preparation, evolution, and measurement.<n>We introduce novel vector-norm analysis and prove that the number of time-steps can be reduced by a factor exponential in the number of qubits.<n>We also present efficient quantum circuits and numerical simulations that confirm the predicted vector-norm scaling.
  arXiv  Detail & Related papers  (2025-08-21T16:14:05Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Quantum circuits for partial differential equations in Fourier space [0.4593579891394288]
  We show that the quantum Fourier transform (QFT) can enable the design of quantum circuits that are particularly simple.<n> circuits are efficient with respect to dimensionality and pave the way for current quantum computers to solve high-dimensional PDEs.
  arXiv  Detail & Related papers  (2025-05-22T16:53:17Z)
• Quantum physics informed neural networks for multi-variable partial differential equations [1.024113475677323]
  We introduce an architecture specifically designed to compute second-order (and higher-order) derivatives without relying on nested automatic differentiation methods.<n>This approach mitigates the unwanted side effects associated with nested gradients in simulations, paving the way for more efficient and accurate implementations.<n>As a proof-of-concept, we solve a one-dimensional instance of the heat equation, demonstrating its effectiveness in handling PDEs.
  arXiv  Detail & Related papers  (2025-03-15T19:55:33Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Hamiltonian simulation for hyperbolic partial differential equations by scalable quantum circuits [1.6268784011387605]
  This paper presents a method that enables us to explicitly implement the quantum circuit for Hamiltonian simulation. We show that the space and time complexities of the constructed circuit are exponentially smaller than those of conventional classical algorithms.
  arXiv  Detail & Related papers  (2024-02-28T15:17:41Z)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Variational Quantum Simulation of Partial Differential Equations: Applications in Colloidal Transport [0.0]
  We show that real-amplitude ansaetze with full circular entangling layers lead to higher-fidelity solutions. To efficiently encode impulse functions, we propose a graphical mapping technique for quantum states.
  arXiv  Detail & Related papers  (2023-07-14T05:51:57Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Solving nonlinear differential equations with differentiable quantum circuits [21.24186888129542]
  We propose a quantum algorithm to solve systems of nonlinear differential equations. We use automatic differentiation to represent function derivatives in an analytical form as differentiable quantum circuits. We show how this approach can implement a spectral method for solving differential equations in a high-dimensional feature space.
  arXiv  Detail & Related papers  (2020-11-20T13:21:11Z)

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.