Skip to content
Preprint

Data-efficient reconstruction of critical quantum dynamics via blind fractional-envelope extrapolation

Jul 2026 · 0 citations · 48 references
Physics

Abstract

Simulating real-time dynamics of quantum systems is often limited to short times by entanglement growth. Finite-pole reconstructions such as linear prediction and related machineries extrapolate such data reliably when the spectrum is a finite set of excitations, but at criticality the low-energy spectrum is a power-law continuum $A(\omega)\sim|\omega|^{\alpha-1}$ -- a branch cut whose real-time tail $G(t)\sim t^{-\alpha}$ finitely many poles cannot represent. Here we develop a fractional-calculus-motivated envelope extrapolation for such data. Its structure is motivated by a fractional form of Schwinger--Dyson (fSD) equation, in which the Laplace symbol $s^{\alpha}$ carries the branch cut analytically while the residual self-energy remains meromorphic. On real data we employ the corresponding operational alternative -- the exponent $\alpha$ is selected blindly inside the fit window, the signal is detrended by $t^{\alpha}$, the residual is fitted by a stabilized finite-pole model, and the algebraic envelope is restored. On the critical XXZ chain this blind fractional-envelope method (fSD for short) extrapolates short-time data typically several-fold more accurately than finite-pole methods, with the exponent $\alpha$ identified blindly from the fit window alone and bracketing the closed-form Luttinger value at weak coupling. The same blind search finds the $z=2$ dilute-magnon exponent $\alpha=1/2$ at the $\Delta=1$ saturation transition, and the advantage persists in the gapped free-magnon phase with its sharp band edges. On noncritical dynamical mean-field spectra, whose low-frequency response is regular, fSD by contrast fails to select any stable fractional envelope and reduces to the standard pole result rather than manufacturing a spurious power law, making it an efficient and accurate route to quantum critical dynamics when only short simulation times are accessible.

View source

Similar papers

Preprint Oct 2026

Strong Simulation of 1D Quantum Circuits via Reduced Transition Matrices

Tensor networks are powerful tools for simulating quantum many-body systems, but the growth of spatial entanglement severely limits the direct evolution of pure states under chaotic unitary circuits. Here we consider a more targeted task: the approximate strong simulation of a specified output probability of a 1D chaot...

Matilde Grassi, Stefano Carignano, L. Tagliacozzo et al. · 0 citations
Preprint Sep 2026

Optimal low-rank compression of quantum dynamics

Local quantum interactions generate dynamics in an exponentially large Hilbert space, yet locality and entanglement restrict the information that can spread and accumulate. Bounds on propagation and entanglement growth, together with tensor networks, exploit these restrictions to discard information unnecessary for des...

H. Mackay, Donghoon Kim, Tan Van Vu et al. · 1 citation
Preprint Sep 2026

MORE Thermal Gauge Theories at Finite $\theta$ and $\mu$ from Real-Time Quantum Simulation

Imaginary-time evolution can be reconstructed from real-time quantum simulations using exact integral transforms. We identify the construction of Guo, Shibu, Lin, and Zhao as a continuous linear combination of Hamiltonian simulations and show that its slow $1/t_{\rm cut}$ convergence arises from a redundant kernel comp...

Henry Lamm · 0 citations
Preprint Aug 2026

A unifying framework for quantum algorithms for time-dependent non-unitary dynamics

We present an improved autonomization method for quantum simulation of time-dependent homogeneous dissipative linear systems, combining a clock-variable reformulation with Schr\"odingerization to obtain a time-independent Hamiltonian system. To control both discretization error and recovery probability, we construct th...

Xiao-Jing Dong, Chu-Wen Ma, Yi-Zhen Peng et al. · 1 citation
Preprint Sep 2026

Wavelength-Uniform Quantum Algorithms for Mixed-State Quantum Dynamics

A quantum algorithm efficient for ranges of wave lengths, with complexity in the spatial dimension and discretization and query bounds containing {\it no} negative powers of the small wavelength, which can capture the correct physical observables even if the spatial grid does not resolve the frequency, hence defying th...

Shi Jin, Chu-Wen Ma · 0 citations
Preprint Sep 2026

R\'enyi Phase Transitions and Analytic Continuation to the von Neumann Entropy

Extracting operationally meaningful quantities such as von Neumann entropy and mutual information is central to characterizing many-body quantum systems, yet experiments and numerics often provide direct access only to integer R\'enyi entropies. Whereas conventional extrapolation relies on a prescribed fitting ansatz,...

A. Raj, Akash Vijay, Hong-Chen Jiang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.