Pith. sign in

Quantum Carleman linearisation efficiency in nonlinear fluid dynamics

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Computational fluid dynamics (CFD) is a specialised branch of fluid mechanics that utilises numerical methods and algorithms to solve and analyze fluid-flow problems. One promising avenue to enhance CFD is the use of quantum computing, which has the potential to resolve nonlinear differential equations more efficiently than classical computers. Here, we try to answer the question of which regimes of nonlinear partial differential equations (PDEs) for fluid dynamics can have an efficient quantum algorithm. We propose a connection between the numerical parameter, $R$, that guarantees efficiency in the truncation of the Carleman linearisation, and the physical parameters that describe the fluid flow. This link can be made thanks to the Kolmogorov scale, which determines the minimum size of the grid needed to properly resolve the energy cascade induced by the nonlinear term. Additionally, we introduce the formalism for vector field simulation in different spatial dimensions, providing the discretisation of the operators and the boundary conditions.

citation-role summary

background 1

citation-polarity summary

fields

quant-ph 1

years

2024 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Solving the Nonlinear Vlasov Equation on a Quantum Computer

quant-ph · 2024-11-28 · conditional · novelty 6.0

For a 1+1 dimensional Vlasov model with Krook collisions, a Carleman linearization quantum algorithm has polynomially worse complexity than classical finite difference methods and requires unphysically large collision rates to provably converge.

citing papers explorer

Showing 1 of 1 citing paper.

  • Solving the Nonlinear Vlasov Equation on a Quantum Computer quant-ph · 2024-11-28 · conditional · none · ref 23 · internal anchor

    For a 1+1 dimensional Vlasov model with Krook collisions, a Carleman linearization quantum algorithm has polynomially worse complexity than classical finite difference methods and requires unphysically large collision rates to provably converge.