Search arXivSearch

arXiv · 2608.29302

A Spectral Identifiability Threshold for Dissipative Rate Recovery from Truncated Liouvillian Spectra

Abstract

Open quantum systems lose energy and phase coherence through different dissipative processes, but these processes can produce overlapping dynamical signatures. The Liouvillian spectrum summarizes how such a system relaxes, yet it is not obvious how much of that spectrum is needed to distinguish the underlying dissipation rates. We study this question for amplitude damping and dephasing in a six-qubit Lindblad model whose spectrum can be derived analytically. We retain only the slowest non-steady spectral modes and ask how many are required before each dissipative rate becomes recoverable. We show that population modes contain no dephasing information, which creates a lower bound of D = 2^n retained modes for uniform dephasing identifiability in the relevant rate regime. The measured recovery threshold reaches this bound at n = 4,5,6, while n = 3 remains above it. At n = 6, least squares achieves a mean joint absolute error of order 10^-9, compared with 4.355 x 10^-4 for four tabular learning methods. Robustness tests show that this advantage weakens when the spectra are perturbed and when a transverse field breaks the commuting structure. These results show that the amount and structure of retained spectral information can determine whether dissipative parameters are recoverable, independently of the estimator used. The present conclusions apply to noise-free simulator spectra rather than measurement-derived spectra.

Explore related subjects

Keep this discovery

BibTeXRIS

Yujun Ji, Somyajit Chakraborty. 2026-08-29. A Spectral Identifiability Threshold for Dissipative Rate Recovery from Truncated Liouvillian Spectra. https://arxiv.org/abs/2608.29302

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems

Many current and near-future applications of quantum computing utilise parametric families of quantum circuits and variational methods that can suffer from obstacles including non-convergence to the global minimum due to local minima, critical slowing down, or exponential resource scaling. Here we show that quantum imaginary time evolution can overcome these obstacles if the underlying physical system satisfies a set of conditions. This includes many relevant applications such as ground state preparation for local theories in physics or chemistry, combinatorial optimisation problems, or quantum machine learning. In particular, we analyse the quantum imaginary time evolution showing convergence guarantees to the global minimum without critical slowing down and providing a priori estimates on the required evolution time which scale linearly in system size and inverse energy gap. Furthermore, a provided complexity analysis shows that quantum imaginary time evolution can be efficiently compiled into a parametric quantum circuit, finding the optimal parameters included, for a large class of physically relevant problems.

quant-ph

Why Multi-Layer Message Passing Works: Completeness Theory for Graph Neural Network Interatomic Potentials

We prove that the Hypergraph Neural Network, an invariant architecture with 3-body message passing, is a universal approximator for potential energy surfaces. Our main contribution is a multi-layer completeness theory. We show that $L$ layers of message passing on sparse, cutoff-based graphs achieve the same representational power as having access to the full $L$-hop neighborhood, provided the configurations are generic, satisfy an overlap condition and a connectivity condition. This provides the first rigorous justification for the common practice of using multi-layer message passing with a per-layer cutoff smaller than the physical interaction range, the setting used by virtually all practical graph neural network based machine-learned interatomic potentials. As immediate consequences, we show that both DPA3 and CHGNet architectures inherit universal approximation.

cs.LG

Physics-informed learning for the inverse problem in resonant ultrasound spectroscopy

Inferring elastic constants from resonant ultrasound spectra is a nonlinear and typically overdetermined inverse problem based on finite spectral data. We formulate the Rayleigh-Ritz inverse problem as a constrained inverse-isospectral problem on the set of physically admissible elasticity tensors. This induces effective low-dimensional variables for the inverse map on the admissible elasticity manifold: length and elastic scales, aspect-ratio coordinates, scale-free spectral features, and stability-respecting elastic ratios. We use these variables to construct a physics-informed learning pipeline in which a regression model acts only on reduced spectral and geometric features, while scale recovery and final elastic-constant reconstruction are imposed analytically. For the full cubic benchmark, the reconstructed constants have MAE values of $20.37(35.15)$, $24.30(41.33)$, and $2.13(3.66)~\mathrm{GPa}$ for $C_{11}$, $C_{12}$, and $C_{44}$. In the fixed-geometry benchmark, the corresponding cubic MAPE values are $4.14(3.87)\%$, $8.31(8.50)\%$, and $2.44(2.86)\%$, while the isotropic values are $4.0(3.6)\%$ and $0.4(0.3)\%$ for the bulk and shear moduli. The inverse problem then becomes a constrained regression problem in variables adapted to the geometry, scaling, crystal symmetry, and thermodynamic stability of Hookean elasticity.

cond-mat.mtrl-sci