pith. sign in

arxiv: 2605.15366 · v1 · pith:ZDISICJYnew · submitted 2026-05-14 · 🪐 quant-ph · physics.comp-ph

Measurement-Efficient Variational Quantum Linear Solver for Carleman-Linearized Nonlinear Dynamics

Yunya Liu , Pai Wang This is my paper

Pith reviewed 2026-05-19 15:23 UTC · model grok-4.3

classification 🪐 quant-ph physics.comp-ph
keywords variational quantum linear solverCarleman linearizationDuffing equationnonlinear dynamicshybrid quantum-classicalHadamard testquantum hardware implementation
0
0 comments X p. Extension
pith:ZDISICJY Add to your LaTeX paper What is a Pith Number? 
\usepackage{pith}
\pithnumber{ZDISICJY}

Prints a linked pith:ZDISICJY badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

The pith

Variational quantum linear solvers recover states proportional to classical solutions for Carleman-linearized nonlinear dynamics.

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

The paper establishes a hybrid quantum-classical approach that first applies Carleman linearization to turn the weakly nonlinear Duffing equation into a solvable linear system, then uses an optimized variational quantum linear solver to find the corresponding quantum state. It reports that topology-agnostic ansatzes, careful Hermitianization choices, and efficient global or local cost functions let the solver reach near-unity fidelity and near-zero residuals on both simulated and real IBM and Xanadu hardware. A sympathetic reader would care because the method offers a concrete, measurement-efficient route to embed nonlinear dynamical simulation inside near-term quantum loops without demanding full error correction.

Core claim

Across block-banded test cases, VQLS with symmetry-grouped Hadamard Test evaluations under global and local cost formulations, together with comparisons of distinct Hermitianization methods and hardware-efficient ansatz architectures, achieves near-unity fidelity and vanishing relative residuals; these results demonstrate that topology-agnostic ansatz, optimized Hermitianization, and efficient cost formulation enable VQLS to recover quantum states proportional to classical solutions for Carleman-structured systems.

What carries the argument

Topology-agnostic ansatz with optimized Hermitianization and efficient cost formulation inside the variational quantum linear solver applied to Carleman-linearized systems.

If this is right

  • Higher truncation orders in Carleman linearization produce successively better approximations to the original nonlinear dynamics.
  • Symmetry-grouped Hadamard tests support both global and local cost formulations while keeping measurement overhead low.
  • Multiple Hermitianization techniques can be evaluated inside one shared cost framework to identify the best performer for a given system.
  • Hardware-efficient ansatzes maintain high accuracy for block-banded Carleman matrices when Hermitianization is held fixed.

Where Pith is reading between the lines

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

  • The same pipeline could be tested on other nonlinear oscillators or fluid models that admit Carleman linearization.
  • Embedding the solver inside a feedback loop might enable real-time quantum-assisted prediction for weakly nonlinear control problems.
  • If the cost formulation scales favorably with matrix bandwidth, the approach could extend to larger truncation orders on future hardware.

Load-bearing premise

Carleman linearization accurately approximates the weakly nonlinear Duffing equation with errors that diminish as the truncation order increases.

What would settle it

An experiment in which raising the Carleman truncation order fails to reduce the gap between the VQLS output state and the classical solution vector, or in which fidelity remains low despite the listed optimizations, would falsify the central claim.

Figures

Figures reproduced from arXiv: 2605.15366 by Pai Wang, Yunya Liu.

Figure 1
Figure 1. Figure 1: Hadamard Test circuits for the three overlap families required by VQLS: (a) [PITH_FULL_IMAGE:figures/full_fig_p012_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Verification of the Carleman linearization on the Duffing equation. (Left) Dis [PITH_FULL_IMAGE:figures/full_fig_p015_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Global cost-function history for the Qiskit pipeline (Method A) on (a) a [PITH_FULL_IMAGE:figures/full_fig_p020_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: (a) Heatmaps of the regularized system constructed by block-banded matrices [PITH_FULL_IMAGE:figures/full_fig_p023_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: (a) Heatmaps of the augmented system constructed by real-valued block-banded [PITH_FULL_IMAGE:figures/full_fig_p024_5.png] view at source ↗
Figure 1
Figure 1. Figure 1: The symbolic form of matrix L where step m = 1, extended step p = 1, h is time step, δ is damping coefficient, α is linear stiffness coefficient, β is nonlinear stiffness coefficient, and γ is driving amplitude. 3 [PITH_FULL_IMAGE:figures/full_fig_p041_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The Hadamard Test circuits for the imaginary part of expectation value mea [PITH_FULL_IMAGE:figures/full_fig_p042_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The commuting group strategy for a system with three target qubits and one [PITH_FULL_IMAGE:figures/full_fig_p043_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The block-banded matrix used in PennyLane Method A approach: (left) the [PITH_FULL_IMAGE:figures/full_fig_p044_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Comparison of different basis for two real-valued block-banded matrix in (a) and [PITH_FULL_IMAGE:figures/full_fig_p046_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Cost history of examples of real-valued block-banded matrices generated by the [PITH_FULL_IMAGE:figures/full_fig_p046_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: (a) Cost history and (b) heatmap of the highlighted example in Table III of the [PITH_FULL_IMAGE:figures/full_fig_p047_7.png] view at source ↗
read the original abstract

We present hybrid quantum-classical pipelines for solving the Duffing equation that leverage Carleman linearization and the Variational Quantum Linear Solver (VQLS). First, we demonstrate that Carleman linearization accurately approximates the weakly nonlinear Duffing equation, with errors diminishing as the truncation order increases. Next, across IBM and Xanadu platforms, we deploy VQLS with symmetry-grouped Hadamard Test evaluations under both global and local cost formulations, compare distinct Hermitianization within a common cost framework, and benchmark hardware-efficient ansatz architectures under a fixed Hermitianization. Across block-banded test cases, each method achieves near-unity fidelity and vanishing relative residuals. These results show that topology-agnostic ansatz, optimized Hermitianization, and efficient cost formulation enable VQLS to recover quantum states proportional to classical solutions for Carleman-structured systems, providing a portable recipe for quantum-in-the-loop simulation of nonlinear dynamics.

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

2 major / 1 minor

Summary. The manuscript presents hybrid quantum-classical pipelines for solving the Duffing equation via Carleman linearization to obtain a linear system, followed by solution with the Variational Quantum Linear Solver (VQLS). It first claims that Carleman linearization approximates the weakly nonlinear dynamics with errors that diminish as truncation order increases. It then reports hardware experiments on IBM and Xanadu platforms using symmetry-grouped Hadamard tests under global and local costs, comparisons of Hermitianization methods, and benchmarks of hardware-efficient ansatzes, all achieving near-unity fidelity and vanishing relative residuals on block-banded Carleman systems. The central claim is that topology-agnostic ansatz, optimized Hermitianization, and efficient cost formulation enable VQLS to recover states proportional to classical solutions for such systems.

Significance. If the results hold, the work is significant as a practical demonstration of VQLS applied to Carleman-linearized nonlinear ODEs on real hardware, providing a portable recipe that combines classical linearization with variational quantum linear solving. It contributes measurement-efficient techniques (symmetry-grouped Hadamard tests) and systematic comparisons of ansatz and Hermitianization choices within a common cost framework. The external grounding against classical solutions of the same linearized system strengthens the numerical claims.

major comments (2)
  1. [Abstract and numerical experiments] Abstract and results on Carleman approximation: the foundational claim that Carleman linearization approximates the weakly nonlinear Duffing equation with errors diminishing as truncation order increases is stated without explicit quantification or bounds for the specific truncation orders and block-banded matrix sizes used in the IBM/Xanadu VQLS experiments. Without showing that these linearization errors are smaller than the reported VQLS residuals, the validity of the hybrid pipeline for the original nonlinear dynamics is not secured.
  2. [Hardware experiments] Hardware results section: near-unity fidelity and vanishing relative residuals are reported without error bars, details on the number of circuit executions, or statistical analysis across runs. This omission makes it difficult to assess robustness given the noisy intermediate-scale quantum hardware used.
minor comments (1)
  1. [Methods] The description of the cost formulations and Hermitianization procedures would benefit from explicit equation references or a summary table to improve clarity for readers implementing the methods.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their constructive and detailed feedback. We address each major comment point by point below, indicating where revisions will be made to strengthen the manuscript.

read point-by-point responses

  1. Referee: [Abstract and numerical experiments] Abstract and results on Carleman approximation: the foundational claim that Carleman linearization approximates the weakly nonlinear Duffing equation with errors diminishing as truncation order increases is stated without explicit quantification or bounds for the specific truncation orders and block-banded matrix sizes used in the IBM/Xanadu VQLS experiments. Without showing that these linearization errors are smaller than the reported VQLS residuals, the validity of the hybrid pipeline for the original nonlinear dynamics is not secured.

    Authors: We agree that explicit quantification of the Carleman linearization error for the precise truncation orders and block-banded matrix dimensions employed in the hardware experiments, together with a direct comparison against the observed VQLS residuals, would better secure the validity of the overall pipeline. The manuscript already illustrates the general trend of diminishing error with increasing truncation order via classical numerical examples; however, these were not tied specifically to the VQLS test cases. In the revised version we will add a dedicated subsection (or supplementary figure) that computes and reports the linearization error norms for the exact truncation orders and matrix sizes used on IBM and Xanadu, and we will verify that these errors remain smaller than the reported VQLS residuals. revision: yes

  2. Referee: [Hardware experiments] Hardware results section: near-unity fidelity and vanishing relative residuals are reported without error bars, details on the number of circuit executions, or statistical analysis across runs. This omission makes it difficult to assess robustness given the noisy intermediate-scale quantum hardware used.

    Authors: We acknowledge that the absence of error bars, shot counts, and statistical analysis across multiple runs limits the reader’s ability to judge robustness on NISQ devices. In the revised manuscript we will augment the hardware-results section with (i) error bars obtained from repeated independent executions, (ii) explicit reporting of the number of circuit shots used for each Hadamard-test evaluation, and (iii) a concise statistical summary (mean and standard deviation) of fidelity and residual metrics over the ensemble of runs. revision: yes

Circularity Check

0 steps flagged

No significant circularity; claims grounded in external classical benchmarks

full rationale

The paper separates two independent demonstrations: (1) classical verification that Carleman truncation approximates the weakly nonlinear Duffing equation with errors that decrease at higher orders, and (2) VQLS applied to the resulting block-banded linear systems, with quantum outputs directly compared to classical solutions of the exact same Carleman-linearized matrices. Fidelity and residual metrics are therefore measured against an external classical reference rather than against any fitted parameter or self-derived quantity internal to the VQLS procedure. No equation or claim reduces by construction to its own inputs; the topology-agnostic ansatz, Hermitianization choices, and cost formulations are validated by their agreement with independently computed classical vectors. This structure satisfies the self-contained benchmark criterion and yields no load-bearing self-definition, fitted-input prediction, or self-citation chain.

Axiom & Free-Parameter Ledger

2 free parameters · 1 axioms · 0 invented entities

The approach rests on the domain assumption that Carleman truncation converges for weakly nonlinear systems and on standard variational quantum algorithm components; no new physical entities are introduced.

free parameters (2)
  • Carleman truncation order
    Selected to balance approximation error against matrix size for the Duffing equation; value not specified in abstract.
  • VQLS ansatz depth and parameters
    Optimized during variational training; specific circuit details absent from abstract.
axioms (1)
  • domain assumption Carleman linearization provides a controllable approximation to the nonlinear Duffing dynamics whose error decreases with truncation order
    Invoked in the first sentence of the abstract as the basis for the subsequent quantum solver experiments.

pith-pipeline@v0.9.0 · 5683 in / 1409 out tokens · 52921 ms · 2026-05-19T15:23:31.606450+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    We present hybrid quantum-classical pipelines for solving the Duffing equation that leverage Carleman linearization and the Variational Quantum Linear Solver (VQLS). ... topology-agnostic ansatz, optimized Hermitianization, and efficient cost formulation enable VQLS to recover quantum states proportional to classical solutions for Carleman-structured systems

  • IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean reality_from_one_distinction unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    Carleman linearization accurately approximates the weakly nonlinear Duffing equation, with errors diminishing as the truncation order increases

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

77 extracted references · 77 canonical work pages · 5 internal anchors

  1. [1]

    Temam, Navier–Stokes equations: theory and numerical analysis, Vol

    R. Temam, Navier–Stokes equations: theory and numerical analysis, Vol. 343, American Mathematical Society, 2024

    work page 2024

  2. [2]

    Nellis, S

    G. Nellis, S. Klein, Heat transfer, Cambridge university press, 2008

    work page 2008

  3. [3]

    Sastry, Nonlinear systems: analysis, stability, and control, Vol

    S. Sastry, Nonlinear systems: analysis, stability, and control, Vol. 10, Springer Science & Business Media, 2013

    work page 2013

  4. [4]

    Kovacic, M

    I. Kovacic, M. J. Brennan (Eds.), The Duffing Equation: Nonlinear Oscillators and their Behaviour, John Wiley & Sons, Chichester, UK, 2011

    work page 2011

  5. [5]

    C. Á. Hubay, T. Kalmár-Nagy, Return time approximation in planar nonlinear systems, Journal of Sound and Vibration 508 (2021) 116200. 27

    work page 2021

  6. [6]

    Kowalski, W.-h

    K. Kowalski, W.-h. Steeb, Nonlinear dynamical systems and Carleman linearization, World Scientific, 1991

    work page 1991

  7. [7]

    Explicit Error Bounds for Carleman Linearization

    M. Forets, A. Pouly, Explicit error bounds for carleman linearization, arXiv preprint arXiv:1711.02552 (2017)

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  8. [8]

    Forets, C

    M. Forets, C. Schilling, Reachability of weakly nonlinear systems us- ing carleman linearization, in: International Conference on Reachability Problems, Springer, 2021, pp. 85–99

    work page 2021

  9. [9]

    Y. Ito, Y. Tanaka, K. Fujii, How to map linear differential equations to schr\"{o}dinger equations via carleman and koopman-von neumann embeddings for quantum algorithms, arXiv preprint arXiv:2311.15628 (2023)

    work page arXiv 2023

  10. [10]

    Surana, A

    A. Surana, A. Gnanasekaran, T. Sahai, An efficient quantum algo- rithm for simulating polynomial differential equations, arXiv preprint arXiv:2212.10775 (2022)

    work page arXiv 2022

  11. [11]

    Amini, C

    A. Amini, C. Zheng, Q. Sun, N. Motee, Carleman linearization of nonlinear systems and its finite-section approximations, arXiv preprint arXiv:2207.07755 (2022)

    work page arXiv 2022

  12. [12]

    D. Shi, X. Yang, Koopman spectral linearization vs. carleman linearization: A computational comparison study, arXiv preprint arXiv:2310.19078 (2023)

    work page arXiv 2023

  13. [13]

    S. V. Chermnykh, Carleman linearization and normal forms for differ- ential systems with quasi-periodic coefficients, SpringerPlus 5 (1) (2016) 1347. 28

    work page 2016

  14. [14]

    Le Rousseau, G

    J. Le Rousseau, G. Lebeau, On carleman estimates for elliptic and parabolic operators. applications to unique continuation and control of parabolic equations, ESAIM: Control, Optimisation and Calculus of Variations 18 (3) (2012) 712–747

    work page 2012

  15. [15]

    B. N. Biswas, S. Chatterjee, S. Mukherjee, S. Pal, A discussion on euler method: A review, Electronic Journal of Mathematical Analysis and Applications 1 (2) (2013) 2090–2792

    work page 2013

  16. [16]

    D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, R. D. Somma, Sim- ulating hamiltonian dynamics with a truncated taylor series, Physical review letters 114 (9) (2015) 090502

    work page 2015

  17. [17]

    Argeri, S

    M. Argeri, S. Di Vita, P. Mastrolia, E. Mirabella, J. Schlenk, U. Schu- bert, L. Tancredi, Magnus and dyson series for master integrals, Journal of High Energy Physics 2014 (3) (2014) 1–32

    work page 2014

  18. [18]

    J. N. Reddy, An introduction to the finite element method, New York 27 (14) (1993)

    work page 1993

  19. [19]

    J.-P. Liu, H. Ø. Kolden, H. K. Krovi, N. F. Loureiro, K. Trivisa, A. M. Childs, Efficient quantum algorithm for dissipative nonlinear differential equations, Proceedings of the National Academy of Sciences 118 (35) (2021) e2026805118

    work page 2021

  20. [20]

    Y. Wu, D. An, J.-P. Liu, A. M. Childs, Quantum algorithms for non- linear dynamics: Revisiting carleman linearization with no dissipative conditions, arXiv preprint arXiv:2405.12714 (2024). 29

    work page arXiv 2024

  21. [21]

    Joseph, Koopman–von neumann approach to quantum simulation of nonlinear classical dynamics, Physical Review Research 2 (4) (2020) 043102

    I. Joseph, Koopman–von neumann approach to quantum simulation of nonlinear classical dynamics, Physical Review Research 2 (4) (2020) 043102

    work page 2020

  22. [22]

    Z. Yan, H. Dai, Q. Wang, S. N. Atluri, Harmonic balance methods: a review and recent developments, CMES - Computer Modeling in Engi- neering and Sciences (2023)

    work page 2023

  23. [23]

    Cordero, J

    A. Cordero, J. G. Maimó, A. Rodríguez-Cabral, J. R. Torregrosa, Two- step fifth-order efficient jacobian-free iterative method for solving non- linear systems, Mathematics 12 (21) (2024) 3341

    work page 2024

  24. [24]

    Bayat, I

    M. Bayat, I. Pakar, G. Domairry, Recent developments of some asymp- totic methods and their applications for nonlinear vibration equations in engineering problems: A review, Latin American Journal of Solids and Structures 9 (2) (2012) 1–93

    work page 2012

  25. [25]

    S. K. Leyton, T. J. Osborne, A quantum algorithm to solve nonlinear differential equations, arXiv preprint arXiv:0812.4423 (2008)

    work page internal anchor Pith review Pith/arXiv arXiv 2008

  26. [26]

    D. W. Berry, P. C. Costa, Quantum algorithm for time-dependent dif- ferential equations using dyson series, Quantum 8 (2024) 1369

    work page 2024

  27. [27]

    Montanaro, S

    A. Montanaro, S. Pallister, Quantum algorithms and the finite element method, Physical Review A 93 (3) (2016) 032324

    work page 2016

  28. [28]

    Quantum algorithm for nonlinear differential equations.arXiv preprint arXiv:2011.06571, 2020

    S. Lloyd, G. De Palma, C. Gokler, B. Kiani, Z.-W. Liu, M. Marvian, F. Tennie, T. Palmer, Quantum algorithm for nonlinear differential equations, arXiv preprint arXiv:2011.06571 (2020). 30

    work page arXiv 2011

  29. [29]

    D. W. Berry, High-order quantum algorithm for solving linear differ- ential equations, Journal of Physics A: Mathematical and Theoretical 47 (10) (2014) 105301

    work page 2014

  30. [30]

    A. M. Childs, J.-P. Liu, A. Ostrander, High-precision quantum algo- rithms for partial differential equations, Quantum 5 (2021) 574

    work page 2021

  31. [31]

    S.Jakhodia, B.Jajodia, Numericalmethodsforsolvinghigh-ordermath- ematical problems using quantum linear system algorithm on ibm qiskit platform, in: 2022 International Conference on Innovative Trends in Information Technology (ICITIIT), IEEE, 2022, pp. 1–7

    work page 2022

  32. [32]

    Krovi, Improved quantum algorithms for linear and nonlinear differ- ential equations, Quantum 7 (2023) 913

    H. Krovi, Improved quantum algorithms for linear and nonlinear differ- ential equations, Quantum 7 (2023) 913

    work page 2023

  33. [33]

    Engel, G

    A. Engel, G. Smith, S. E. Parker, Linear embedding of nonlinear dynam- ical systems and prospects for efficient quantum algorithms, Physics of Plasmas 28 (6) (2021)

    work page 2021

  34. [34]

    Akiba, Y

    T. Akiba, Y. Morii, K. Maruta, Carleman linearization approach for chemical kinetics integration toward quantum computation, Scientific Reports 13 (1) (2023) 3935

    work page 2023

  35. [35]

    Cerezo, A

    M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fu- jii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, et al., Variational quantum algorithms, Nature Reviews Physics 3 (9) (2021) 625–644

    work page 2021

  36. [36]

    Y. Liu, J. Liu, J. R. Raney, P. Wang, Quantum computing for solid mechanics and structural engineering–a demonstration with variational quantum eigensolver, Extreme Mechanics Letters 67 (2024) 102117. 31

    work page 2024

  37. [37]

    Y. Liu, P. Wang, Quantum algorithm to calculate dispersion bands of mechanical metamaterials, in: Active and Passive Smart Structures and Integrated Systems XVIII, Vol. 12946, SPIE, 2024, p. 129460N

    work page 2024

  38. [38]

    Bravo-Prieto, R

    C. Bravo-Prieto, R. LaRose, M. Cerezo, Y. Subasi, L. Cincio, P. J. Coles, Variational quantum linear solver, arXiv preprint arXiv:1909.05820 (2019)

    work page arXiv 1909

  39. [39]

    Turati, A

    G. Turati, A. Marruzzo, M. F. Dacrema, P. Cremonesi, An empirical analysis on the effectiveness of the variational quantum linear solver, arXiv preprint arXiv:2409.06339 (2024)

    work page arXiv 2024

  40. [40]

    Kyriienko, A

    O. Kyriienko, A. E. Paine, V. E. Elfving, Solving nonlinear differen- tial equations with differentiable quantum circuits, Physical Review A 103 (5) (2021) 052416

    work page 2021

  41. [41]

    Patil, Y

    H. Patil, Y. Wang, P. S. Krstić, Variational quantum linear solver with a dynamic ansatz, Physical Review A 105 (1) (2022) 012423

    work page 2022

  42. [42]

    X. Rao, K. Du, Performance study of variational quantum linear solver for linear elastic problems, in: International Conference on Computa- tional & Experimental Engineering and Sciences, Springer, 2024, pp. 80–94

    work page 2024

  43. [43]

    Hosaka, K

    A. Hosaka, K. Yanagisawa, S. Koshikawa, I. Kudo, X. Alifu, T. Yoshida, Preconditioning for a variational quantum linear solver, arXiv preprint arXiv:2312.15657 (2023)

    work page arXiv 2023

  44. [44]

    Lubasch, J

    M. Lubasch, J. Joo, P. Moinier, M. Kiffner, D. Jaksch, Variational 32 quantum algorithms for nonlinear problems, Physical Review A 101 (1) (2020) 010301

    work page 2020

  45. [45]

    Tosti Balducci, B

    G. Tosti Balducci, B. Chen, M. Möller, M. Gerritsma, R. De Breuker, Review and perspectives in quantum computing for partial differential equations in structural mechanics, Frontiers in Mechanical Engineering 8 (2022) 914241

    work page 2022

  46. [46]

    Sarma, T

    A. Sarma, T. W. Watts, M. Moosa, Y. Liu, P. L. McMahon, Quantum variational solving of nonlinear and multidimensional partial differential equations, Physical Review A 109 (6) (2024) 062616

    work page 2024

  47. [47]

    Demirdjian, D

    R. Demirdjian, D. Gunlycke, C. A. Reynolds, J. D. Doyle, S. Tafur, Variational quantum solutions to the advection–diffusion equation for applications in fluid dynamics, Quantum Information Processing 21 (9) (2022) 322

    work page 2022

  48. [48]

    Cappanera, Variational quantum linear solver for finite element prob- lems: A poisson equation test case, Delft University of Technology (2021)

    E. Cappanera, Variational quantum linear solver for finite element prob- lems: A poisson equation test case, Delft University of Technology (2021)

    work page 2021

  49. [49]

    C. J. Trahan, M. Loveland, N. Davis, E. Ellison, A variational quan- tum linearsolverapplication todiscrete finite-elementmethods, Entropy 25 (4) (2023) 580

    work page 2023

  50. [50]

    Arora, B

    A. Arora, B. M. Ward, C. Oskay, An implementation of the finite ele- ment method in hybrid classical/quantum computers, Finite Elements in Analysis and Design 248 (2025) 104354. 33

    work page 2025

  51. [51]

    X. Xu, J. Sun, S. Endo, Y. Li, S. C. Benjamin, X. Yuan, Variational algorithms for linear algebra, Science Bulletin 66 (21) (2021) 2181–2188

    work page 2021

  52. [52]

    Lewis, S

    D. Lewis, S. Eidenbenz, B. Nadiga, Y. Subaşı, Limitations for quantum algorithms to solve turbulent and chaotic systems, Quantum 8 (2024) 1509

    work page 2024

  53. [53]

    Kalmár-Nagy, C

    T. Kalmár-Nagy, C. Á. Hubay, Carleman linearization of nonlinear sys- tems with centers: Spectra and jordan basis, Journal of Sound and Vibration 607 (2025) 119065

    work page 2025

  54. [54]

    Sanavio, R

    C. Sanavio, R. Scatamacchia, C. de Falco, S. Succi, Three carleman routes to the quantum simulation of classical fluids, Physics of Fluids 36 (5) (2024)

    work page 2024

  55. [55]

    Sanavio, E

    C. Sanavio, E. Mauri, S. Succi, Carleman-grad approach to the quantum simulation of fluids, arXiv preprint arXiv:2406.01118 (2024)

    work page arXiv 2024

  56. [56]

    Gonzalez-Conde, D

    J. Gonzalez-Conde, D. Lewis, S. S. Bharadwaj, M. Sanz, Quantum carle- manlinearizationefficiencyinnonlinearfluiddynamics, PhysicalReview Research 7 (2) (2025) 023254

    work page 2025

  57. [57]

    Surana, A

    A. Surana, A. Gnanasekaran, Variational quantum framework for partial differential equation constrained optimization, arXiv preprint arXiv:2405.16651 (2024)

    work page arXiv 2024

  58. [58]

    Quantum computing with Qiskit

    A. Javadi-Abhari, M. Treinish, K. Krsulich, C. J. Wood, J. Lishman, J. Gacon, S. Martiel, P. D. Nation, L. S. Bishop, A. W. Cross, B. R. Johnson, J. M. Gambetta, Quantum computing with Qiskit, arXiv preprint arXiv:2405.08810 (2024). 34

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  59. [59]

    PennyLane: Automatic differentiation of hybrid quantum-classical computations

    V. Bergholm, J. Izaac, M. Schuld, C. Gogolin, S. Ahmed, V. Ajith, etal., PennyLane: Automaticdifferentiationofhybridquantum-classical computations, arXiv preprint arXiv:1811.04968 (2018)

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  60. [60]

    R. Iten, R. Colbeck, I. Kukuljan, J. Home, M. Christandl, Quantum circuits for isometries, Physical Review A 93 (3) (2016) 032318

    work page 2016

  61. [61]

    Transformation of quantum states using uniformly controlled rotations

    M. Mottonen, J. J. Vartiainen, V. Bergholm, M. M. Salomaa, Transfor- mation of quantum states using uniformly controlled rotations, arXiv preprint quant-ph/0407010 (2004)

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  62. [62]

    T. Keen, E. Dumitrescu, Y. Wang, Quantum algorithms for ground- state preparation and green’s function calculation, arXiv preprint arXiv:2112.05731 (2021)

    work page arXiv 2021

  63. [63]

    Y. Ge, J. Tura, J. I. Cirac, Faster ground state preparation and high- precision ground energy estimation with fewer qubits, Journal of Math- ematical Physics 60 (2) (2019)

    work page 2019

  64. [64]

    Aharonov, V

    D. Aharonov, V. Jones, Z. Landau, A polynomial quantum algorithm for approximatingthejonespolynomial, in: Proceedingsofthethirty-eighth annual ACM symposium on Theory of computing, 2006, pp. 427–436

    work page 2006

  65. [65]

    measurement-efficient vari- ational quantum linear solver for carleman-linearized nonlinear dynam- ics

    P. W. Yunya Liu, Supplemental material for “measurement-efficient vari- ational quantum linear solver for carleman-linearized nonlinear dynam- ics"., available with the published article (2025)

    work page 2025

  66. [66]

    Gilyén, Y

    A. Gilyén, Y. Su, G. H. Low, N. Wiebe, Quantum singular value trans- formation and beyond: exponential improvements for quantum matrix 35 arithmetics, in: Proceedings of the 51st annual ACM SIGACT sympo- sium on theory of computing, 2019, pp. 193–204

    work page 2019

  67. [67]

    Hantzko, L

    L. Hantzko, L. Binkowski, S. Gupta, Tensorized pauli decomposition algorithm, Physica Scripta 99 (8) (2024) 085128

    work page 2024

  68. [68]

    Koska, M

    O. Koska, M. Baboulin, A. Gazda, A tree-approach pauli decomposi- tion algorithm with application to quantum computing, in: ISC High Performance 2024 Research Paper Proceedings (39th International Con- ference), Prometeus GmbH, 2024, pp. 1–11

    work page 2024

  69. [69]

    Gnanasekaran, A

    A. Gnanasekaran, A. Surana, Efficient variational quantum linear solver for structured sparse matrices, in: 2024 IEEE International Conference on Quantum Computing and Engineering (QCE), Vol. 1, IEEE, 2024, pp. 199–210

    work page 2024

  70. [70]

    S. De, O. Knitter, R. Kodati, P. Jayakumar, J. Stokes, S. Veerapaneni, Variationalquantumandneuralquantumstatesalgorithmsforthelinear complementarity problem, arXiv preprint arXiv:2504.08141 (2025)

    work page arXiv 2025

  71. [71]

    Znojil, Complex tridiagonal quantum hamiltonians and matrix con- tinued fractions, Physics Letters A (2025) 130604

    M. Znojil, Complex tridiagonal quantum hamiltonians and matrix con- tinued fractions, Physics Letters A (2025) 130604

    work page 2025

  72. [72]

    M. J. Powell, A direct search optimization method that models the ob- jective and constraint functions by linear interpolation, Springer, 1994

    work page 1994

  73. [73]

    A. G. Baydin, B. A. Pearlmutter, A. A. Radul, J. M. Siskind, Automatic differentiation in machine learning: a survey, J. Mach. Learn. Res. 18 (2018) 1–43. 36 Table 2: VQLS Performance via PennyLane Pipeline, Method A QseedB κ(L H)ansatz depthλ∗ Rr Fsol Fdir BCCL,final 2 0b uni 6.08 HEA 41.9134 0.0000 1.0000 1.0000 1.0000 0.00e+00 2 0b seed 6.08 HEA 4-2.06...

    work page 2018

  74. [74]

    Carleman-linearized Duffing system The Fig.1 displays an example of the matrixLwith two steps ofm= 1 andp= 1, which is a sparse block lower-bidiagonal matrix. Figure 1: The symbolic form of matrixLwhere stepm= 1, extended stepp= 1,his time step,δis damping coefficient,αis linear stiffness coefficient,βis nonlinear stiffness coefficient, andγis driving amp...

    work page

  75. [75]

    To Figure 2: The Hadamard Test circuits for the imaginary part of expectation value mea- surement

    Hadamard Test Circuits Here, we present examples of Hadamard Test circuits using different vari- ational ansätze and controlled unitaries based on the local cost function. To Figure 2: The Hadamard Test circuits for the imaginary part of expectation value mea- surement. (a) On six target qubits and one ancilla qubit, there are two circuit depths of Layere...

    work page

  76. [76]

    We conduct the linear combination of unitaries (LCU) using the Pauli basis{I, X, Y, Z}

    Appendix for PennyLane Method A Here, we present an example of a block-banded matrix applied in the Pen- nyLane Method A approach. We conduct the linear combination of unitaries (LCU) using the Pauli basis{I, X, Y, Z}. Figure 4: The block-banded matrix used in PennyLane Method A approach: (left) the block-banded target matrix example with banded pattern, ...

    work page

  77. [77]

    Appendix for PennyLane Method B ForQnumber of qubits, the Pauli basis consists of all possible tensor products of single-qubit Pauli matrices, forming linearly independent ma- trices that completely span the4 Q-dimensional space of2 Q ×2 Q complex matrices. The Sigma basis has two options and also generates4Q linearly independent matrices: •{I, Z, σ +, σ−...

    work page