Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods

• URL: http://arxiv.org/abs/2606.01426v1
• Date: Sun, 31 May 2026 19:55:02 GMT
• Title: Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods
• Abstract summary: We introduce a new method for imposing simple boundary conditions on Quantum Lattice Boltzmann Methods (QLBM)<n>Our method forgoes the partitioning of the solid domain into segments and instead applies a coherent operation on the entire boundary reflection.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Lattice Boltzmann Methods (QLBM) have emerged as a promising candidate for quantum realizations of computational fluid dynamics solvers. However, despite intensive research into the QLBM in recent years, methods for imposing boundary conditions remain limited both in terms of efficiency and expressivity. In this work, we introduce a new method for imposing simple boundary conditions on QLBM that overcomes several limitations of current approaches. Our method forgoes the partitioning of the solid domain into segments and instead applies a single, coherent operation on the entire boundary. We show that our method requires fewer resources both asymptotically and practically for bounce-back and specular reflection boundary conditions.

Related papers

• Quantum lattice Boltzmann method via density-matrix encoding for fluid simulation with wall boundary conditions [25.152186010859236]
  The quantum lattice Boltzmann method (QLBM) holds promise for efficient fluid simulations.<n>We propose a QLBM algorithm that incorporates wall boundaries as well as inlet/outlet velocity conditions.<n>Our QLBM is quantitatively validated through simulations of two-dimensional flows past a backward-facing step.
  arXiv  Detail & Related papers  (2026-09-05T16:40:36Z)
• Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints [49.76332265680669]
  This paper examines a crucial subset of problems where both the objective and constraint functions are weakly convex.<n>Existing methods often face limitations, including slow convergence rates or reliance on double-loop designs.<n>We introduce a novel single-loop penalty-based algorithm to overcome these challenges.
  arXiv  Detail & Related papers  (2025-04-21T17:15:48Z)
• Counterdiabatic Driving with Performance Guarantees [0.5509544214967608]
  We propose and analyze a non-variational, system-agnostic CD expansion method.<n>We show that it converges exponentially quickly in the expansion order.<n>In particular, we show that a time determined by the quantum speed limit is sufficient to prepare the desired ground state.
  arXiv  Detail & Related papers  (2025-03-03T19:00:01Z)
• Functional Gradient Flows for Constrained Sampling [29.631753643887237]
  We propose a new functional gradient ParVI method for constrained sampling, called constrained functional gradient flow (CFG) We also present novel numerical strategies to handle the boundary integral term arising from the domain constraints.
  arXiv  Detail & Related papers  (2024-10-30T16:20:48Z)
• Momentum exchange method for quantum Boltzmann methods [0.0]
  This paper marks the first quantum method proposed to efficiently calculate quantities of interest (QoIs) from a state vector representing the flow field.<n>In particular, we propose a method to calculate the force acting on an object immersed in the fluid using a quantum version of the momentum exchange method (MEM) that is commonly used in lattice Boltzmann methods.
  arXiv  Detail & Related papers  (2024-04-26T12:31:46Z)
• Qubit Number Optimization for Restriction Terms of QUBO Hamiltonians [62.997667081978825]
  It is mathematically allowed to ask for fractional values of $R$. We show how they can reduce the number of qubits needed to implement the restriction hamiltonian even further. Finally, we characterize the response of DWave's Advantage$_$system4.1 Quantum Annealer (QA) when faced with the implementation of FRCs.
  arXiv  Detail & Related papers  (2023-06-12T08:25:56Z)
• Guaranteed Conservation of Momentum for Learning Particle-based Fluid Dynamics [96.9177297872723]
  We present a novel method for guaranteeing linear momentum in learned physics simulations. We enforce conservation of momentum with a hard constraint, which we realize via antisymmetrical continuous convolutional layers. In combination, the proposed method allows us to increase the physical accuracy of the learned simulator substantially.
  arXiv  Detail & Related papers  (2022-10-12T09:12:59Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• Quantum reinforcement learning in continuous action space [1.4893633973966713]
  We introduce a quantum Deep Deterministic Policy Gradient algorithm that efficiently addresses both classical and quantum sequential decision problems.<n>A one-time optimization produces a model that outputs the control sequence required to drive a fixed initial state to any desired target state.<n>We demonstrate the effectiveness of our method through simulations and discuss its potential applications in quantum control.
  arXiv  Detail & Related papers  (2020-12-19T15:16:17Z)
• Conditional gradient methods for stochastically constrained convex minimization [54.53786593679331]
  We propose two novel conditional gradient-based methods for solving structured convex optimization problems. The most important feature of our framework is that only a subset of the constraints is processed at each iteration. Our algorithms rely on variance reduction and smoothing used in conjunction with conditional gradient steps, and are accompanied by rigorous convergence guarantees.
  arXiv  Detail & Related papers  (2020-07-07T21:26:35Z)

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.