Explicit Quantum Circuit Simulation of Nonlinear 1-Dimensional Fluid with Carleman-linearized Boltzmann Method

• URL: http://arxiv.org/abs/2606.12770v1
• Date: Thu, 11 Jun 2026 00:25:13 GMT
• Title: Explicit Quantum Circuit Simulation of Nonlinear 1-Dimensional Fluid with Carleman-linearized Boltzmann Method
• Abstract summary: We show the leading nonlinearity through second-order Carleman linearization of the one-dimensional Boltzmann equation.<n>We also demonstrate, via explicit quantum-circuit simulation, the preparation of the final-time state using a Taylor-expansion-based ODE solver.
• Score: 0.28106259549258145
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computation of fluid dynamics has attracted growing attention as a key application of fault-tolerant quantum computers anticipated in the coming decade, with lattice Boltzmann methods emerging as a particularly promising approach. Explicit and efficient elementary-gate-level circuit simulations, however, have so far been demonstrated only in the linear case. Here we include the leading nonlinearity through second-order Carleman linearization of the one-dimensional Boltzmann equation, and demonstrate, via explicit quantum-circuit simulation, the preparation of the final-time state using a Taylor-expansion-based ODE solver based on the quantum singular value transformation. With this construction, we analyze the gate and qubit complexities, which scale logarithmically with the grid size, the nonlinearity captured by the higher-order Carleman linearization, and the practical utility of higher-order expansions in the Taylor ODE solver. The construction provides a concrete baseline for computational cost reduction and further developments such as extensions to higher dimensions, complex geometries, and the extraction of physical quantities, towards industrially useful quantum CFD.

Related papers

• Matrix Product Evolution: A Method for Simulating Quantum Circuits Using Tensor Networks [0.0]
  We introduce a tensor-train representation of quantum circuits constructed along the circuit depth rather than along the qubit index.<n>Within this formulation, the simulation of a quantum circuit is modeled as the contraction of multiple MPE tensors.<n>We investigate the numerical behavior of this MPE-based contraction framework through simulations of random quantum circuits and the time evolution of a quantum many-body state.
  arXiv  Detail & Related papers  (2026-08-04T11:07:41Z)
• Analytical Series Expansion for Efficient Gradient Evaluation in Multi-Qubit Optimal Control [42.97938764966747]
  We present a unifying framework for gradient-based quantum optimal control.<n>For the case of unitary propagators, we derive a series expansion involving time-independent commutators and time-dependent coefficients.<n>The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions.
  arXiv  Detail & Related papers  (2026-07-29T12:50:52Z)
• A Demonstration of Quantum Circuit Implementation for Obstacle Flow Using Carleman-Linearized Lattice Boltzmann Method [0.0]
  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.
  arXiv  Detail & Related papers  (2026-05-27T08:20:48Z)
• Hybrid quantum-classical algorithms for complex nonlinear partial differential equations with Ginzburg-Landau potential and vortex motion laws [35.75479170931658]
  We propose quantum algorithms for complex-valued nonlinear partial differential equations in the strongly nonlinear regime.<n>Examples include the complex-valued nonlinear Schrdinger equation, as well as nonlinear heat wave equations with Ginzburg-Landau-type nonlinearity.<n>We show that the same principle extends to dissipative Ginzburg--Landau vortex dynamics and to vortex filaments in three-dimensional superconductivity.
  arXiv  Detail & Related papers  (2026-04-15T16:50:41Z)
• Quantum algorithms for the fractional Poisson equation via rational approximation [20.497126318288906]
  We present a quantum algorithm for solving the fractional equation ((-)s u = f) with (s in (0,1)) on bounded domains.<n>The proposed approach combines rational approximation techniques with quantum linear system solvers to achieve exponential quantum advantage.
  arXiv  Detail & Related papers  (2026-04-01T08:08:33Z)
• Quantum simulation of Liouville equation in geometrical optics with partial transmission and reflection via Schrödingerization [42.22857110018992]
  This paper investigates quantum simulation algorithms for the Liouville equation in geometrical optics with partial transmission and reflection at sharp interfaces.<n>By means of a warped phase transformation in one higher dimension, the Schrdingerization method converts linear partial differential equations into a system of Schrdinger-type equations with unitary evolution.<n>We present detailed constructions of the resulting quantum algorithms and show through complexity analysis that the proposed methods achieve quantum advantage in the precision parameter $$ over their classical counterparts.
  arXiv  Detail & Related papers  (2026-03-12T14:47:16Z)
• Amplitude-Phase Separation toward Optimal and Fast-Forwardable Simulation of Non-Unitary Dynamics [39.740772144144366]
  Amplitude-Phase Separation (APS) methods formulates any non-unitary evolution into separate simulation of a unitary operator and a Hermitian operator.<n>APS provides an effective and generic pathway for developing efficient quantum algorithms for general non-unitary dynamics.
  arXiv  Detail & Related papers  (2026-02-10T09:23:55Z)
• Quantum Circuits for the Black-Scholes equations via Schrödingerisation [26.57843095806779]
  We construct quantum circuits for the Black-Scholes equations.<n>We will conduct a thorough complexity analysis to highlight the quantum advantages of our approach.
  arXiv  Detail & Related papers  (2025-05-07T10:21:12Z)
• 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)
• Solving the Nonlinear Vlasov Equation on a Quantum Computer [0.0]
  We present a mapping of the nonlinear, electrostatic Vlasov equation with Krook-type collision operators, discretized on a (1+1) dimensional grid.<n>We derive upper bounds for the query- and gate complexities of the quantum algorithm in the limit of large grid sizes.<n>We show that the quantum algorithm places severe restrictions on potential applications.
  arXiv  Detail & Related papers  (2024-11-28T18:32:30Z)
• Towards Variational Quantum Algorithms for generalized linear and nonlinear transport phenomena [0.0]
  This article proposes a Variational Quantum Algorithm to solve linear and nonlinear thermofluid dynamic transport equations.<n>The hybrid classical-quantum framework is applied to problems governed by the heat, wave, and Burgers' equation in combination with different engineering boundary conditions.
  arXiv  Detail & Related papers  (2024-11-22T13:39:49Z)
• 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)
• 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)

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.