Equilibrium-energy-scaled quantum lattice Boltzmann method for variable-velocity linear advection--diffusion equations
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Mathematical Physics. The day in mathematical physics: rigorous models of physical systems.
Kai: We're looking at the paper: "Equilibrium-energy-scaled quantum lattice Boltzmann method for variable-velocity linear advection--diffusion equations".
Mira: Here's the gist of the paper. A time-marching representation of the LBM is proposed for the first time, and two quantum algorithms based on this representation are developed to simulate advection-diffusion processes via the lattice Boltzmann paradigm Novel Formulation and Stability The paper introduces a novel framework for developing quantum algorithms for the Lattice Boltzmann Method (LBM) applied to the advection-diffusion equation <ref:2602.09799#pg4>.
Kai: This framework formulates the collision-streaming evolution of the LBM as a compact time-marching scheme and rigorously establishes its stability under low Mach number conditions <ref:2602.09799#pg6>.
Mira: This unified formulation eliminates the need for classical measurement at each time step, enabling a systematic and fully quantum implementation <ref:2602.09799#pg4>.
Kai: The authors establish weighted energy-norm bounds for the time-marching representation for spatially uniform and smooth nonuniform steady velocity fields under low-Mach-number conditions <ref:2602.09799#pg33>.
Title and authors: Kai: So, we've got this paper here, "Equilibrium-energy-scaled quantum lattice Boltzmann method for variable-velocity linear advection--diffusion equations." It seems like the authors are proposing a new way to do something pretty fundamental in quantum simulation of fluid flow.
Mira: Yeah, it sounds like they’re taking the Lattice Boltzmann Method, which is already a way to model things like how particles move through fluids, and they're putting a quantum algorithm on top of it. The title suggests this version handles variable velocity equations and scales with energy and time in a specific way.
Lev: From an engineering standpoint, what I want to know is how this fits into what we can actually build right now. Are we talking about something feasible for near-term hardware, or is this purely theoretical complexity?
Kai: Well, the paper proposes a time-marching representation of the Lattice Boltzmann Method for the first time. That means they're looking at the collision and streaming steps as a sequence over discrete time intervals, which lets them build quantum algorithms on top of it.
Mira: And this new framework is really interesting because it establishes stability under low Mach number conditions rigorously. That means they’ve done the heavy lifting to make sure their mathematical model holds up when the fluid movement isn't super fast compared to sound waves.
Lev: Stability is crucial, but what about the measurement problem? I always worry that any quantum simulation needs constant classical feedback, and this sounds like it tries to get rid of that.
Kai: Exactly. The unified formulation they introduce eliminates the need for classical measurement at each time step, which opens up a systematic and fully quantum implementation. They even establish weighted energy-norm bounds for this time-marching representation under low Mach number conditions.
Mira: That’s a big deal because it removes that classical overhead that usually slows down these kinds of simulations. It allows the whole process to stay in the quantum realm from start to finish, which is what we’re aiming for with quantum algorithms for fluid dynamics.
Lev: So, this isn't just a trick; it’s a structural change to how we think about simulating this kind of equation on a quantum computer. What are the specific computational methods they developed based on this new time-marching scheme?
Kai: They develop two distinct quantum algorithmic approaches based on this new time-marching representation. The first one is a time-marching algorithm that uses sequential evolution operators, and they even gave us a full complexity analysis for it.
Title and authors: Mira: And the second approach is different; it uses what they call a quantum linear systems algorithm, which encodes the entire evolution into one big linear system. They show that both these methods achieve comparable asymptotic time complexities.
Lev: Comparable is good, but what does that actually mean in terms of the actual resource cost? Is it polynomial scaling, or is there some hidden exponential blow-up somewhere we need to worry about?
Kai: The complexity analysis for the sequential evolution operator method involves block-encoding and dilating unitarization. They found a gate complexity of O of n times six, which is O(9n + six) for the resulting quantum linear systems algorithm.
Mira: And for the linear systems approach, they show that you can solve it by using amplitude amplification to repeat measurements, and the query complexity is given as O of alpha times B times n times T log of one over epsilon.
Lev: That query complexity looks manageable if the constant factors are small, but we have to remember those constants. How does this compare to running a classical simulation for a similar problem?
Kai: The numerical validation part shows that they tested this on one and two dimensional Gauss Hill problems. The results from both the classical and quantum Lattice Boltzmann Method are in excellent agreement with the analytical solutions, capturing the shape and evolution of the Gaussian distribution accurately.
Mira: That’s encouraging, because it means even though they are using a quantum approach, their method remains stable and accurate in regimes where one might expect trouble, specifically for tau star between one half and one.
Lev: So they're saying this isn't just a theoretical curiosity that works on paper; it’s validated against real benchmarks. What about the limitations? Where does this framework stop working?
Kai: The appendix provides some details on the bounds, which shows for a spatially uniform velocity field, the bound is equal to rho h which is one. For a spatially nonuniform but smooth velocity field, the bound is equal to e raised to L times delta t over two.
Mira: And if you have zero less than L times delta t less than one, then that bound simplifies further down to one plus L times delta t. It’s interesting how these bounds are derived for both uniform and nonuniform fields.
Lev: And what about the practical constraints on the velocity field itself? The paper mentions a condition for periodic streaming requiring a constant defined in section A point four to be chosen so that L is independent of the grid resolution when you fix the velocity field and low Mach number margin.
Title and authors: Kai: That constant choice is necessary to ensure that L doesn't depend on how fine your grid is when you're dealing with a fixed velocity field and staying within those low Mach number margins. It’s about making sure the discretization stays consistent.
Mira: So, we’ve seen the core idea: a time-marching representation that lets us skip the classical measurement steps, and two quantum ways to solve it—sequential operators or linear systems. The numerical results confirm they work for advection-diffusion in one and two dimensions with good agreement against known solutions.
Lev: For my hardware team, the main thing I see is that this framework provides a systematic pathway that avoids full-state measurement and reinitialization at every time step for the quantum simulation of advection--diffusion processes via the lattice Boltzmann paradigm. That systematic approach is what we need to make real hardware work without drowning in classical overhead.
Kai: And it’s not just one method; they show that both the sequential evolution operator method and the quantum linear systems algorithm achieve comparable asymptotic time complexities, which gives us a solid foundation for choosing which route to pursue.
Mira: It seems like they’ve provided a unified framework that handles uniform and smooth nonuniform velocity fields under low Mach number conditions, providing those energy-norm bounds we talked about earlier.
Lev: So the big picture here is that we have a systematic pathway for quantum simulation of advection--diffusion processes via the lattice Boltzmann paradigm, and it avoids full-state measurement and reinitialization at every time step for the quantum simulation of advection--diffusion processes via the lattice Boltzmann paradigm. That's a concrete way forward for what we can hope to achieve.
Kai: It’s definitely a systematic pathway that avoids those classical hurdles, which is exactly what we need when building up these kinds of complex quantum simulations. We should keep an eye on how this framework plays out as we try to implement it.
Mira: Agreed, and the fact that both algorithmic approaches yield similar scaling suggests there isn't a huge hidden complexity gap between the sequential operator method and the linear systems approach in this context.
Lev: I’ll be looking at those complexity analyses closely to see how they translate into actual circuit depth and qubit count on real hardware. That’s where the real test will be, not just the asymptotic scaling.
Kai: Right, so this paper gives us a solid theoretical structure and two paths forward for simulating advection-diffusion equations using LBM on a quantum computer. We're looking forward to seeing what comes next in this area.
The paper's summary: Kai: So, this paper basically says they've got a new way to handle simulating things like how stuff moves through fluids using the Lattice Boltzmann Method on a quantum computer.
Mira: Exactly, they propose this time-marching structure for the method for the first time. It’s not just running it once; it’s treating the collision and streaming steps as a sequence over time intervals.
Lev: What that means in practice is they're trying to avoid having to measure everything at every single tiny step, which is usually a major bottleneck in quantum simulation.
Kai: Right, they call this unified formulation because it establishes stability under low Mach number conditions for both steady and slightly changing velocity fields.
Mira: That’s important because those low Mach number conditions are where we expect the physics to behave nicely enough for these kinds of simulations to work without getting totally chaotic.
Lev: But what does that stability look like when you actually try to run it? Does it just mean the simulation doesn't crash, or are we talking about actual fidelity?
Kai: They establish weighted energy norm bounds for this time-marching representation under those low Mach number conditions. It gives them a way to track how well the simulation is behaving mathematically.
Mira: And they show that this approach works for both uniform velocity fields and smoother ones where the velocity is changing, which is a significant step up from just testing it on simple cases.
Lev: I mean, if you're building hardware, you need to know if these bounds translate into something practical for your qubit count and gate depth. Does that framework simplify the error terms enough?
Kai: Well, they do provide complexity analyses for two different quantum ways to solve this problem. One is using sequential evolution operators with block encoding, and the other is using a quantum linear systems algorithm.
Mira: And the interesting part there is that both of those approaches turn out to have comparable asymptotic time complexities when solving these advection-diffusion problems.
Lev: Comparable scaling is good, but I still need to see how that translates to actual running time on real hardware, considering the specific overhead of those block encodings and unitarizations they mentioned.
Kai: Yeah, the sequential operator method has a gate complexity of O of n times six for the resulting linear systems algorithm. It’s a concrete number for how much work that part does.
Mira: And the quantum linear systems approach uses an amplitude amplification technique to solve it, and their query complexity scales with alpha times B times n times T log of one over epsilon.
Lev: That query complexity is what I'll be looking at closely because that's what determines the number of measurements we need to perform. It sounds like they’ve mapped out two paths forward for tackling this problem systematically.
Kai: So, it seems like this paper gives us a systematic pathway that avoids full-state measurement and reinitialization at every time step for the quantum simulation of advection-diffusion processes via the lattice Boltzmann paradigm.
Mira: It provides a unified framework that handles uniform and smooth nonuniform velocity fields under low Mach number conditions, giving those energy norm bounds we discussed earlier.
Lev: So, it’s a solid theoretical structure and two distinct algorithmic paths to simulate these complex transport phenomena in one and two dimensions accurately. Where do we go from here with the practical implementation side?
The paper's improvements: Kai: So, we're looking at how this paper suggests ways to make their method even better, after they showed the initial framework for simulating advection-diffusion using the Lattice Boltzmann Method on a quantum computer.
Mira: They focus on refining that time-marching representation and the two quantum algorithms they developed. It’s not just about getting it to work; it’s about making sure those underlying mathematical assumptions hold up under more realistic conditions.
Lev: What kind of improvements are they suggesting? I mean, what specific changes to the math or the implementation are they proposing right now?
Kai: They're pushing for more detailed derivations of those energy norm bounds mentioned in the appendix, especially how those bounds behave for spatially nonuniform fields. It’s about tightening up those mathematical guarantees.
Mira: That’s crucial because if we can get a tighter bound, it means the simulation is more reliable when dealing with fluids that aren't perfectly smooth, which is what most real-world problems are.
Lev: If the bounds get tighter, does that mean the required gate complexity drops significantly? Because on real hardware, reducing gate count is where we really see gains.
Kai: They are showing how a specific condition on the constant in section A point four affects those bounds for a spatially nonuniform velocity field. It’s about finding a way to keep things stable even when the grid resolution isn't perfectly fixed.
Mira: That suggests they are looking at how to make the simulation robust against discretization errors, which is always a big hurdle in numerical methods.
Lev: For my side, if they can reduce those error terms by making that constant choice smarter, it means less overhead for our error correction circuits when we try to map this onto actual physical qubits.
Kai: And they’re also looking at how the two quantum algorithms compare under these improved stability conditions. They want to show that the performance gap between the sequential operator method and the linear systems algorithm shrinks further.
Mira: So, they're not just presenting a working proof of concept; they are refining it into a more rigorous mathematical tool for quantum simulation of fluid dynamics.
Lev: It sounds like they’re moving from showing it *can* work to showing exactly how robust and scalable it is under more realistic modeling constraints.
Kai: This paper is essentially setting the stage for what comes next: a fully validated, stable framework for using LBM on quantum hardware to solve these types of transport equations.
Conclusion: Tom: So, to wrap things up, this paper on the "Equilibrium-energy-scaled quantum lattice Boltzmann method for variable-velocity linear advection--diffusion equations" shows a systematic path for simulating these processes on quantum computers.
Kai: Right, it gives us two concrete algorithms and a stable time-marching representation that avoids those painful classical measurements at every step.
Mira: And the results validate that this approach remains accurate for one and two dimensional problems, even under low Mach number conditions where things can get tricky.
Lev: From my point of view, the main thing is seeing two distinct approaches—the sequential operators and the linear systems algorithm—achieve comparable scaling in terms of their required resources.
Kai: That’s right, both methods show similar asymptotic time complexities when solving these dynamics. It gives us a choice on how to actually build the quantum circuit for this simulation.
Mira: This means we can move forward with more confidence that we have a viable route toward simulating advection-diffusion using the lattice Boltzmann paradigm on quantum hardware.
Lev: I’m still looking at how those numbers translate into actual gate counts and qubit requirements for real machines, but having this theoretical structure is a good start for planning our error correction overhead.
Kai: Exactly, it’s a solid foundation that avoids the classical hurdles we usually have to deal with when trying to build these kinds of simulations.
Mira: This work really proves that we can handle variable velocity fields in a way that respects the physics and keeps the simulation stable without needing continuous classical intervention.
Lev: So, we’ve got a systematic pathway for quantum simulation of advection-diffusion processes via the lattice Boltzmann paradigm established in this paper.
Kai: Yeah, it gives us a concrete way forward that avoids full-state measurement and reinitialization at every time step for these kinds of problems.
Mira: It's important to remember that this framework handles uniform and smooth nonuniform velocity fields under low Mach number conditions effectively.
Lev: I just need to see how those stability bounds translate into actual running times on hardware before we can fully commit our resources to implementing it.
School of Mathematics and Computational Science, Xiangtan University · Hunan Research Center of the Basic Discipline Fundamental Algorithmic Theory and Novel Computational Methods · National Center for Applied Mathematics in Hunan
math-ph, math.MP
Submitted: 2026-02-10
Updated: 2026-11-03
Comments: 25 pages, 8 figures. Substantially revised: equilibrium energy scaling, coherent multistep construction, and expanded numerical and circuit verification; title and author list updated
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 91/100
The gist: A time-marching representation of the LBM is proposed for the first time, and two quantum algorithms based on this representation are developed to simulate advection-diffusion processes via the…
Key concepts
- Time-Marching Representation
- This is a new way to structure the LBM evolution as a compact time-marching scheme. Instead of evolving step-by-step with classical measurements, this formulation treats the entire process in a structured way, which is essential for building efficient quantum algorithms.
- Sequential Evolution Operators
- This quantum approach simulates time by sequentially applying evolution operators for each small time step. It requires careful implementation techniques like block-encoding and dilating unitarization to manage the complexity of these sequential operations in a quantum computer.
- Quantum Linear Systems Algorithm (QLSA)
- This method transforms the entire time evolution into solving one large linear system (LΨ = F). By using QLSA, the simulation can be solved efficiently, achieving comparable asymptotic performance to the sequential operator method.
Terminology
Summary
A time-marching representation of the LBM is proposed for the first time, and two quantum algorithms based on this representation are developed to simulate advection-diffusion processes via the lattice Boltzmann paradigm
Novel Formulation and Stability
The paper introduces a novel framework for developing quantum algorithms for the Lattice Boltzmann Method (LBM) applied to the advection-diffusion equation <ref:2602.09799#pg4>. This framework formulates the collision-streaming evolution of the LBM as a compact time-marching scheme and rigorously establishes its stability under low Mach number conditions <ref:2602. p. 2 p. 209799#pg6>. This unified formulation eliminates the need for classical measurement at each time step, enabling a systematic and fully quantum implementation <ref:2602. p. 2 p. 209799#pg4>. The authors establish weighted energy-norm bounds for the time-marching representation for spatially uniform and smooth nonuniform steady velocity fields under low-Mach-number conditions <ref:2602. p. 4 p. 409799#pg33>.
Quantum Algorithmic Approaches
The paper investigates two distinct quantum algorithmic approaches built upon the time-marching representation <ref:2602.09799#pg5>. The first is a time-marching quantum algorithm realized through sequential evolution operators, which includes a detailed implementation with block-encoding and dilating unitarization along with a full complexity analysis <ref:2602. p. 2 p. 209799#pg6>. The second approach employs a quantum linear systems algorithm (QLSA), which encodes the entire time evolution into a single global linear system <ref:2602. p. 2 p. 209799#pg6>. Both methods are shown to achieve comparable asymptotic time complexities <ref:2602. p. 209799#pg6>.
Time-Marching Quantum Algorithm Details
The time-marching structure of the scheme in (3.7) provides a natural foundation for a time-marching quantum algorithm <ref:2602. p. 009799#pg5>. This approach requires the sequential application of evolution operators, implementing the product ΞNt · · · Ξ2Ξ1, where each Ξj corresponds to the j-th time step <ref:2602. p. 409799#pg5>. The authors employ techniques from [12, 13] to implement this algorithm <ref:2602. p. 009799#pg6>. The implementation involves block-encoding of the time-marching matrix Bb in (3. p. 28) with a gate complexity of O(9n + 6) for the resulting quantum linear systems algorithm <ref:2602. p. 209799#pg6>.
Quantum Linear Systems Algorithm
The second approach transforms the time-marching representation into a large linear system and solves it by employing a quantum linear systems algorithm <ref:2602.09799#pg6>. The system is formulated as LΨ = F, where L is the matrix involving I and B0, and F contains the initial state <ref:2602.09799#pg6>. The query complexity of the QLSA for solving this system is given by O(αBbNtΓT log 1/ε) <ref:2602. p. 409799#pg6>. This complexity is achieved by using amplitude amplification to repeat measurements, resulting in a total number of queries that scales as O(ΓT ψ(t0) ψ(T)) <ref:2602.09799#pg6>.
Numerical Validation
Numerical simulations for the one-dimensional (1D) and two-dimensional (2D) Gauss Hill problems validate the effectiveness of the proposed algorithm <ref:2602.09799#pg7>. The results obtained from both the classical and quantum LBM are in excellent agreement and accurately capture the overall shape and evolution of the Gaussian distribution predicted by analytical solutions <ref:2602. p. 209799#pg7>. These results demonstrate that the method remains stable and accurate in regimes where 1/2 ≤ τ∗ ≤ 1, even though theoretical analysis established validity for τ∗ > 1 <ref:2602. p. 0 p. 209799#pg7>.
Appendix Bounds
The appendix provides detailed derivations of the two bounds stated in Remark following Theorem 3.1 <ref:2602.09799#pg35>. For a spatially uniform velocity field, the bound reduces to Bb2 ≤ ρh = 1 <ref:2602. p. 409799#pg33>. For a spatially nonuniform but smooth velocity field, the bound is Bb2 ≤ e(L∆t/2) <ref:2602. p. 409799#pg35>. If 0 ≤ L∆t ≤ 1, then Bb2 ≤ 1 + L∆t <ref:2602. p. 009799#pg35>. The condition for periodic streaming requires a constant defined in (A. p. 84) to be chosen such that L is independent of the grid resolution when the velocity field and the strict low-Mach number margin are fixed <ref:2602. p. 909799#pg33>.
Acknowledgements
Yuan Yu was supported by the National Natural Science Foundation of China (No. 12101527) and the Natural Science Foundation of Hunan Province (No. p. 1 2026JJ60005) <ref:2602. p. 009799#pg32>. Yue Yu was supported by NSFC grant (No. p. 1 12301561), the Key Project of Scientific Research Project of Hunan Provincial Department of Education (No. p. 1 24A0100), the Science and Technology Innovation Program of Hunan Province (No. p. 1 2025RC3150), the general program of Hunan Provincial Natural Science Foundation (No. p. 1 2026JJ50003), and partially supported by NSFC grant No. 12341104 <ref:2602. p. 009799#pg32>. Computational resources were provided by the High Performance Computing Platform of Xiangtan University <ref:2602. p. 109799#pg32>.
References
The paper cites numerous foundational works related to quantum algorithms for fluid dynamics, including [4] Todorova and Steijl's work on the collisionless Boltzmann equation <ref:2602.09799#pg35>, and [7] Wawrzyniak et al. p. 3's development of fully unitary collision operators. Other relevant references include [12] Dong et al. on a time-marching quantum algorithm for timedependent linear differential equations <ref:2602. p. 009799#pg32> and [22] Costa et al. on optimal scaling quantum linear-systems solver via discrete adiabatic theorem. p. 2 The paper also references works concerning block-encoding of sparse-access matrices [14] Gilyén et al. p. 2 on quantum singular value transformation and beyond <ref:2602. p. 309799#pg35>, and Hamiltonian simulation in the interaction picture [21] Low et al. p. 2 on Hamiltonian simulation in the interaction picture. p. 2 The references listed at the end of the paper provide further context for these developments. p. 3
Conclusion
This work provides a systematic pathway that avoids full-state measurement and reinitialization at every time step for the quantum simulation of advection-diffusion processes via the lattice Boltzmann paradigm <ref:2602.09799#pg4>. The unified formulation successfully establishes stability under low Mach number conditions for both uniform and smooth nonuniform velocity fields <ref:2602. p. 409799#pg33>. The paper concludes that both sequential evolution operator methods and the quantum linear systems algorithm achieve comparable asymptotic time complexities <ref:2602. p. 209799#pg6>. This research offers a systematic pathway for quantum simulation of advection-diffusion processes via the lattice Boltzmann paradigm <ref:2602. p. 209799#pg32>.
Summary
A time-marching representation of the LBM is proposed for the first time, and two quantum algorithms based on this representation are developed to simulate advection-diffusion processes via the lattice Boltzmann paradigm <ref:2602.09799#pg4>.
Pruning redundant reasoning tokens
The paper introduces a novel framework for developing quantum algorithms for the Lattice Boltzmann Method (LBM) applied to the advection-diffusion equation <ref:2602.09799#pg4>. This framework formulates the collision-streaming evolution of the LBM as a compact time-marching scheme and rigorously establishes its stability under low Mach number conditions <ref:2602.09799#pg6>. This unified formulation eliminates the need for classical measurement at each time step, enabling a systematic and fully quantum implementation <ref:2602.09799#pg4>. The authors establish weighted energy-norm bounds for the time-marching representation for spatially uniform and smooth nonuniform steady velocity fields under low-Mach-number conditions <ref:2602.09799#pg33>.
How the training signal is built
The paper investigates two distinct quantum algorithmic approaches based on this representation <ref:2602.09799#pg5>. The first is a time-marching quantum algorithm realized through sequential evolution operators, which includes a detailed implementation with block-encoding and dilating unitarization along with a full complexity analysis <ref:2602.09799#pg6>. The second approach employs a quantum linear systems algorithm (QLSA), which encodes the entire time evolution into a single global linear system <ref:2602.09799#pg6>.
Where the gains come from
The gains in efficiency stem from avoiding full-state measurement and reinitialization at every time step for quantum simulation of advection-diffusion processes via the lattice Boltzmann paradigm <ref:2602.09799#pg4>. The complexity analysis shows that both methods achieve comparable asymptotic time complexities <ref:2602. p. 209799#pg6>. The uniform singular value amplification technique is employed to mitigate the exponential overhead associated with success probability in the dilating unitarization method <ref:2602.09799#pg25>. The quantum linear systems algorithm's query complexity is O(αBbNtΓT log 1/ε) <ref:2602.09799#pg6>.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Time-marching representation for Lattice Boltzmann Method (LBM) simulation allows for a
systematic and fully quantum implementation
by eliminatingfull-state measurement at every time step.
This enables quantum simulations of advection-diffusion processes without the classical overhead of measurement and reinitialization at each step. -
Development of two distinct quantum algorithmic approaches, a time-marching algorithm and a quantum linear systems algorithm, allows for comparable asymptotic time complexities in solving the LBM dynamics. This provides a systematic pathway that avoids
full-state measurement and reinitialization at every time step for the quantum simulation of advection-diffusion processes via the lattice Boltzmann paradigm.
-
The time-marching quantum algorithm, realized through sequential evolution operators, enables continuous multi-time-step evolution without intermediate full-state measurement or reinitialization. This is achieved through
dilating unitarization,
which manages the overhead associated with applying sequential evolution operators. -
A quantum linear systems algorithm (QLSA) approach encodes the entire time evolution into a single global linear system, solving it using state-of-the-art QLSA techniques to achieve comparable asymptotic time complexities with the time-marching method.
-
The proposed algorithms can simulate complex transport phenomena like those governed by the advection-diffusion equation accurately in one and two dimensions, validating their effectiveness through numerical simulations against analytical solutions.
Sources
- Unitary Quantum Algorithm for the Lattice-Boltzmann Method
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Lecture Notes on Quantum Algorithms for Scientific Computation
- Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters
- Quantum differential equation solvers: limitations and fast-forwarding
- Hamiltonian Simulation in the Interaction Picture
Related papers
- Existence of a fluid phase for the two-dimensional one-component plasma
- The Huang-Yang conjecture for the low-density Fermi gas
- Anderson localisation in infinite and finite resonator crystals with long-range interactions
- Free energy and spectral edge of the SYK model
- Anderson localization for 1-d quasi-periodic Schr"odinger operators with degenerate weights
- Irregular SLE(4) martingales and isomonodromic deformations