pith. sign in

arxiv: 2511.10267 · v2 · submitted 2025-11-13 · 🪐 quant-ph

Quantum Simulation of Non-Hermitian Special Functions and Dynamics via Contour-based Matrix Decomposition

Chao Wang , Huan-Yu Liu , Cheng Xue , Xi-Ning Zhuang , Menghan Dou , Zhao-Yun Chen , Guo-Ping Guo This is my paper

Pith reviewed 2026-05-17 22:30 UTC · model grok-4.3

classification 🪐 quant-ph
keywords non-Hermitian dynamicsquantum simulationcontour decompositionmatrix functionsspecial functionsquantum algorithms
0
0 comments X

The pith

Contour-based matrix decomposition turns non-Hermitian operators into Hermitian linear combinations for quantum simulation.

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

The paper introduces contour-based matrix decomposition (CBMD) to simulate non-Hermitian matrix functions and dynamics on quantum computers. It generalizes the matrix Cauchy residue theorem into an analytic contour-residue identity that truncates with bounded error into linear combinations of Hermitian operators. This yields optimal query complexity for first-order dynamics and extends naturally to second-order systems and special functions such as Bessel and Airy evolutions while lowering amplitude amplification costs and bypassing diagonalizability requirements.

Core claim

CBMD decomposes holomorphic non-Hermitian operators into an analytic infinite contour-residue identity, followed by finite truncation with controlled error to yield linear combinations of Hermitian components. For first-order dynamics this achieves optimal query complexity across all parameters, strictly matching the optimal performance bounds within the linear combination of Hamiltonian simulation paradigm.

What carries the argument

Contour-based matrix decomposition (CBMD), which generalizes the matrix Cauchy residue theorem to produce contour-residue identities that convert non-Hermitian operators into simulatable Hermitian sums.

If this is right

  • Optimal query complexity is achieved for first-order dynamics matching LCHS bounds.
  • The framework extends directly to second-order wave dynamics and non-Hermitian special functions including Bessel and Airy evolutions.
  • Asymptotic growth of non-Hermitian components is suppressed, cutting the number of amplitude amplifications relative to Taylor-plus-LCU.
  • Simulation proceeds without any explicit dependence on matrix diagonalizability or eigenvector conditioning.

Where Pith is reading between the lines

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

  • CBMD ideas could be tested on other classes of non-Hermitian operators arising in open quantum systems.
  • Hybrid classical-quantum workflows might incorporate the same contour truncation to improve scaling of certain matrix-function calculations.
  • The bounded-growth requirement points to a natural next check: whether the method still works under mild relaxations of that condition.

Load-bearing premise

The target function must have bounded growth order on the real axis, or else the error bounds for finite truncation no longer hold.

What would settle it

A concrete non-Hermitian function whose growth on the real axis is unbounded and for which the truncation error cannot be made arbitrarily small would falsify the claimed complexity guarantees.

read the original abstract

Simulating non-Hermitian dynamics on quantum computers is often hindered by the decay of success probability and the instability of non-diagonalizable matrices. Here, we present contour-based matrix decomposition (CBMD), a rigorous and versatile quantum functional calculus framework for simulating non-Hermitian matrix functions. By generalizing the matrix Cauchy residue theorem, CBMD decomposes holomorphic non-Hermitian operators into an analytic infinite contour-residue identity, followed by finite truncation with controlled error to yield linear combinations of Hermitian components. For first-order dynamics, CBMD achieves optimal query complexity across all parameters, strictly matching the optimal performance bounds within the linear combination of Hamiltonian simulation (LCHS) paradigm. Beyond first-order systems, the framework naturally generalizes to complex operator functions, including second-order wave dynamics and non-Hermitian special functions such as Bessel and Airy evolutions. Furthermore, CBMD systematically suppresses the asymptotic growth of non-Hermitian components, yielding a significant reduction in the required number of amplitude amplifications compared to the naive scheme of combining monomials via linear combination of unitaries (LCU) after Taylor expansion. Notably, CBMD avoids explicit dependence on matrix diagonalizability, effectively mitigating the long-standing challenges associated with ill-conditioned eigenvectors and Jordan blocks. Our work establishes a systematic matrix calculus that bridges high-performance classical numerics and fault-tolerant quantum algorithms. It should be noted that CBMD inherits standard LCU overheads, and requires the target function to have a bounded growth order on the real axis.

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 paper introduces contour-based matrix decomposition (CBMD) as a quantum functional calculus framework for simulating non-Hermitian matrix functions and dynamics. It generalizes the matrix Cauchy residue theorem to an analytic contour-residue identity, followed by finite truncation with controlled error to produce linear combinations of Hermitian operators. The central claims are that CBMD achieves optimal query complexity for first-order dynamics matching LCHS bounds, extends naturally to second-order wave dynamics and non-Hermitian special functions (Bessel, Airy), suppresses asymptotic growth of non-Hermitian components to reduce amplitude amplification overhead relative to naive LCU+Tayor, and avoids explicit dependence on matrix diagonalizability or Jordan structure. The abstract notes that CBMD inherits standard LCU overheads and requires the target function to have bounded growth order on the real axis.

Significance. If the truncation analysis, error bounds, and LCHS matching arguments are rigorously established, the framework would provide a systematic bridge between classical contour-integral numerics and fault-tolerant quantum simulation of non-Hermitian operators, with potential advantages in growth suppression and applicability to ill-conditioned matrices. The explicit requirement of bounded growth order is a clear scope limitation that, if properly characterized, would still allow meaningful applications in open quantum systems and non-Hermitian physics.

major comments (2)
  1. [Abstract] Abstract: The claim that 'for first-order dynamics, CBMD achieves optimal query complexity across all parameters, strictly matching the optimal performance bounds within the LCHS paradigm' is presented without derivation steps, explicit truncation-error bounds, or numerical verification. Because the number of terms (and thus query complexity) is determined by the truncation analysis, this omission is load-bearing for the optimality assertion.
  2. [Abstract] Abstract: The bounded-growth-order assumption on the real axis is stated as a requirement for error control, yet the manuscript supplies no quantitative statement of how the truncation error scales when this assumption is marginally violated or how the resulting query-complexity bound degrades. This directly affects the claimed optimality guarantee.
minor comments (1)
  1. [Abstract] The final sentence of the abstract places the two principal limitations (LCU overheads and growth-order requirement) after the positive claims; moving or integrating these caveats earlier would improve clarity for readers.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments on our manuscript. We address each major comment point by point below and have incorporated revisions to improve clarity and completeness where appropriate.

read point-by-point responses

  1. Referee: The claim that 'for first-order dynamics, CBMD achieves optimal query complexity across all parameters, strictly matching the optimal performance bounds within the LCHS paradigm' is presented without derivation steps, explicit truncation-error bounds, or numerical verification. Because the number of terms (and thus query complexity) is determined by the truncation analysis, this omission is load-bearing for the optimality assertion.

    Authors: We appreciate the referee highlighting the need for clearer support of this claim. The abstract provides a concise summary; the full derivation of the query complexity, including explicit truncation-error bounds and the strict matching to LCHS optimal bounds, is established rigorously in the main text through the contour-residue identity, finite truncation analysis, and complexity comparison. Numerical verification for first-order cases appears in the results section. To address the comment, we will revise the abstract to briefly reference the controlled truncation and LCHS matching, and we have added an explicit pointer to the relevant theorems in the introduction. revision: yes

  2. Referee: The bounded-growth-order assumption on the real axis is stated as a requirement for error control, yet the manuscript supplies no quantitative statement of how the truncation error scales when this assumption is marginally violated or how the resulting query-complexity bound degrades. This directly affects the claimed optimality guarantee.

    Authors: We acknowledge this observation. The error control under the bounded-growth-order assumption is analyzed in the main text, but a quantitative discussion of truncation-error scaling and query-complexity degradation under marginal violation of the assumption is not explicitly provided. This is a fair point for strengthening the scope discussion. We will add a dedicated paragraph in the discussion section (with supporting estimates in an appendix) that quantifies the asymptotic scaling of the error and complexity degradation in such cases. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation grounded externally

full rationale

The paper generalizes the standard matrix Cauchy residue theorem to an analytic contour-residue identity for non-Hermitian operators, followed by finite truncation with error bounds that explicitly require bounded growth order on the real axis as a precondition. This assumption is stated outright rather than derived from the framework itself. No steps reduce by construction to fitted parameters, self-citations, or renamed inputs; the optimality claim for first-order dynamics matches LCHS bounds under the stated condition without self-referential forcing. The framework is self-contained against external benchmarks and does not exhibit any of the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Central claim rests on generalizing the matrix Cauchy residue theorem plus the explicit requirement of bounded growth order on the real axis; no free parameters or new entities are introduced in the abstract.

axioms (2)
  • domain assumption Target function has bounded growth order on the real axis
    Stated as a necessary condition for controlled truncation error and LCU compatibility.
  • domain assumption Operator is holomorphic inside the chosen contour
    Required for the residue theorem generalization to apply.

pith-pipeline@v0.9.0 · 5591 in / 1485 out tokens · 41636 ms · 2026-05-17T22:30:33.819882+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.

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.

Forward citations

Cited by 2 Pith papers

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

  1. Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing

    quant-ph 2026-05 unverdicted novelty 7.0

    Bivariate quantum signal processing simulates non-Hermitian Hamiltonians H_eff = H_R + i H_I with query-optimal complexity O((α_R + β_I)T + log(1/ε)/log log(1/ε)) in the separate-oracle model.

  2. A Unified Poisson Summation Framework for Generalized Quantum Matrix Transformations

    quant-ph 2026-04 unverdicted novelty 7.0

    A dual Fourier-PSF and contour-PSF framework resolves the smoothness-sparsity trade-off for efficient quantum simulation of singular and holomorphic matrix functions.

Reference graph

Works this paper leans on

45 extracted references · 45 canonical work pages · cited by 2 Pith papers · 2 internal anchors

  1. [1]

    Pseudorandom Generators with- out the XOR Lemma

    Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Review41(2), 303–332 (1999) https://doi.org/10.1137/ S0036144598347011 https://doi.org/10.1137/S0036144598347011

    work page doi:10.1137/s0036144598347011 1999

  2. [2]

    Preskill

    Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. STOC ’96, pp. 212–219. Association for Computing Machinery, New York, NY , USA (1996). https: //doi.org/10.1145/237814.237866 .https://doi.org/10.1145/237814.237866

    work page doi:10.1145/237814.237866 1996

  3. [3]

    Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett.103, 150502 (2009) https://doi.org/10.1103/PhysRevLett. 103.150502

    work page doi:10.1103/physrevlett 2009

  4. [4]

    Quantum algorithm for systems of linear equations with exponentially improved dependence on precision

    Childs, A.M., Kothari, R., Somma, R.D.: Quantum algorithm for systems of lin- ear equations with exponentially improved dependence on precision. SIAM Jour- nal on Computing46(6), 1920–1950 (2017) https://doi.org/10.1137/16M1087072 https://doi.org/10.1137/16M1087072

    work page Pith review doi:10.1137/16m1087072 1920

  5. [5]

    Georgescu, I.M., Ashhab, S., Nori, F.: Quantum simulation. Rev. Mod. Phys.86, 153– 185 (2014) https://doi.org/10.1103/RevModPhys.86.153

    work page internal anchor Pith review doi:10.1103/revmodphys.86.153 2014

  6. [6]

    Emergent quan- tum state designs from individual many- body wave functions

    Altman, E., Brown, K.R., Carleo, G., Carr, L.D., Demler, E., Chin, C., DeMarco, B., Economou, S.E., Eriksson, M.A., Fu, K.-M.C., Greiner, M., Hazzard, K.R.A., Hulet, R.G., Koll´ar, A.J., Lev, B.L., Lukin, M.D., Ma, R., Mi, X., Misra, S., Monroe, C., Murch, K., Nazario, Z., Ni, K.-K., Potter, A.C., Roushan, P., Saffman, M., Schleier-Smith, M., Siddiqi, I.,...

    work page doi:10.1103/prxquantum 2021

  7. [7]

    Nature607(7920), 667–676 (2022) https://doi.org/10.1038/s41586-022-04940-6

    Daley, A.J., Bloch, I., Kokail, C., Flannigan, S., Pearson, N., Troyer, M., Zoller, P.: Practical quantum advantage in quantum simulation. Nature607(7920), 667–676 (2022) https://doi.org/10.1038/s41586-022-04940-6

    work page doi:10.1038/s41586-022-04940-6 2022

  8. [8]

    Weimer, H., Kshetrimayum, A., Or ´us, R.: Simulation methods for open quantum many-body systems. Rev. Mod. Phys.93, 015008 (2021) https://doi.org/10.1103/ RevModPhys.93.015008

    work page 2021

  9. [9]

    Quantum9, 1765 (2025) https://doi.org/10.22331/ q-2025-06-05-1765

    Liu, H.-Y ., Lin, X., Chen, Z.-Y ., Xue, C., Sun, T.-P., Li, Q.-S., Zhuang, X.-N., Wang, Y .-J., Wu, Y .-C., Gong, M., Guo, G.-P.: Simulation of open quantum systems on universal quantum computers. Quantum9, 1765 (2025) https://doi.org/10.22331/ q-2025-06-05-1765

    work page 2025

  10. [10]

    A model of coupled oscillators applied to the aerosol– cloud–precipitation system

    Delgado-Granados, L.H., Krogmeier, T.J., Sager-Smith, L.M., Avdic, I., Hu, Z., Saj- jan, M., Abbasi, M., Smart, S.E., Narang, P., Kais, S., Schlimgen, A.W., Head-Marsden, 20 K., Mazziotti, D.A.: Quantum algorithms and applications for open quantum systems. Chemical Reviews125(4), 1823–1839 (2025) https://doi.org/10.1021/acs.chemrev. 4c00428

    work page doi:10.1021/acs.chemrev 2025

  11. [11]

    An, D., Liu, J.-P., Lin, L.: Linear combination of hamiltonian simulation for nonunitary dynamics with optimal state preparation cost. Phys. Rev. Lett.131, 150603 (2023) https: //doi.org/10.1103/PhysRevLett.131.150603

    work page doi:10.1103/physrevlett.131.150603 2023

  12. [12]

    https://arxiv.org/abs/2312.03916

    An, D., Childs, A.M., Lin, L.: Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters (2023). https://arxiv.org/abs/2312.03916

    work page arXiv 2023

  13. [13]

    Quantum Differential Equation Solvers with Low State Preparation Cost: Eliminating the Time Dependence in Dissipative Equations.arXiv preprint arXiv:2508.15170, 2025

    Yang, G., Onwunta, A., An, D.: Quantum Differential Equation Solvers with Low State Preparation Cost: Eliminating the Time Dependence in Dissipative Equations (2025). https://arxiv.org/abs/2508.15170

    work page arXiv 2025

  14. [14]

    https://arxiv.org/abs/2505

    Jin, S., Liu, N., Ma, C., Yu, Y .: On the Schr¨odingerization method for linear non-unitary dynamics with optimal dependence on matrix queries (2025). https://arxiv.org/abs/2505. 00370

    work page 2025

  15. [15]

    Journal of Computational Physics471, 111641 (2022) https://doi.org/10.1016/j.jcp.2022.111641

    Jin, S., Liu, N., Yu, Y .: Time complexity analysis of quantum difference methods for linear high dimensional and multiscale partial differential equations. Journal of Computational Physics471, 111641 (2022) https://doi.org/10.1016/j.jcp.2022.111641

    work page doi:10.1016/j.jcp.2022.111641 2022

  16. [16]

    Jin, S., Liu, N., Yu, Y .: Quantum simulation of partial differential equations: Applica- tions and detailed analysis. Phys. Rev. A108, 032603 (2023) https://doi.org/10.1103/ PhysRevA.108.032603

    work page 2023

  17. [17]

    Commu- nications in Mathematical Physics375(2), 1427–1457 (2020) https://doi.org/10.1007/ s00220-020-03699-z

    Childs, A.M., Liu, J.-P.: Quantum spectral methods for differential equations. Commu- nications in Mathematical Physics375(2), 1427–1457 (2020) https://doi.org/10.1007/ s00220-020-03699-z

    work page 2020

  18. [18]

    Journal of Physics A: Mathematical and Theoretical , volume =

    Berry, D.W.: High-order quantum algorithm for solving linear differential equations. Journal of Physics A: Mathematical and Theoretical47(10), 105301 (2014) https://doi. org/10.1088/1751-8113/47/10/105301

    work page doi:10.1088/1751-8113/47/10/105301 2014

  19. [19]

    Commu- nications in Mathematical Physics356(3), 1057–1081 (2017) https://doi.org/10.1007/ s00220-017-3002-y

    Berry, D.W., Childs, A.M., Ostrander, A., Wang, G.: Quantum algorithm for linear differential equations with exponentially improved dependence on precision. Commu- nications in Mathematical Physics356(3), 1057–1081 (2017) https://doi.org/10.1007/ s00220-017-3002-y

    work page 2017

  20. [20]

    Berry, D.W., C. S. Costa, P.: Quantum algorithm for time-dependent differential equations using Dyson series. Quantum8, 1369 (2024) https://doi.org/10.22331/ q-2024-06-13-1369

    work page 2024

  21. [21]

    arXiv preprint arXiv:2508.19238 , url=

    Low, G.H., Somma, R.D.: Optimal quantum simulation of linear non-unitary dynamics (2025). https://arxiv.org/abs/2508.19238 21

    work page arXiv 2025

  22. [22]

    Jin, S., Liu, N., Yu, Y .: Quantum simulation of partial differential equations via schr¨odingerization. Phys. Rev. Lett.133, 230602 (2024) https://doi.org/10.1103/ PhysRevLett.133.230602

    work page 2024

  23. [23]

    Huang and D

    Huang, X., An, D.: Fourier transform-based linear combination of Hamiltonian simula- tion (2025). https://arxiv.org/abs/2508.19596

    work page arXiv 2025

  24. [24]

    https://arxiv.org/abs/2507.11675

    Li, X., Liu, K., Ding, Q.: Dynamics Simulation of Arbitrary Non-Hermitian Systems Based on Quantum Monte Carlo (2025). https://arxiv.org/abs/2507.11675

    work page arXiv 2025

  25. [25]

    https://arxiv.org/abs/2507

    Li, X.: From Linear Differential Equations to Unitaries: A Moment-Matching Dilation Framework with Near-Optimal Quantum Algorithms (2025). https://arxiv.org/abs/2507. 10285

    work page 2025

  26. [26]

    Pocrnic, P

    Pocrnic, M., Johnson, P.D., Katabarwa, A., Wiebe, N.: Constant-Factor Improvements in Quantum Algorithms for Linear Differential Equations (2025). https://arxiv.org/abs/ 2506.20760

    work page arXiv 2025

  27. [27]

    Quantum9, 1770 (2025) https://doi.org/10.22331/ q-2025-06-17-1770

    Dong, D., Li, Y ., Xue, J.: A quantum algorithm for linear autonomous differential equations via Pad ´e approximation. Quantum9, 1770 (2025) https://doi.org/10.22331/ q-2025-06-17-1770

    work page 2025

  28. [28]

    Lu, H.-E

    Lu, R., Li, H.-E., Liu, Z., Liu, J.-P.: Infinite-dimensional Extension of the Linear Com- bination of Hamiltonian Simulation: Theorems and Applications (2025). https://arxiv. org/abs/2502.19688

    work page arXiv 2025

  29. [29]

    Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages =

    Gily ´en, A., Su, Y ., Low, G.H., Wiebe, N.: Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. STOC 2019, pp. 193–204. Association for Computing Machinery, New York, NY , USA (2019). https: //doi.org/10.1145/3313276.3316...

    work page doi:10.1145/3313276.3316366 2019

  30. [30]

    Low, G.H., Chuang, I.L.: Optimal hamiltonian simulation by quantum signal processing. Phys. Rev. Lett.118, 010501 (2017) https://doi.org/10.1103/PhysRevLett.118.010501

    work page doi:10.1103/physrevlett.118.010501 2017

  31. [31]

    Hamiltonian simulation by qubitization

    Low, G.H., Chuang, I.L.: Hamiltonian Simulation by Qubitization. Quantum3, 163 (2019) https://doi.org/10.22331/q-2019-07-12-163

    work page doi:10.22331/q-2019-07-12-163 2019

  32. [32]

    Forum of Mathematics, Sigma5, 8 (2017) https://doi.org/10.1017/fms.2017.2

    BERRY , D.W., CHILDS, A.M., CLEVE, R., KOTHARI, R., SOMMA, R.: Exponential improvement in precision for simulating sparse hamiltonians. Forum of Mathematics, Sigma5, 8 (2017) https://doi.org/10.1017/fms.2017.2

    work page doi:10.1017/fms.2017.2 2017

  33. [33]

    Communications in Mathematical Physics406(8), 189 (2025) https://doi.org/10.1007/s00220-025-05358-7

    An, D., Liu, J.-P., Wang, D., Zhao, Q.: Quantum differential equation solvers: Limita- tions and fast-forwarding. Communications in Mathematical Physics406(8), 189 (2025) https://doi.org/10.1007/s00220-025-05358-7

    work page doi:10.1007/s00220-025-05358-7 2025

  34. [34]

    SIAM Journal on Numerical Analysis63(4), 1861–1885 (2025) https://doi.org/10.1137/24M164272X https://doi.org/10.1137/24M164272X

    Jin, S., Liu, N., Ma, C.: On schrodingerization-based quantum algorithms 22 for linear dynamical systems with inhomogeneous terms. SIAM Journal on Numerical Analysis63(4), 1861–1885 (2025) https://doi.org/10.1137/24M164272X https://doi.org/10.1137/24M164272X

    work page doi:10.1137/24m164272x 2025

  35. [35]

    Minor containment and disjoint paths in almost-linear time

    Low, G.H., Su, Y .: Quantum eigenvalue processing. In: 2024 IEEE 65th Annual Sym- posium on Foundations of Computer Science (FOCS), pp. 1051–1062 (2024). https: //doi.org/10.1109/FOCS61266.2024.00070

    work page doi:10.1109/focs61266.2024.00070 2024

  36. [36]

    https://arxiv.org/abs/2302.11139

    Borns-Weil, Y ., Saffat, T., Stier, Z.: A Quantum Algorithm for Functions of Multiple Commuting Hermitian Matrices (2023). https://arxiv.org/abs/2302.11139

    work page arXiv 2023

  37. [37]

    Motta, C

    Motta, M., Sun, C., Tan, A.T.K., O’Rourke, M.J., Ye, E., Minnich, A.J., Brand ˜ao, F.G.S.L., Chan, G.K.-L.: Determining eigenstates and thermal states on a quantum com- puter using quantum imaginary time evolution. Nature Physics16(2), 205–210 (2020) https://doi.org/10.1038/s41567-019-0704-4

    work page doi:10.1038/s41567-019-0704-4 2020

  38. [38]

    Variational ansatz-based quantum simulation of imaginary time evolution

    McArdle, S., Jones, T., Endo, S., Li, Y ., Benjamin, S.C., Yuan, X.: Variational ansatz- based quantum simulation of imaginary time evolution. npj Quantum Information5(1), 75 (2019) https://doi.org/10.1038/s41534-019-0187-2

    work page doi:10.1038/s41534-019-0187-2 2019

  39. [39]

    doi:10.1016/j.cma

    Chen, Z.-Y ., Ma, T.-Y ., Ye, C.-C., Xu, L., Bai, W., Zhou, L., Tan, M.-Y ., Zhuang, X.- N., Xu, X.-F., Wang, Y .-J., Sun, T.-P., Chen, Y ., Du, L., Guo, L.-L., Zhang, H.-F., Tao, H.-R., Wang, T.-L., Yang, X.-Y ., Zhao, Z.-A., Wang, P., Zhang, S., Zhao, R.-Z., Zhang, C., Jia, Z.-L., Kong, W.-C., Dou, M.-H., Wang, J.-C., Liu, H.-Y ., Xue, C., Zhang, P.-J.-...

    work page doi:10.1016/j.cma 2024

  40. [40]

    Scientific Reports15(1), 13268 (2025) https://doi.org/ 10.1038/s41598-025-97245-3

    Kumar, S., Wilmott, C.M.: Simulating the non-hermitian dynamics of financial option pricing with quantum computers. Scientific Reports15(1), 13268 (2025) https://doi.org/ 10.1038/s41598-025-97245-3

    work page doi:10.1038/s41598-025-97245-3 2025

  41. [41]

    Princeton University Press

    Stein, E.M., Shakarchi, R.: Complex Analysis. Princeton Lectures in Analysis, vol. 2. Princeton University Press, Princeton, NJ (2003). https://press.princeton.edu/books/hardcover/9780691113852/complex- analysis

    work page arXiv 2003

  42. [42]

    https://arxiv.org/abs/2003.05263

    Vasilescu, F.-H.: Spectrum and Analytic Functional Calculus in Real and Quaternionic Frameworks (2020). https://arxiv.org/abs/2003.05263

    work page arXiv 2020

  43. [43]

    Hamiltonian Simulation in the Interaction Picture

    Low, G.H., Wiebe, N.: Hamiltonian Simulation in the Interaction Picture (2019). https: //arxiv.org/abs/1805.00675

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  44. [44]

    https: //arxiv.org/abs/2510.06316 23

    Kang, C., Su, Y .: Quantum matrix arithmetics with Hamiltonian evolution (2025). https: //arxiv.org/abs/2510.06316 23

    work page arXiv 2025

  45. [45]

    Quantum7, 913 (2023) https://doi.org/10.22331/q-2023-02-02-913 24

    Krovi, H.: Improved quantum algorithms for linear and nonlinear differential equations. Quantum7, 913 (2023) https://doi.org/10.22331/q-2023-02-02-913 24

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