pith. sign in

arxiv: 2603.25708 · v2 · submitted 2026-03-26 · 🪐 quant-ph · cond-mat.str-el· math-ph· math.MP

Provably Efficient Long-Time Exponential Decompositions of Non-Markovian Gaussian Baths

Zhen Huang , Zhiyan Ding , Ke Wang , Jason Kaye , Xiantao Li , Lin Lin This is my paper

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

classification 🪐 quant-ph cond-mat.str-elmath-phmath.MP
keywords non-Markovian dynamicsGaussian bathsexponential decompositionopen quantum systemsspectral densitylong-time simulationpseudomode methodsmemory kernels
0
0 comments X

The pith

Sums of exponentials can represent non-Markovian bath correlations over arbitrarily long times with complexity independent of T for broad classes of spectral densities.

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

The paper establishes rigorous bounds showing that bath correlation functions can be written as sums of complex exponentials whose number stays bounded as the simulation interval length T grows, provided the spectral density has only controlled nonanalytic features. This time-uniform complexity holds directly for many realistic bosonic and fermionic environments, with only mild polylogarithmic growth in T when the density contains step discontinuities or inverse power-law singularities. Temperature dependence remains mild for bosons and vanishes for fermions, so the dominant cost driver is the sharpness of spectral features rather than duration. The results apply to pseudomode and hierarchical equations of motion methods and extend to Markovian embeddings of classical generalized Langevin equations.

Core claim

For a broad class of spectral densities the minimal number of complex exponentials needed to approximate the bath correlation function uniformly on the interval [0,T] is bounded independently of T; when the density contains step discontinuities or inverse power-law divergences the number grows at most polylogarithmically in T, while the temperature dependence is mild for bosonic baths and absent for fermionic ones.

What carries the argument

Rigorous upper bounds on the number of exponentials required to approximate the bath correlation function, derived from the type and strength of singularities in the effective spectral density.

If this is right

  • Long-time simulation of non-Markovian open quantum systems via pseudomode or HEOM methods incurs no exponential cost growth with T for typical bath spectra.
  • The computational bottleneck for extended simulations shifts from time duration to the presence and strength of sharp spectral features.
  • Markovian embeddings of classical generalized Langevin equations with memory kernels inherit the same time-uniform complexity.
  • Temperature scaling remains favorable or neutral, supporting simulations at low temperatures without added exponential overhead.

Where Pith is reading between the lines

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

  • Similar bounds may apply to memory kernels in classical stochastic dynamics beyond Gaussian noise.
  • Spectral densities could be engineered with controlled singularities to minimize simulation cost while preserving physical realism.
  • The polylog T scaling suggests that adaptive or hierarchical exponential decompositions may achieve near-optimal performance without full a-priori knowledge of T.

Load-bearing premise

The spectral densities belong to a class whose nonanalytic features are limited to step discontinuities, inverse power-law divergences, or similar singularities of explicitly characterized type and strength.

What would settle it

A concrete spectral density with a step discontinuity or inverse power-law singularity for which the minimal number of exponentials needed on [0,T] grows faster than any polylog T would falsify the stated bounds.

Figures

Figures reproduced from arXiv: 2603.25708 by Jason Kaye, Ke Wang, Lin Lin, Xiantao Li, Zhen Huang, Zhiyan Ding.

Figure 1
Figure 1. Figure 1: FIG. 1 [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: (a)). We note that this is a much weaker ana￾lyticity assumption compared to previous works [19] (see [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3 [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
read the original abstract

Gaussian baths are widely used to model non-Markovian environments, yet the cost of accurate simulation at long times remains poorly understood, especially when spectral densities exhibit nonanalytic behavior as in a range of realistic models. We rigorously bound the complexity of representing bath correlation functions on a time interval $[0,T]$ by sums of complex exponentials, as employed in recent variants of pseudomode and hierarchical equations of motion methods. These bounds make explicit the dependence on the maximal simulation time $T$, inverse temperature $\beta$, and the type and strength of singularities in an effective spectral density. For a broad class of spectral densities, the required number of exponentials is bounded independently of $T$, achieving time-uniform complexity. The $T$-dependence emerges only as polylogarithmic factors for spectral densities with strong singularities, such as step discontinuities and inverse power-law divergences. The temperature dependence is mild for bosonic environments and disappears entirely for fermionic environments. Thus, the true bottleneck for long-time simulation is not the simulation duration itself, but rather the presence of sharp nonanalytic features in the bath spectrum. Our results are instructive both for long-time simulation of non-Markovian open quantum systems, as well as for Markovian embeddings of classical generalized Langevin equations with memory kernels.

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

0 major / 3 minor

Summary. The manuscript establishes rigorous upper bounds on the number of complex exponentials needed to approximate bath correlation functions of non-Markovian Gaussian baths over [0,T]. For spectral densities whose non-analyticities are limited to step discontinuities or inverse power-law singularities of explicitly characterized strength, the number of terms is independent of T (or grows only as polylog T); temperature dependence is mild for bosonic baths and vanishes for fermionic baths. The bounds are derived via contour-integral or Prony-type estimates and are presented as guiding the complexity of pseudomode and HEOM embeddings.

Significance. If the stated bounds hold, the work supplies a precise complexity theory for long-time exponential decompositions, showing that simulation duration itself is not the dominant cost once the singularity class is fixed. This directly informs practical choices in open-system simulation and classical generalized Langevin embeddings, and the explicit dependence on singularity type and temperature is a clear advance over heuristic exponential fits.

minor comments (3)
  1. [§2.2] §2.2: the definition of the effective spectral density J_eff(ω) should include an explicit statement of how the bosonic/fermionic factors are absorbed, to avoid ambiguity when the same bound is later invoked for both statistics.
  2. [Theorem 3.1] Theorem 3.1: the polylogarithmic factor for inverse-power singularities is stated with an implicit constant; making the dependence on the exponent α explicit (even as a remark) would strengthen the result for readers who must choose truncation orders.
  3. [Figure 1] Figure 1 caption: the plotted error curves are shown for a single T; adding a second panel or inset that varies T over two orders of magnitude would visually confirm the claimed T-independence.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment and recommendation to accept. The report accurately summarizes the main results on rigorous bounds for the number of complex exponentials needed to represent non-Markovian bath correlation functions.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The derivation supplies explicit contour-integral and Prony-type estimates for the Laplace transform of the bath correlation function, with the T-dependence (or polylog-T) and singularity-strength dependence stated directly from those estimates. No step reduces a claimed bound to a fitted parameter, a self-citation chain, or a definition that presupposes the result; the central complexity claim is obtained from standard approximation theory applied to the explicitly characterized class of spectral densities.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the assumption that the effective spectral densities belong to a class whose singularities are of bounded type and strength; no free parameters or new entities are introduced in the abstract.

axioms (1)
  • domain assumption Spectral densities exhibit nonanalytic behavior limited to specified types such as step discontinuities and inverse power-law divergences
    The bounds are stated to depend explicitly on the type and strength of these singularities.

pith-pipeline@v0.9.0 · 5546 in / 1255 out tokens · 43331 ms · 2026-05-15T00:15:28.608072+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 rigorously bound the complexity of representing bath correlation functions on a time interval [0,T] by sums of complex exponentials... For a broad class of spectral densities, the required number of exponentials is bounded independently of T, achieving time-uniform complexity. The T-dependence emerges only as polylogarithmic factors for spectral densities with strong singularities, such as step discontinuities and inverse power-law divergences.

  • IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    The key idea of our analysis is illustrated in Fig. 2. For each smooth segment of Jeff(ω), we assume it admits a holomorphic extension to a domain Ω in the lower half-plane... conformal map that sends the semi-elliptic region to a strip...

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

60 extracted references · 60 canonical work pages

  1. [1]

    Rivas and S

    A. Rivas and S. F. Huelga, Open quantum systems , Vol. 10 (Springer, 2012)

    work page 2012

  2. [2]

    Forn-Díaz, L

    P. Forn-Díaz, L. Lamata, E. Rico, J. Kono, and E. Solano, Reviews of Modern Physics 91, 025005 (2019)

    work page 2019

  3. [3]

    Georges, G

    A. Georges, G. Kotliar, W. Krauth, and M. J. Rozenberg, Reviews of modern physics 68, 13 (1996)

    work page 1996

  4. [4]

    Haertle, G

    R. Haertle, G. Cohen, D. Reichman, and A. Millis, Phys- ical Review B 88, 235426 (2013)

    work page 2013

  5. [5]

    Mukamel and D

    S. Mukamel and D. Abramavicius, Chemical Reviews 104, 2073 (2004)

    work page 2073

  6. [6]

    Tanaka and Y

    M. Tanaka and Y. Tanimura, Journal of the Physical Society of Japan 78, 073802 (2009)

    work page 2009

  7. [7]

    Garraway, Physical Review A 55, 2290 (1997)

    B. Garraway, Physical Review A 55, 2290 (1997)

    work page 1997

  8. [8]

    Dorda, M

    A. Dorda, M. Nuss, W. von der Linden, and E. Arrigoni, Phys. Rev. B 89, 165105 (2014)

    work page 2014

  9. [9]

    Dorda, M

    A. Dorda, M. Ganahl, H. G. Evertz, W. von der Linden, and E. Arrigoni, Phys. Rev. B 92, 125145 (2015)

    work page 2015

  10. [10]

    M. P. Woods and M. B. Plenio, Journal of Mathematical Physics 57 (2016)

    work page 2016

  11. [11]

    Rosenbach, J

    R. Rosenbach, J. Cerrillo, S. F. Huelga, J. Cao, and M. B. Plenio, New Journal of Physics 18, 023035 (2016)

    work page 2016

  12. [12]

    Mascherpa, A

    F. Mascherpa, A. Smirne, S. F. Huelga, and M. B. Plenio, Physical review letters 118, 100401 (2017)

    work page 2017

  13. [13]

    Tamascelli, A

    D. Tamascelli, A. Smirne, S. F. Huelga, and M. B. Plenio, Physical review letters 120, 030402 (2018)

    work page 2018

  14. [14]

    Tamascelli, A

    D. Tamascelli, A. Smirne, J. Lim, S. F. Huelga, and M. B. Plenio, Physical review letters 123, 090402 (2019)

    work page 2019

  15. [15]

    Nüßeler, I

    A. Nüßeler, I. Dhand, S. F. Huelga, and M. B. Plenio, Physical Review B 101, 155134 (2020)

    work page 2020

  16. [16]

    Tanimura, The Journal of Chemical Physics 153, 020901 (2020)

    Y. Tanimura, The Journal of Chemical Physics 153, 020901 (2020)

    work page 2020

  17. [17]

    M. Xu, Y. Yan, Q. Shi, J. Ankerhold, and J. Stockburger, Physical Review Letters 129, 230601 (2022)

    work page 2022

  18. [18]

    G. Park, Z. Huang, Y. Zhu, C. Yang, G. K.-L. Chan, and L. Lin, Physical Review B 110, 195148 (2024)

    work page 2024

  19. [19]

    Thoenniss, I

    J. Thoenniss, I. Vilkoviskiy, and D. A. Abanin, arXiv preprint arXiv:2409.08816 (2024)

    work page arXiv 2024

  20. [20]

    Lednev, F

    M. Lednev, F. J. García-Vidal, and J. Feist, Physical Review Letters 132, 106902 (2024)

    work page 2024

  21. [21]

    Huang, G

    Z. Huang, G. Park, G. K.-L. Chan, and L. Lin, Physical Review Letters 136, 090403 (2026)

    work page 2026

  22. [22]

    de Vega, U

    I. de Vega, U. Schollwöck, and F. A. Wolf, Physical Re- view B 92, 155126 (2015)

    work page 2015

  23. [23]

    Van Hove, Physical Review 89, 1189 (1953)

    L. Van Hove, Physical Review 89, 1189 (1953)

    work page 1953

  24. [24]

    [ 56–58]

    See supplemental material for mathematical details, which includes refs. [ 56–58]

    work page

  25. [25]

    J. Kaye, K. Chen, and O. Parcollet, Physical Review B 105, 155115 (2022)

    work page 2022

  26. [26]

    Nakatsukasa, O

    Y. Nakatsukasa, O. Sète, and L. N. Trefethen, SIAM Journal on Scientific Computing 40, A1494 (2018)

    work page 2018

  27. [27]

    Mejuto-Zaera, L

    C. Mejuto-Zaera, L. Zepeda-Núñez, M. Lindsey, N. Tub- man, B. Whaley, and L. Lin, Physical Review B 101, 035143 (2020)

    work page 2020

  28. [28]

    Shinaoka and Y

    H. Shinaoka and Y. Nagai, Phys. Rev. B 103, 045120 (2021)

    work page 2021

  29. [29]

    Huang, E

    Z. Huang, E. Gull, and L. Lin, Physical Review B 107, 075151 (2023). 6

    work page 2023

  30. [30]

    Ying, Journal of Scientific Computing 92, 107 (2022)

    L. Ying, Journal of Scientific Computing 92, 107 (2022)

    work page 2022

  31. [31]

    J. Kaye, Z. Huang, H. U. R. Strand, and D. Golež, Phys- ical Review X 14, 031034 (2024)

    work page 2024

  32. [32]

    Huang, D

    Z. Huang, D. Golež, H. U. R. Strand, and J. Kaye, Sci- Post Phys. 19, 121 (2025)

    work page 2025

  33. [33]

    Gazizova, L

    D. Gazizova, L. Zhang, E. Gull, and J. LeBlanc, Physical Review B 110, 075158 (2024)

    work page 2024

  34. [34]

    Gazizova, R

    D. Gazizova, R. Farid, B. D. E. McNiven, I. Assi, E. G. Armstrong, and J. P. F. LeBlanc, Phys. Rev. B 112, 035172 (2025)

    work page 2025

  35. [35]

    Zhang and E

    L. Zhang and E. Gull, Phys. Rev. B 110, 035154 (2024)

    work page 2024

  36. [36]

    Zhang, Y

    L. Zhang, Y. Yu, and E. Gull, Phys. Rev. B 110, 235131 (2024)

    work page 2024

  37. [37]

    L. Ying, J. Comput. Phys. 469, 111549 (2022)

    work page 2022

  38. [38]

    Georges, G

    A. Georges, G. Kotliar, W. Krauth, and M. J. Rozenberg, Rev. Mod. Phys. 68, 13 (1996)

    work page 1996

  39. [39]

    LaBollita, J

    H. LaBollita, J. Kaye, and A. Hampel, Phys. Rev. B 111, 115155 (2025)

    work page 2025

  40. [40]

    Sheng, A

    N. Sheng, A. Hampel, S. Beck, O. Parcollet, N. Wentzell, J. Kaye, and K. Chen, Phys. Rev. B 107, 245123 (2023)

    work page 2023

  41. [41]

    Caffarel and W

    M. Caffarel and W. Krauth, Phys. Rev. Lett. 72, 1545 (1994)

    work page 1994

  42. [42]

    Liebsch and H

    A. Liebsch and H. Ishida, J. Phys.: Condens. Matter 24, 053201 (2011)

    work page 2011

  43. [43]

    F. A. Wolf, A. Go, I. P. McCulloch, A. J. Millis, and U. Schollwöck, Phys. Rev. X 5, 041032 (2015)

    work page 2015

  44. [44]

    Valenti, I

    A. Valenti, I. Park, A. Georges, A. J. Millis, and O. Par- collet, Neural-network quantum embedding solvers for correlated materials (2026), arXiv:2603.15741 [cond- mat.str-el]

    work page arXiv 2026

  45. [45]

    Zhang, A

    L. Zhang, A. Erpenbeck, Y. Yu, and E. Gull, The Journal of Chemical Physics 162 (2025)

    work page 2025

  46. [46]

    Paprotzki and M

    E. Paprotzki and M. Eckstein, Physical Review B 112, 205126 (2025)

    work page 2025

  47. [47]

    Uni- fied analysis of non-Markovian open quantum systems in Gaus- sian environment using superoperator formalism,

    Z. Huang, L. Lin, G. Park, and Y. Zhu, arXiv preprint arXiv:2411.08741 (2024)

    work page arXiv 2024

  48. [48]

    A. J. Leggett, S. Chakravarty, A. T. Dorsey, M. P. Fisher, A. Garg, and W. Zwerger, Reviews of Modern Physics 59, 1 (1987)

    work page 1987

  49. [49]

    Siegle, I

    P. Siegle, I. Goychuk, P. Talkner, and P. Hänggi, Phys- ical Review E—Statistical, Nonlinear, and Soft Matter Physics 81, 011136 (2010)

    work page 2010

  50. [50]

    Goychuk, Advances in Chemical Physics 150, 187 (2012)

    I. Goychuk, Advances in Chemical Physics 150, 187 (2012)

    work page 2012

  51. [51]

    Kupferman, Journal of statistical physics 114, 291 (2004)

    R. Kupferman, Journal of statistical physics 114, 291 (2004)

    work page 2004

  52. [52]

    B. A. Dalton, C. Ayaz, H. Kiefer, A. Klimek, L. Tepper, and R. R. Netz, Proceedings of the National Academy of Sciences 120, e2220068120 (2023)

    work page 2023

  53. [53]

    G. Jung, M. Hanke, and F. Schmid, Journal of chemical theory and computation 13, 2481 (2017)

    work page 2017

  54. [54]

    J. O. Daldrop, B. G. Kowalik, and R. R. Netz, Physical Review X 7, 041065 (2017)

    work page 2017

  55. [55]

    Vilkoviskiy and D

    I. Vilkoviskiy and D. A. Abanin, Physical Review B 109, 205126 (2024)

    work page 2024

  56. [56]

    Adelman and J

    S. Adelman and J. D. Doll, The Journal of Chemical Physics 61, 4242 (1974)

    work page 1974

  57. [57]

    Lutz, Physical Review E 64, 051106 (2001)

    E. Lutz, Physical Review E 64, 051106 (2001)

    work page 2001

  58. [58]

    Roy and T

    R. Roy and T. Kailath, IEEE Transactions on Acoustics, Speech, and Signal Processing 37, 984 (1989)

    work page 1989

  59. [59]

    L. N. Trefethen and J. Weideman, SIAM review 56, 385 (2014). Support Information for Long-time simulation of general non-Markovian Gaussian environments at arbitrary temperature: theoretical analysis Zhen Huang 1, Zhiyan Ding 2, Ke Wang 2, Jason Kaye 3,4, Xiantao Li 5 and Lin Lin 1,6 1Department of Mathematics, University of California, Berkeley, CA 94720...

    work page 2014

  60. [60]

    ( S4) to a bound on Jeff (tanh z), note that Re(tanh(x − iy)) = sinh(2x) cosh(2x) + cos(2y) , so the sign of Re(tanh z) is the sign of x

    To pass from the endpoint bounds in Eq. ( S4) to a bound on Jeff (tanh z), note that Re(tanh(x − iy)) = sinh(2x) cosh(2x) + cos(2y) , so the sign of Re(tanh z) is the sign of x. Hence ω = tanh z lies in Ω+ for x ≥ 0 and in Ω− for x ≤ 0. Moreover, 1 − tanh z = e−z cosh z , 1 + tanh z = ez cosh z . Since 2−1/2 cosh x ≤ | cosh z| ≤ cosh x when |y| < π/ 4, fo...

    work page