quantum physics

Efficient Lindbladian Learning from Constant-Time Pauli Responses

arXiv:2607.25795

summary

The paper presents efficient methods for learning the generator (Lindbladian) of open many‑body quantum systems from short‑time local Pauli response data, resolving coherent‑dissipative ambiguities and achieving entrywise accuracy with near‑optimal sample complexity.

Abstract

Learning the generator of an open many-body system is more challenging than Hamiltonian learning: local responses, which can directly reveal coherent interaction terms in closed-system dynamics, may also contain dissipative contributions in open-system dynamics. In this paper, we address this challenge by developing an efficient Lindbladian learning framework for a known local candidate generator dictionary with bounded dissipative support and either bounded dual-interaction-graph degree or bounded unweighted local strength. The framework resolves the coherent-dissipative ambiguity by treating local Pauli responses as a linear system over both types of generator terms. Inverting this response system separates their contributions and makes the individual Lindbladian coefficients accessible from local response data in a fixed short-time window. Within this framework, we develop two efficient learning algorithms: Chebyshev--Lobatto response interpolation, which uses logarithmically many short evolution times and has a post-mean cost linear in , with the stated dependence on , and Single-time projected response contraction, which uses a single fixed evolution time and globally inverts a truncated response function. Both procedures estimate candidate coefficients to entrywise accuracy using sample and classical post-processing complexity. Our theoretical results establish local response inversion as a scalable paradigm for learning, calibrating, and diagnosing complex quantum systems from experimentally accessible short-time data.

Topics & keywords

#open quantum systems#lindbladian learning#pauli response#quantum system identification#algorithmic complexityLindbladianPauli responseChebyshev‑Lobatto interpolationsample complexitylocal response inversion
Efficient Lindbladian Learning from Constant-Time Pauli Responses · wovepaper