Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.32310

Conserved and relaxing modes enable polynomial-success coherent Carleman lattice Boltzmann evolution

Hua-Dong Yao, Sauro Succi

quant-phphysics.comp-phSubmitted Sep 26, 2026• Announced Sep 29, 2026• 1 citation
arXivHTMLPDF

Abstract

Carleman linearization represents nonlinear lattice Boltzmann collision dynamics in a form amenable to quantum block encoding, but low postselection probabilities in existing population-space encodings make coherent multi-step evolution exponentially unlikely to succeed. We present a quantum Carleman lattice Boltzmann scheme based on the multi-relaxation-time collision operator in a weighted Hermite moment basis. In this basis, the lifted collision operator separates into small coupled blocks whose norm exceeds unity because of the coupling between conserved and relaxing modes. This block structure enables a norm-attaining block encoding with a single-step success probability close to unity. Crucially, scaling the pair sector for a prescribed evolution horizon makes the combined encoding and sector-selection overhead grow polynomially rather than exponentially with the number of steps. For a hundred-step evolution, the resulting complete-run success probability exceeds that of population-space encodings by orders of magnitude. Over horizons of several tens of steps, the truncated dynamics reproduces the nonlinearly generated modes of a benchmark flow to within a few percent. We verify the combined preparation, evolution and readout protocol as a single unitary circuit and give a complete gate-level resource estimate for extracting a nonlinear observable of the benchmark flow from a coherent Carleman evolution. The block structure of conserved and relaxing modes holds equally on three-dimensional lattices and provides a constructive route to norm-attaining encodings for lattice Boltzmann models with quadratic equilibria.

AI Summary

The paper asks whether postselection makes coherent, multi-step Carleman lattice Boltzmann simulation exponentially costly, and how collision encoding affects observable-level resources. It studies a level-2 lift of quadratic-equilibrium lattice Boltzmann dynamics, using multi-relaxation-time collision in a weighted Hermite moment basis. The collision separates into a diagonal part and three $2\times2$ blocks coupling conserved-momentum products to relaxing moments. Halmos dilations attain its operator norm. For pair-sector scale $\lambda$ and fixed interior BGK rate $\omega$, the normalization is $\alpha=1+c/\lambda^2+O(\lambda^{-4})$, with $c=\omega/[4(2-\omega)]$. Telescoping evolution and output-selection probabilities gives, after horizon-dependent optimization $\lambda^2\sim2cT$, near-rest success $P^*\sim e^{-1}/(2cTN)$, versus $T^{-2}$ for a two-term LCU. Fixed-scale success remains exponential. Subtracting the rest state reduces the selection penalty. The block structure also extends to D3Q19 and D3Q27. Algebraic derivations, numerical operator checks and small-lattice statevector simulations establish the encoding and preparation–evolution–readout identities. Classical validation on a two-mode flow at Mach number $0.087$ reproduces generated acoustic and vortical peaks within $1.9\%$ and $2.6\%$. A representative $32^2$ acoustic task requires 188 logical qubits and approximately $2.5\times10^{13}$ T gates for $10\%$ statistical precision at 95% confidence. No quantum advantage is demonstrated: a matched few-mode Fourier baseline costs $1.4\times10^7$ flops. Limitations include short, numerically established truncation windows, uncosted generic-data preparation, benchmark-calibrated estimation lengths, and resource counts excluding error correction and routing. Three-dimensional dynamics, boundaries and forcing are not validated.

Little sign of AI-generated textStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
33 pages, 13 figures

Related papers

Representation-split Carleman lattice Boltzmann with near-unit step success probability on quantum computers

Hua-Dong Yao, Sauro Succi

The Carleman lattice Boltzmann method replaces the quadratic collision of the lattice Boltzmann equation by a linear map on a lifted state. Existing block encodings of this map succeed with probability $10^{-5}$ to $10^{-2}$ per step, so that the probability of a multi-step evolution decays exponentially with the number of steps. This study develops multi-relaxation-time Carleman lattice Boltzmann, a representation split in which the Carleman-lifted collision is performed in a moment basis on the amplitude-encoded state, while streaming remains a permutation in population space. The level-2 hierarchy closes under collision but not under streaming, which generates the work of pressure, advection and stress on the momentum flux. The state therefore remains the full pair array, and the moment representation is an orthogonal change of basis of the population one, with identical dynamics and truncation error. The operator to be block encoded changes with the basis, and with it the success probability of a quantum step. In the weighted Hermite basis with the amplitude encoding $f_i/\sqrt{w_i}$, the relaxation is a diagonal operator of norm one, and the level-2 collision stage becomes this diagonal plus a sparse coupling from products of conserved moments. A structured block encoding of this form raises the single-step success probability on the D2Q9 lattice from $10^{-2}$ for the best population encoding to 0.98. With the pair sector in relative coordinates and scaled, one step requires $O(\log^2 N)$ Toffoli gates and is verified by statevector simulation. The encoding and readout overhead of a $T$-step run is then polynomial in $T$ and $N$ rather than accumulating a factor $p^T$. For resolved flows, the remaining exponential loss in coherent multi-step Carleman lattice Boltzmann evolution is set by the non-equilibrium norm relaxed by dissipation rather than by the block encoding.

physics.comp-phCross-listedarXiv:2610.20620•Sep 9, 2026•1 citation

Carleman-lattice-Boltzmann quantum circuit with matrix access oracles

Claudio Sanavio, William Simon, Alexis Ralli +2 more

We apply Carleman linearization of the Lattice Boltzmann (CLB) representation of fluid flows to quantum emulate the dynamics of a two-dimensional Kolmogorov-like flow. We assess the accuracy of the result and find a relative error of the order of 10−3 with just two Carleman iterates for a range of the Reynolds number up to a few hundreds. We first define a gate-based quantum circuit for the implementation of the CLB method and then exploit the sparse nature of the CLB matrix to build a quantum circuit based on block-encoding techniques which makes use of matrix oracles. It is shown that the gate complexity of the algorithm is thereby dramatically reduced, from exponential to quadratic. However, due to the need of employing up to seven ancilla qubits, the probability of success of the corresponding circuit for a single time step is too low to enable multi-step time evolution. Several possible directions to circumvent this problem are briefly outlined.

arXiv:2501.02582•Physics of Fluids•Mar 1, 2025•25 citations

Quantum algorithm for lattice Boltzmann (QALB) simulation of incompressible fluids with a nonlinear collision term

Wael Itani, Katepalli R. Sreenivasan, Sauro Succi

We present a full quantum algorithm for the lattice Boltzmann method for simulating fluid flows, the only such algorithm to implement both the streaming and collision substeps as unitary operators using an efficient number of qubits. We use Hamiltonian simulation as the main route underlying the algorithm, and show that it uses qubits that scale logarithmically in the flow Reynolds number but gates that scale only polynomially. We motivate the discussion by a brief overview of existing attempts at simulating classical fluids on quantum computers and present a pedagogical discussion on assigning quantum operators to classical variables in both the streaming and the collision substeps, after highlighting the incompatibility of the latter with the implementations of the streaming step that exists in the literature. We use the Bhatnagar–Gross–Krook ansatz for the collision term, representing the relaxation toward an equilibrium distribution. For nonlinear collisions, we use Kowalski's framework that links the nonlinear dynamics of a system to the evolution of bosonic modes, assigning a Carleman linearization order to the truncation in the Fock space of the bosons. We present the qubit and gate complexities, in terms of the chosen accuracy and the Reynolds number. In the Appendix, we work out the details of implementing the operators of the truncated bosonic Fock space in terms of single-qubit gates as well as the error scaling for a general polynomial driving function.

arXiv:2304.05915•Physics of Fluids•Jan 1, 2024•76 citations

Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation

Reuben Demirdjian, Thomas Hogancamp, Abeynaya Gnanasekaran +2 more

Nonlinear ordinary and partial differential equations are ubiquitous in science and engineering, yet finding their solutions is often computationally intractable for classical hardware. To determine if quantum computers can offer a practical advantage, one critical challenge that must be solved is determining how to efficiently load exponentially sized matrices onto quantum hardware. In this article, we introduce an alternative linear combination of unitaries (LCU) strategy which relies on an intermediate linear combination of non-unitaries (LCNU) and a systematic embedding procedure. One advantage of this LCU strategy is that it maintains the exact number of terms as in the LCNU. Therefore, this approach offers a data loading framework for matrices that lack an efficient decomposition using the standard LCU alone. Using this approach, we construct a generalized LCNU framework for any Carleman linearized autonomous dynamical system having a polynomial nonlinearity. To demonstrate the effectiveness of our approach, we construct an LCNU for the 3D Carleman linearized lattice Boltzmann equation (LBE). Here, we find that the number of terms in the decomposition scales like $N_s\sim\mathcal{O}(α^2Q^2)$, where $α$ is the Carleman truncation order and $Q$ is the number of discrete velocities. Importantly, $N_s$ is independent of the number of spatial and temporal discretization points. We then perform a resource estimation of our LCNU's T gate cost when combined with the (1) PREP and SELECT block encoding oracles, and (2) variational quantum linear solver. In the former, the T cost scales like $\mathcal{O}(α^3Q^2(\log_2n)^2)$, where $n$ is the total number of spatial grid points. The latter requires exactly $N_s^2(\log_2 (2n_tn^α)+1)$ circuits per iteration for $n_t$ time steps, with a worst case T gate cost of $\mathcal{O}(α(\log_2Qn)^2)$ among them.

quant-pharXiv:2605.00302•May 4, 2026•2 citations

Lattice Boltzmann–Carleman quantum algorithm and circuit for fluid flows at moderate Reynolds number

Claudio Sanavio, Sauro Succi

We present a quantum computing algorithm for fluid flows based on the Carleman-linearization of the Lattice Boltzmann (LB) method. First, we demonstrate the convergence of the classical Carleman procedure at moderate Reynolds numbers, namely, for Kolmogorov-like flows. Then we proceed to formulate the corresponding quantum algorithm, including the quantum circuit layout, and analyze its computational viability. We show that, at least for moderate Reynolds numbers between 10 and 100, the Carleman–LB procedure can be successfully truncated at second order, which is a very encouraging result. We also show that the quantum circuit implementing the single time-step collision operator has a fixed depth, regardless of the number of lattice sites. However, such depth is of the order of ten thousands quantum gates, meaning that quantum advantage over classical computing is not attainable today, but could be achieved in the near or mid-term future. The same goal for the multi-step version remains, however, an open topic for future research.

arXiv:2310.17973•AVS Quantum Science•Apr 22, 2024•58 citations

Autonomous Lindblad Realizability of Nonunitary Linear Dynamics with a Carleman Lattice Boltzmann Application

Muhammad Idrees Khan

Carleman lifting converts nonlinear polynomial dynamics into finite linear systems, but the resulting truncations are generally nonunitary and need not correspond to physical quantum evolution. We prove that a finite linear endpoint admits an autonomous Gorini--Kossakowski--Sudarshan--Lindblad (GKSL) realization on vacuum coherences if and only if it is invertible and power bounded. The construction is explicit and realizes the nonunitary map directly as open-system dynamics, with no endpoint postselection and with one encoding and one decoding over repeated timesteps. We apply the result to the complete D2Q9 multiple-relaxation-time lattice Boltzmann (LB) timestep by compiling collision and periodic streaming into a single Carleman endpoint. The resulting GKSL evolution reproduces the classical Carleman trajectory over multiple timesteps, while the remaining discrepancy from nonlinear LB dynamics is the expected Carleman truncation error. The result establishes a general criterion for autonomous open-quantum realization of finite nonunitary dynamics, with Carleman--LB dynamics as a concrete example.

physics.comp-phCross-listedarXiv:2608.09808•Aug 11, 2026•2 citations
Carleman linearization represents nonlinear lattice Boltzmann collision dynamics in a form amenable to quantum block encoding, but low postselection probabilities in existing population-space encodings make coherent multi-step evolution exponentially unlikely to succeed. We present a quantum Carleman lattice Boltzmann scheme based on the multi-relaxation-time collision operator in a weighted Hermite moment basis. In this basis, the lifted collision operator separates into small coupled blocks whose norm exceeds unity because of the coupling between conserved and relaxing modes. This block structure enables a norm-attaining block encoding with a single-step success probability close to unity. Crucially, scaling the pair sector for a prescribed evolution horizon makes the combined encoding and sector-selection overhead grow polynomially rather than exponentially with the number of steps. For a hundred-step evolution, the resulting complete-run success probability exceeds that of population-space encodings by orders of magnitude. Over horizons of several tens of steps, the truncated dynamics reproduces the nonlinearly generated modes of a benchmark flow to within a few percent. We verify the combined preparation, evolution and readout protocol as a single unitary circuit and give a complete gate-level resource estimate for extracting a nonlinear observable of the benchmark flow from a coherent Carleman evolution. The block structure of conserved and relaxing modes holds equally on three-dimensional lattices and provides a constructive route to norm-attaining encodings for lattice Boltzmann models with quadratic equilibria.
The paper asks whether postselection makes coherent, multi-step Carleman lattice Boltzmann simulation exponentially costly, and how collision encoding affects observable-level resources. It studies a level-2 lift of quadratic-equilibrium lattice Boltzmann dynamics, using multi-relaxation-time collision in a weighted Hermite moment basis.
The collision separates into a diagonal part and three 2×22\times22×2 blocks coupling conserved-momentum products to relaxing moments. Halmos dilations attain its operator norm. For pair-sector scale λ\lambdaλ and fixed interior BGK rate ω\omegaω, the normalization is α=1+c/λ2+O(λ−4)\alpha=1+c/\lambda^2+O(\lambda^{-4})α=1+c/λ2+O(λ−4), with c=ω/[4(2−ω)]c=\omega/[4(2-\omega)]c=ω/[4(2−ω)]. Telescoping evolution and output-selection probabilities gives, after horizon-dependent optimization λ2∼2cT\lambda^2\sim2cTλ2∼2cT, near-rest success P∗∼e−1/(2cTN)P^*\sim e^{-1}/(2cTN)P∗∼e−1/(2cTN), versus T−2T^{-2}T−2 for a two-term LCU. Fixed-scale success remains exponential. Subtracting the rest state reduces the selection penalty. The block structure also extends to D3Q19 and D3Q27.
Algebraic derivations, numerical operator checks and small-lattice statevector simulations establish the encoding and preparation–evolution–readout identities. Classical validation on a two-mode flow at Mach number 0.0870.0870.087 reproduces generated acoustic and vortical peaks within 1.9%1.9\%1.9% and 2.6%2.6\%2.6%. A representative 32232^2322 acoustic task requires 188 logical qubits and approximately 2.5×10132.5\times10^{13}2.5×1013 T gates for 10%10\%10% statistical precision at 95% confidence.
No quantum advantage is demonstrated: a matched few-mode Fourier baseline costs 1.4×1071.4\times10^71.4×107 flops. Limitations include short, numerically established truncation windows, uncosted generic-data preparation, benchmark-calibrated estimation lengths, and resource counts excluding error correction and routing. Three-dimensional dynamics, boundaries and forcing are not validated.
The Carleman lattice Boltzmann method replaces the quadratic collision of the lattice Boltzmann equation by a linear map on a lifted state. Existing block encodings of this map succeed with probability 10−510^{-5}10−5 to 10−210^{-2}10−2 per step, so that the probability of a multi-step evolution decays exponentially with the number of steps. This study develops multi-relaxation-time Carleman lattice Boltzmann, a representation split in which the Carleman-lifted collision is performed in a moment basis on the amplitude-encoded state, while streaming remains a permutation in population space. The level-2 hierarchy closes under collision but not under streaming, which generates the work of pressure, advection and stress on the momentum flux. The state therefore remains the full pair array, and the moment representation is an orthogonal change of basis of the population one, with identical dynamics and truncation error. The operator to be block encoded changes with the basis, and with it the success probability of a quantum step. In the weighted Hermite basis with the amplitude encoding fi/wif_i/\sqrt{w_i}fi​/wi​​, the relaxation is a diagonal operator of norm one, and the level-2 collision stage becomes this diagonal plus a sparse coupling from products of conserved moments. A structured block encoding of this form raises the single-step success probability on the D2Q9 lattice from 10−210^{-2}10−2 for the best population encoding to 0.98. With the pair sector in relative coordinates and scaled, one step requires O(log⁡2N)O(\log^2 N)O(log2N) Toffoli gates and is verified by statevector simulation. The encoding and readout overhead of a TTT-step run is then polynomial in TTT and NNN rather than accumulating a factor pTp^TpT. For resolved flows, the remaining exponential loss in coherent multi-step Carleman lattice Boltzmann evolution is set by the non-equilibrium norm relaxed by dissipation rather than by the block encoding.
We apply Carleman linearization of the Lattice Boltzmann (CLB) representation of fluid flows to quantum emulate the dynamics of a two-dimensional Kolmogorov-like flow. We assess the accuracy of the result and find a relative error of the order of 10−3 with just two Carleman iterates for a range of the Reynolds number up to a few hundreds. We first define a gate-based quantum circuit for the implementation of the CLB method and then exploit the sparse nature of the CLB matrix to build a quantum circuit based on block-encoding techniques which makes use of matrix oracles. It is shown that the gate complexity of the algorithm is thereby dramatically reduced, from exponential to quadratic. However, due to the need of employing up to seven ancilla qubits, the probability of success of the corresponding circuit for a single time step is too low to enable multi-step time evolution. Several possible directions to circumvent this problem are briefly outlined.
We present a full quantum algorithm for the lattice Boltzmann method for simulating fluid flows, the only such algorithm to implement both the streaming and collision substeps as unitary operators using an efficient number of qubits. We use Hamiltonian simulation as the main route underlying the algorithm, and show that it uses qubits that scale logarithmically in the flow Reynolds number but gates that scale only polynomially. We motivate the discussion by a brief overview of existing attempts at simulating classical fluids on quantum computers and present a pedagogical discussion on assigning quantum operators to classical variables in both the streaming and the collision substeps, after highlighting the incompatibility of the latter with the implementations of the streaming step that exists in the literature. We use the Bhatnagar–Gross–Krook ansatz for the collision term, representing the relaxation toward an equilibrium distribution. For nonlinear collisions, we use Kowalski's framework that links the nonlinear dynamics of a system to the evolution of bosonic modes, assigning a Carleman linearization order to the truncation in the Fock space of the bosons. We present the qubit and gate complexities, in terms of the chosen accuracy and the Reynolds number. In the Appendix, we work out the details of implementing the operators of the truncated bosonic Fock space in terms of single-qubit gates as well as the error scaling for a general polynomial driving function.
Nonlinear ordinary and partial differential equations are ubiquitous in science and engineering, yet finding their solutions is often computationally intractable for classical hardware. To determine if quantum computers can offer a practical advantage, one critical challenge that must be solved is determining how to efficiently load exponentially sized matrices onto quantum hardware. In this article, we introduce an alternative linear combination of unitaries (LCU) strategy which relies on an intermediate linear combination of non-unitaries (LCNU) and a systematic embedding procedure. One advantage of this LCU strategy is that it maintains the exact number of terms as in the LCNU. Therefore, this approach offers a data loading framework for matrices that lack an efficient decomposition using the standard LCU alone. Using this approach, we construct a generalized LCNU framework for any Carleman linearized autonomous dynamical system having a polynomial nonlinearity. To demonstrate the effectiveness of our approach, we construct an LCNU for the 3D Carleman linearized lattice Boltzmann equation (LBE). Here, we find that the number of terms in the decomposition scales like Ns∼O(α2Q2)N_s\sim\mathcal{O}(α^2Q^2)Ns​∼O(α2Q2), where ααα is the Carleman truncation order and QQQ is the number of discrete velocities. Importantly, NsN_sNs​ is independent of the number of spatial and temporal discretization points. We then perform a resource estimation of our LCNU's T gate cost when combined with the (1) PREP and SELECT block encoding oracles, and (2) variational quantum linear solver. In the former, the T cost scales like O(α3Q2(log⁡2n)2)\mathcal{O}(α^3Q^2(\log_2n)^2)O(α3Q2(log2​n)2), where nnn is the total number of spatial grid points. The latter requires exactly Ns2(log⁡2(2ntnα)+1)N_s^2(\log_2 (2n_tn^α)+1)Ns2​(log2​(2nt​nα)+1) circuits per iteration for ntn_tnt​ time steps, with a worst case T gate cost of O(α(log⁡2Qn)2)\mathcal{O}(α(\log_2Qn)^2)O(α(log2​Qn)2) among them.
We present a quantum computing algorithm for fluid flows based on the Carleman-linearization of the Lattice Boltzmann (LB) method. First, we demonstrate the convergence of the classical Carleman procedure at moderate Reynolds numbers, namely, for Kolmogorov-like flows. Then we proceed to formulate the corresponding quantum algorithm, including the quantum circuit layout, and analyze its computational viability. We show that, at least for moderate Reynolds numbers between 10 and 100, the Carleman–LB procedure can be successfully truncated at second order, which is a very encouraging result. We also show that the quantum circuit implementing the single time-step collision operator has a fixed depth, regardless of the number of lattice sites. However, such depth is of the order of ten thousands quantum gates, meaning that quantum advantage over classical computing is not attainable today, but could be achieved in the near or mid-term future. The same goal for the multi-step version remains, however, an open topic for future research.
Carleman lifting converts nonlinear polynomial dynamics into finite linear systems, but the resulting truncations are generally nonunitary and need not correspond to physical quantum evolution. We prove that a finite linear endpoint admits an autonomous Gorini--Kossakowski--Sudarshan--Lindblad (GKSL) realization on vacuum coherences if and only if it is invertible and power bounded. The construction is explicit and realizes the nonunitary map directly as open-system dynamics, with no endpoint postselection and with one encoding and one decoding over repeated timesteps. We apply the result to the complete D2Q9 multiple-relaxation-time lattice Boltzmann (LB) timestep by compiling collision and periodic streaming into a single Carleman endpoint. The resulting GKSL evolution reproduces the classical Carleman trajectory over multiple timesteps, while the remaining discrepancy from nonlinear LB dynamics is the expected Carleman truncation error. The result establishes a general criterion for autonomous open-quantum realization of finite nonunitary dynamics, with Carleman--LB dynamics as a concrete example.