pith. sign in

arxiv: 2606.13457 · v1 · pith:B4ILICDMnew · submitted 2026-06-11 · 🧮 math.NA · cs.NA· quant-ph

Reduced basis algorithm for solving nonlinear differential equations on quantum computers

Monica L\u{a}c\u{a}tu\c{s} , Matthias M\"oller , Sauro Succi This is my paper

Pith reviewed 2026-06-27 05:47 UTC · model grok-4.3

classification 🧮 math.NA cs.NAquant-ph
keywords reduced basis algorithmnonlinear differential equationsquantum computerspolynomial ODEPDE discretizationmonomial basistime discretization
0
0 comments X

The pith

A reduced basis algorithm reproduces the exact discrete nonlinear dynamics of polynomial ODEs and PDEs on quantum computers.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a reduced basis algorithm for polynomial nonlinear ordinary and partial differential equations on quantum computers. After time discretization, the method composes the polynomial update over m timesteps, identifies the reduced monomial basis for this composition, and constructs a linear operator that exactly recovers the m-step dynamics. This ensures no additional approximation error is introduced beyond the time discretization itself. The approach requires a number of qubits that scales as O(n m log p) for n-dimensional ODEs of degree p and remains logarithmic in the grid size for PDEs via locality. The main work of building the basis and operator occurs classically in preprocessing.

Core claim

After time discretization the resulting polynomial update map is composed over m timesteps; the reduced monomial basis appearing in this composed map is identified and a linear RBA operator is constructed whose action recovers the exact m-timestep nonlinear dynamics. Thus at the level of the chosen discrete update rule the method introduces no additional approximation error beyond the time discretization error. The qubit number requirement is governed by the size of the reduced monomial basis, yielding at most O(n m log p) qubits for ODEs and O(D log N + n m^{D+1} log p) for PDEs with locality.

What carries the argument

reduced monomial basis of the m-step composed polynomial update map, which exactly spans the nonlinear dynamics and permits a linear operator representation

If this is right

  • The RBA reproduces the corresponding discrete time nonlinear dynamics exactly.
  • The qubit requirement depends on the reduced monomial basis size rather than the full state space.
  • For PDEs the grid size dependence remains logarithmic while nonlinear overhead is controlled by local reduced basis size.
  • The computational burden of handling nonlinearity is moved to classical preprocessing.
  • Numerical tests confirm exact reproduction for the Lorenz system and Burgers equation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the classical preprocessing cost stays manageable, the method could enable quantum simulation of nonlinear systems where direct linearization is not feasible.
  • The exact discrete-level reproduction suggests testing whether accumulated errors over many windows remain controlled in long-time integrations.
  • Similar reduced-basis lifting might apply to other quantum linear system solvers for time-dependent problems.
  • The polynomial assumption limits direct use to systems where the discrete map is polynomial; non-polynomial cases would need additional approximation.

Load-bearing premise

The nonlinear update map after time discretization must be polynomial so its m-step composition can be exactly spanned by a reduced monomial basis of size bounded by the stated expressions.

What would settle it

Applying the constructed RBA operator to an initial state and comparing the result after one window to the result of iterating the original discrete polynomial map the same number of steps; any mismatch indicates the claim of exact reproduction does not hold.

Figures

Figures reproduced from arXiv: 2606.13457 by Matthias M\"oller, Monica L\u{a}c\u{a}tu\c{s}, Sauro Succi.

Figure 1
Figure 1. Figure 1: FIG. 1. Numerical verification of the RBA representation for the [PITH_FULL_IMAGE:figures/full_fig_p011_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Block-encoding post-selection success probability for the [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Numerical verification of the local RBA construction for the [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗
read the original abstract

As quantum computing moves toward scientific computing applications, nonlinear differential equations remain a central challenge since quantum evolution is intrinsically linear. In this work, we introduce a reduced basis algorithm (RBA) for polynomial nonlinear ordinary differential equations (ODEs) and spatially discretized partial differential equations (PDEs). After time discretization, the method composes the resulting polynomial update map over $m$ timesteps, identifies the reduced monomial basis appearing in this composed map, and constructs a linear RBA operator whose action recovers the exact $m$-timestep nonlinear dynamics. Thus, at the level of the chosen discrete update rule, the method introduces no additional approximation error beyond the time discretization error. The qubit number requirement is governed by the size of the reduced monomial basis. For an $n$-dimensional polynomial ODE system of degree $p>1$, the lifted register requires at most $q_m^{\mathrm{ODE}} = O(nm\log p)$ qubits in the full basis scenario. For PDEs discretized on $N^D$ grid points, a locality-based construction requires at most $q_m^{\mathrm{PDE}} = O(D\log N + n m^{D+1}\log p)$ qubits. Hence, the dependence on the grid size remains logarithmic, while the nonlinear overhead is controlled by local reduced basis size. The main computational burden is moved from the quantum computer to a classical preprocessing step, where the reduced monomial basis and RBA operator are constructed for the chosen timestep window. Through numerical tests on the Lorenz system and the one-dimensional Burgers equation, we verify that the RBA reproduces the corresponding discrete time nonlinear dynamics exactly, while exposing the trade-off between timestep composition, reduced basis growth, and locality.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The paper claims to introduce a reduced basis algorithm (RBA) for polynomial nonlinear ODEs and PDEs on quantum computers. After time discretization, the m-step composed polynomial update map is exactly spanned by a reduced monomial basis; a linear RBA operator is constructed on this basis to recover the exact m-step nonlinear dynamics with no additional approximation error. Qubit counts are bounded by O(nm log p) for n-dimensional ODEs of degree p and O(D log N + n m^{D+1} log p) for PDEs on N^D grids. The computational burden is shifted to classical preprocessing for basis identification and operator construction. Numerical tests on the Lorenz system and 1D Burgers equation confirm exact reproduction of the discrete dynamics.

Significance. If the reduced monomial basis and RBA operator can be constructed efficiently in classical preprocessing, the approach would allow quantum simulation of nonlinear dynamics with only logarithmic dependence on spatial grid size and no extra discretization error beyond the chosen time-stepping rule, offering a concrete route to applying quantum computers to scientific computing tasks involving nonlinearity.

major comments (1)
  1. [Abstract] Abstract: the qubit bounds O(nm log p) and O(D log N + n m^{D+1} log p) are presented as governing the lifted register size, but these are upper bounds on the final reduced basis dimension; the manuscript provides no explicit algorithm or complexity proof showing that the reduced monomial basis support and the corresponding linear operator matrix can be identified and populated in time polynomial in the input parameters, as symbolic composition of the m-step map can generate an exponentially large intermediate term count before reduction.
minor comments (1)
  1. [Abstract] The abstract refers to a 'locality-based construction' for the PDE qubit bound; a brief description of how locality is used to control the reduced basis size would aid readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and for highlighting an important clarification needed regarding the classical preprocessing step. We address the major comment below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the qubit bounds O(nm log p) and O(D log N + n m^{D+1} log p) are presented as governing the lifted register size, but these are upper bounds on the final reduced basis dimension; the manuscript provides no explicit algorithm or complexity proof showing that the reduced monomial basis support and the corresponding linear operator matrix can be identified and populated in time polynomial in the input parameters, as symbolic composition of the m-step map can generate an exponentially large intermediate term count before reduction.

    Authors: The referee is correct that the stated qubit bounds are upper bounds on the dimension of the final reduced monomial basis after support identification. The manuscript does not include an explicit general algorithm or a complexity proof establishing that this identification (and the subsequent population of the linear operator matrix) can be performed in time polynomial in the input parameters n, m, p, D, N. As noted, naive symbolic composition of the m-step polynomial map can produce an exponentially large number of intermediate terms prior to reduction. The paper's emphasis is on the exact equivalence between the nonlinear m-step map and the linear RBA operator once the reduced basis is available, together with the resulting qubit scaling; the classical preprocessing cost is acknowledged as the dominant burden but is not analyzed in detail. For the concrete numerical examples (Lorenz system and 1D Burgers equation), the reduced bases are obtained by direct evaluation on a modest number of points or by limited symbolic expansion, which remains tractable. We will revise the abstract to make explicit that the qubit counts assume the reduced basis has already been identified, and we will add a dedicated paragraph in the methods section discussing the preprocessing complexity, its dependence on system structure and choice of m, and the fact that general polynomial-time guarantees are not provided. revision: yes

Circularity Check

0 steps flagged

No circularity; exact reproduction is by explicit classical construction of basis and operator

full rationale

The paper's central claim is that after identifying the monomial terms appearing in the composed m-step polynomial map, the linear RBA operator is defined so that its action on the reduced basis exactly reproduces the nonlinear update. This exactness is a direct consequence of the construction itself (the operator is built to match the map on the spanning set), not a derived prediction or self-referential fit. No self-citations are invoked for uniqueness or ansatz; the qubit bounds are stated as upper bounds on basis size rather than fitted quantities; and the method contains no parameter estimation or renaming of external results. The derivation is therefore self-contained as an algorithmic reduction whose correctness follows from linear algebra on the explicitly constructed space.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claim rests on the differential equations being polynomial (so monomials close under composition) and on the existence of a compact reduced monomial basis whose size matches the stated asymptotic bounds; these are domain assumptions rather than derived results.

axioms (1)
  • domain assumption The governing equations are polynomial of finite degree p after spatial discretization.
    The method requires the update map to be polynomial so that the m-step composition remains a finite polynomial whose monomials can be enumerated and reduced.
invented entities (1)
  • Reduced monomial basis for the m-step composed map no independent evidence
    purpose: Spans exactly the image of the nonlinear composition while using far fewer terms than the full monomial space
    New entity introduced to enable the linear quantum operator; no independent evidence outside the construction itself is provided.

pith-pipeline@v0.9.1-grok · 5859 in / 1547 out tokens · 28756 ms · 2026-06-27T05:47:59.971667+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

44 extracted references · 20 canonical work pages · 1 internal anchor

  1. [1]

    arXiv preprint arXiv:0812.4423 , year =

    A quantum algorithm to solve nonlinear differential equations , author =. arXiv preprint arXiv:0812.4423 , year =. 0812.4423 , archivePrefix =

    Pith/arXiv arXiv

  2. [2]

    arXiv preprint arXiv:2011.06571 , year =

    Quantum algorithm for nonlinear differential equations , author =. arXiv preprint arXiv:2011.06571 , year =. 2011.06571 , archivePrefix =

    arXiv 2011

  3. [3]

    Bulletin of the American Meteorological Society , volume =

    Quantum Computers for Weather and Climate Prediction: The Good, the Bad, and the Noisy , author =. Bulletin of the American Meteorological Society , volume =. 2023 , doi =

    2023

  4. [4]

    Physical Review Research , volume =

    Tensor-programmable quantum circuits for solving differential equations , author =. Physical Review Research , volume =. 2026 , publisher =

    2026

  5. [5]

    Acta Mathematica , volume =

    Carleman, Torsten , title =. Acta Mathematica , volume =. 1932 , doi =

    1932

  6. [6]

    Proceedings of the National Academy of Sciences , volume =

    Efficient quantum algorithm for dissipative nonlinear differential equations , author =. Proceedings of the National Academy of Sciences , volume =. 2021 , doi =

    2021

  7. [7]

    Quantum , volume =

    Improved quantum algorithms for linear and nonlinear differential equations , author =. Quantum , volume =. 2023 , month = feb, doi =

    2023

  8. [8]

    npj Quantum Information , volume =

    Further improving quantum algorithms for nonlinear differential equations via higher-order methods and rescaling , author =. npj Quantum Information , volume =. 2025 , doi =

    2025

  9. [9]

    Globalizing the

    Novikau, Ivan and Joseph, Ilon , journal =. Globalizing the. 2025 , eprint =

    2025

  10. [11]

    AVS Quantum Science , volume =

    Sanavio, Claudio and Succi, Sauro , title =. AVS Quantum Science , volume =. 2024 , doi =

    2024

  11. [12]

    Communications in Mathematical Physics , volume =

    Liu, Jin-Peng and An, Dong and Fang, Di and Wang, Jiasu and Low, Guang Hao and Jordan, Stephen , title =. Communications in Mathematical Physics , volume =. 2023 , doi =

    2023

  12. [13]

    Quantum , volume =

    An, Dong and Trivisa, Konstantina , title =. Quantum , volume =. 2026 , month = jan, doi =

    2026

  13. [14]

    SIAM Journal on Scientific Computing , volume =

    Wu, Hsuan-Cheng and Wang, Jingyao and Li, Xiantao , title =. SIAM Journal on Scientific Computing , volume =. 2025 , doi =

    2025

  14. [15]

    Solving nonlinear differential equations on Quantum Computers: A

    Tennie, Felix and Magri, Luca , journal =. Solving nonlinear differential equations on Quantum Computers: A. 2024 , eprint =

    2024

  15. [16]

    Physical Review A , volume =

    Solving nonlinear differential equations with differentiable quantum circuits , author =. Physical Review A , volume =. 2021 , doi =

    2021

  16. [17]

    Physical Review A , volume =

    Variational quantum algorithms for nonlinear problems , author =. Physical Review A , volume =. 2020 , doi =

    2020

  17. [18]

    Efficient quantum algorithm for solving differential equations with

    Katz, Judd and Muraleedharan, Gopikrishnan and Alase, Abhijeet , journal =. Efficient quantum algorithm for solving differential equations with. 2025 , eprint =

    2025

  18. [19]

    New Journal of Physics , volume =

    Quantum homotopy perturbation method for nonlinear dissipative ordinary differential equations , author =. New Journal of Physics , volume =. 2021 , month = dec, doi =

    2021

  19. [20]

    Physical Review A , volume =

    Quantum algorithm for solving a quadratic nonlinear system of equations , author =. Physical Review A , volume =. 2022 , doi =

    2022

  20. [21]

    Reducing

    Li, Zexian and Zhang, Guofeng and Zhang, Xiao-Ming , journal =. Reducing. 2026 , eprint =

    2026

  21. [22]

    author author S. K. \ Leyton \ and\ author T. J. \ Osborne ,\ title title A quantum algorithm to solve nonlinear differential equations , \ 10.48550/arXiv.0812.4423 journal journal arXiv preprint arXiv:0812.4423 \ ( year 2008 ),\ 10.48550/arXiv.0812.4423 ,\ http://arxiv.org/abs/0812.4423 arXiv:0812.4423 [quant-ph] NoStop

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.0812.4423 2008

  22. [23]

    Lloyd , author G

    author author S. Lloyd , author G. De Palma , author C. Gokler , author B. Kiani , author Z.-W. \ Liu , author M. Marvian , author F. Tennie , \ and\ author T. Palmer ,\ title title Quantum algorithm for nonlinear differential equations , \ 10.48550/arXiv.2011.06571 journal journal arXiv preprint arXiv:2011.06571 \ ( year 2020 ),\ 10.48550/arXiv.2011.0657...

    work page doi:10.48550/arxiv.2011.06571 2011

  23. [24]

    Tennie \ and\ author T

    author author F. Tennie \ and\ author T. N. \ Palmer ,\ title title Quantum computers for weather and climate prediction: The good, the bad, and the noisy , \ 10.1175/BAMS-D-22-0031.1 journal journal Bulletin of the American Meteorological Society \ volume 104 ,\ pages E488--E500 ( year 2023 ) NoStop

    work page doi:10.1175/bams-d-22-0031.1 2023

  24. [25]

    \ Liu , author H

    author author J.-P. \ Liu , author H. . \ Kolden , author H. K. \ Krovi , author N. F. \ Loureiro , author K. Trivisa , \ and\ author A. M. \ Childs ,\ title title Efficient quantum algorithm for dissipative nonlinear differential equations , \ 10.1073/pnas.2026805118 journal journal Proceedings of the National Academy of Sciences \ volume 118 ,\ pages e2...

    work page doi:10.1073/pnas.2026805118 2021

  25. [26]

    author author H. Krovi ,\ title title Improved quantum algorithms for linear and nonlinear differential equations , \ 10.22331/q-2023-02-02-913 journal journal Quantum \ volume 7 ,\ pages 913 ( year 2023 ) NoStop

    work page doi:10.22331/q-2023-02-02-913 2023

  26. [27]

    author author P. C. S. \ Costa , author P. Schleich , author M. E. S. \ Morales , \ and\ author D. W. \ Berry ,\ title title Further improving quantum algorithms for nonlinear differential equations via higher-order methods and rescaling , \ 10.1038/s41534-025-01084-z journal journal npj Quantum Information \ volume 11 ,\ pages 141 ( year 2025 ) NoStop

    work page doi:10.1038/s41534-025-01084-z 2025

  27. [28]

    Sanavio \ and\ author S

    author author C. Sanavio \ and\ author S. Succi ,\ title title Lattice B oltzmann- C arleman quantum algorithm and circuit for fluid flows at moderate R eynolds number , \ 10.1116/5.0195549 journal journal AVS Quantum Science \ volume 6 ,\ pages 023802 ( year 2024 ) NoStop

    work page doi:10.1116/5.0195549 2024

  28. [29]

    Jennings , author K

    author author D. Jennings , author K. Korzekwa , author M. Lostaglio , author R. Ashworth , author E. Marsili , \ and\ author S. Rolston ,\ title title An end-to-end quantum algorithm for nonlinear fluid dynamics with bounded quantum advantage , \ @noop journal journal arXiv preprint arXiv:2512.03758 \ ( year 2025 ) ,\ http://arxiv.org/abs/2512.03758 arXi...

    arXiv 2025

  29. [30]

    \ Liu , author D

    author author J.-P. \ Liu , author D. An , author D. Fang , author J. Wang , author G. H. \ Low , \ and\ author S. Jordan ,\ title title Efficient quantum algorithm for nonlinear reaction-diffusion equations and energy estimation , \ 10.1007/s00220-023-04857-9 journal journal Communications in Mathematical Physics \ volume 404 ,\ pages 963--1020 ( year 20...

    work page doi:10.1007/s00220-023-04857-9 2023

  30. [31]

    An \ and\ author K

    author author D. An \ and\ author K. Trivisa ,\ title title Quantum algorithms for linear and non-linear fractional reaction-diffusion equations , \ 10.22331/q-2026-01-19-1969 journal journal Quantum \ volume 10 ,\ pages 1969 ( year 2026 ) NoStop

    work page doi:10.22331/q-2026-01-19-1969 2026

  31. [32]

    Novikau \ and\ author I

    author author I. Novikau \ and\ author I. Joseph ,\ title title Globalizing the C arleman linear embedding method for nonlinear dynamics , \ 10.48550/arXiv.2510.15715 journal journal arXiv preprint arXiv:2510.15715 \ ( year 2025 ),\ 10.48550/arXiv.2510.15715 ,\ http://arxiv.org/abs/2510.15715 arXiv:2510.15715 [quant-ph] NoStop

    work page doi:10.48550/arxiv.2510.15715 2025

  32. [33]

    Katz , author G

    author author J. Katz , author G. Muraleedharan , \ and\ author A. Alase ,\ title title Efficient quantum algorithm for solving differential equations with F ourier nonlinearity via K oopman linearization , \ 10.48550/arXiv.2512.06488 journal journal arXiv preprint arXiv:2512.06488 \ ( year 2025 ),\ 10.48550/arXiv.2512.06488 ,\ http://arxiv.org/abs/2512.0...

    work page doi:10.48550/arxiv.2512.06488 2025

  33. [34]

    Tennie \ and\ author L

    author author F. Tennie \ and\ author L. Magri ,\ title title Solving nonlinear differential equations on quantum computers: A F okker- P lanck approach , \ 10.48550/arXiv.2401.13500 journal journal arXiv preprint arXiv:2401.13500 \ ( year 2024 ),\ 10.48550/arXiv.2401.13500 ,\ http://arxiv.org/abs/2401.13500 arXiv:2401.13500 [quant-ph] NoStop

    work page doi:10.48550/arxiv.2401.13500 2024

  34. [35]

    Xue , author Y.-C

    author author C. Xue , author Y.-C. \ Wu , \ and\ author G.-P. \ Guo ,\ title title Quantum homotopy perturbation method for nonlinear dissipative ordinary differential equations , \ 10.1088/1367-2630/ac3eff journal journal New Journal of Physics \ volume 23 ,\ pages 123035 ( year 2021 ) NoStop

    work page doi:10.1088/1367-2630/ac3eff 2021

  35. [36]

    Xue , author X.-F

    author author C. Xue , author X.-F. \ Xu , author Y.-C. \ Wu , \ and\ author G.-P. \ Guo ,\ title title Quantum algorithm for solving a quadratic nonlinear system of equations , \ 10.1103/PhysRevA.106.032427 journal journal Physical Review A \ volume 106 ,\ pages 032427 ( year 2022 ) NoStop

    work page doi:10.1103/physreva.106.032427 2022

  36. [37]

    Lubasch , author J

    author author M. Lubasch , author J. Joo , author P. Moinier , author M. Kiffner , \ and\ author D. Jaksch ,\ title title Variational quantum algorithms for nonlinear problems , \ 10.1103/PhysRevA.101.010301 journal journal Physical Review A \ volume 101 ,\ pages 010301 ( year 2020 ) NoStop

    work page doi:10.1103/physreva.101.010301 2020

  37. [38]

    Kyriienko , author A

    author author O. Kyriienko , author A. E. \ Paine , \ and\ author V. E. \ Elfving ,\ title title Solving nonlinear differential equations with differentiable quantum circuits , \ 10.1103/PhysRevA.103.052416 journal journal Physical Review A \ volume 103 ,\ pages 052416 ( year 2021 ) NoStop

    work page doi:10.1103/physreva.103.052416 2021

  38. [39]

    Siegl , author G

    author author P. Siegl , author G. S. \ Reese , author T. Hashizume , author N.-L. \ van H \"u lst , \ and\ author D. Jaksch ,\ title title Tensor-programmable quantum circuits for solving differential equations , \ 10.1103/2qzh-yf49 journal journal Physical Review Research \ volume 8 ,\ pages 013052 ( year 2026 ) NoStop

    work page doi:10.1103/2qzh-yf49 2026

  39. [40]

    note Higher-order ODEs can be rewritten as equivalent first-order systems by introducing auxiliary variables, so the same construction applies in that setting. Stop

  40. [41]

    Other time discretization schemes may be used, provided the resulting fully discrete update can be represented in the chosen lifted basis

    note The RBA construction is not restricted to explicit Euler. Other time discretization schemes may be used, provided the resulting fully discrete update can be represented in the chosen lifted basis. We use explicit Euler here because it leads to the simplest polynomial update map and makes the construction of the RBA algorithm more transparent. Stop

  41. [42]

    note The constant monomial is included by allowing the multi-index = 0 , for which z ^ =z_1^0 z_n^0=1 . Stop

  42. [43]

    Li , author G

    author author Z. Li , author G. Zhang , \ and\ author X.-M. \ Zhang ,\ title title Reducing C-NOT counts for state preparation and block encoding via diagonal matrix migration , \ 10.48550/arXiv.2603.16492 journal journal arXiv preprint arXiv:2603.16492 \ ( year 2026 ),\ 10.48550/arXiv.2603.16492 ,\ http://arxiv.org/abs/2603.16492 arXiv:2603.16492 [quant-...

    work page doi:10.48550/arxiv.2603.16492 2026

  43. [44]

    author author T. Carleman ,\ title title Application de la th \'e orie des \'e quations int \'e grales lin \'e aires aux syst \`e mes d' \'e quations diff \'e rentielles non lin \'e aires , \ 10.1007/BF02546499 journal journal Acta Mathematica \ volume 59 ,\ pages 63--87 ( year 1932 ) NoStop

    work page doi:10.1007/bf02546499 1932

  44. [45]

    \ Wu , author J

    author author H.-C. \ Wu , author J. Wang , \ and\ author X. Li ,\ title title Quantum algorithms for nonlinear dynamics: Revisiting C arleman linearization with no dissipative conditions , \ 10.1137/24M1665799 journal journal SIAM Journal on Scientific Computing \ volume 47 ,\ pages A943--A970 ( year 2025 ) NoStop

    work page doi:10.1137/24m1665799 2025