A Demonstration of Quantum Circuit Implementation for Obstacle Flow Using Carleman-Linearized Lattice Boltzmann Method

• URL: http://arxiv.org/abs/2605.28135v1
• Date: Wed, 27 May 2026 08:20:48 GMT
• Title: A Demonstration of Quantum Circuit Implementation for Obstacle Flow Using Carleman-Linearized Lattice Boltzmann Method
• Abstract summary: We implement a quantum algorithm for two-dimensional linearized fluid flow around an obstacle.<n>Inflow, outflow, and no-slip boundary conditions are formulated as sparse matrix operations.<n>We demonstrate logarithmic scaling of the required numbers of qubits and gates with respect to the number of lattice points.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fluid simulations, especially at high Reynolds numbers, are computationally expensive on classical computers, making them promising application targets for quantum computing. Recent studies have combined the lattice Boltzmann method (LBM) with Carleman linearization to design quantum algorithms for computational fluid dynamics (CFD). However, practical quantum-circuit implementations of these algorithms that incorporate non-periodic boundary conditions have not been fully explored. In this work, we implement a quantum algorithm for two-dimensional linearized fluid flow around an obstacle, using block-encoding of the linear-system matrix and quantum singular value transformation (QSVT) to solve it. Inflow, outflow, and no-slip boundary conditions are formulated as sparse matrix operations and efficiently embedded into quantum circuits using index-value encoding. We demonstrate logarithmic scaling of the required numbers of qubits and gates with respect to the number of lattice points, suggesting the potential feasibility of quantum-computational fluid dynamics simulations.

Related papers

• Quantum algorithm for the lattice Boltzmann method with applications on real quantum devices [0.0]
  We introduce a novel quantum algorithm for the lattice Boltzmann method (LBM) based on the one-step simplified LBM.<n>The new algorithm has potential for full end-to-end quantum utility especially for linear problems.
  arXiv  Detail & Related papers  (2026-03-02T17:45:07Z)
• Simulating non-trivial incompressible flows with a quantum lattice Boltzmann algorithm [0.4397520291340695]
  We extend the recent quantum algorithm for the incompressible LBM to account for realistic fluid dynamics setups by incorporating walls, inlets, outlets, and external forcing.<n>Our results provide a pathway to accurate quantum simulation of nonlinear fluid dynamics, and a framework for extending quantum LBM to more challenging flow configurations.
  arXiv  Detail & Related papers  (2025-12-05T15:10:50Z)
• An em algorithm for quantum Boltzmann machines [40.40469032705598]
  We develop a quantum version of the em algorithm for training quantum Boltzmann machines.<n>We implement the algorithm on a semi-quantum restricted Boltzmann machine, where quantum effects are confined to the hidden layer.
  arXiv  Detail & Related papers  (2025-07-29T07:59:22Z)
• 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)
• Quantum lattice Boltzmann method for simulating nonlinear fluid dynamics [12.270811823319576]
  We introduce a novel ensemble description of lattice gas for simulating nonlinear fluid dynamics on a quantum computer.<n>We propose a quantum lattice Boltzmann method that relies on linear operations with medium dimensionality.
  arXiv  Detail & Related papers  (2025-02-23T13:25:35Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Compact quantum algorithms for time-dependent differential equations [0.0]
  We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems.<n>We generate hybrid quantum-classical algorithms that efficiently perform matrix-vector multiplication and matrix inversion operations.
  arXiv  Detail & Related papers  (2024-05-16T02:14:58Z)
• 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)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Quantum algorithm for the Navier Stokes equations by using the streamfunction vorticity formulation and the lattice Boltzmann method [0.0]
  A new algorithm for solving the Navier-Stokes equations (NSE) on a quantum device is presented. For the fluid flow equations the stream function-vorticity formulation is adopted, while the lattice Boltzmann method (LBM) is utilized for solving the corresponding system of equations numerically for one time step.
  arXiv  Detail & Related papers  (2021-03-05T17:07:33Z)

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.