Pith. sign in

REVIEW 1 cited by

Quantum Carleman linearisation efficiency in nonlinear fluid dynamics

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.23057 v1 pith:2SK2RAW5 submitted 2024-10-30 quant-ph physics.flu-dyn

classification quant-phphysics.flu-dyn
keywords fluidnonlineardynamicsquantumcarlemandifferentialefficiencyequations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Solving the Nonlinear Vlasov Equation on a Quantum Computer

    quant-ph 2024-11 conditional novelty 6.0 of 10

    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...

Pith tools