Near-Optimal Learning of Local Lindbladians
quant-ph
Submitted: 2026-06-18
Updated: 2026-11-03
Comments: 49 pages, 3 algorithms. Accepted to SODA 2027
License: http://creativecommons.org/licenses/by/4.0/
The gist: We study the problem of learning local Lindbladians from black-box access to the physical evolution, where the goal is to estimate all Hamiltonian and dissipative coefficients.
Terminology
Abstract
We study the problem of learning local Lindbladians from black-box access to the physical evolution, where the goal is to estimate all Hamiltonian and dissipative coefficients. For local Lindbladians with low-intersection dissipators and local dynamical strength at most Λ, we design an algorithm that learns the coefficients to target accuracy epsilon, whose experiment count and total evolution time scale as (Λ 2/epsilon 2) and (Λ/epsilon 2), respectively, with only logarithmic dependence on the number of qubits. The algorithm is built directly from finite-time channel probes. It runs the unknown evolution for short times, estimates the corresponding Pauli transfer matrices from classical shadows, and converts these estimates into Lindbladian coefficients by stable local Fourier inversions. The algorithm is non-adaptive, uses no ancillas, and requires only random product states as inputs followed by random Pauli measurements. The method does not require knowing the structure of the Lindbladian in advance. We prove matching lower bounds that establish the near-optimality of the algorithm in both resources. By constructing a family of single-qubit dephasing Lindbladians, we show that any algorithm, even an adaptive one with arbitrary ancillas and measurements, requires Ω(Λ 2/epsilon 2) experiments and Ω(Λ/epsilon 2) total evolution time. In particular, the lower bounds imply that the Heisenberg-limited scaling achievable for Hamiltonian learning is information-theoretically impossible once dissipative coefficients must be estimated.
Sources
- Certifying and learning local quantum Hamiltonians
- Demonstrating and Benchmarking Classical Shadows for Lindblad Tomography
- Optimal detection of dissipation in Lindbladian dynamics
- Lower Bounds for Learning Hamiltonians from Time Evolution
- Learning Hamiltonians at Long Times
- Simple and efficient end-to-end quantum thermal and ground state preparation
- Scalable Bayesian Hamiltonian learning
- Learning and certification of local time-dependent quantum dynamics and noise
- Optimal classical shadow estimation of unitary channels at Heisenberg limit
- Ansatz-Free Learning of Lindbladian Dynamics In Situ
- Robust Lindbladian Estimation for Quantum Dynamics
- Learning the structure of open quantum systems
- Robust Structure Learning of k-local Lindbladians
- Efficiently learning non-Markovian noise in many-body quantum simulators
- Learning k-body Hamiltonians via compressed sensing
- Learning Arbitrary Lindbladians with Quantum Error Correction
- Fast-forwardable Lindbladians imply quantum phase estimation
- Efficient and SPAM-Robust Ansatz-Free Lindbladian Learning
- Heisenberg-limited Hamiltonian learning without short-time control
- Improved Hamiltonian learning and sparsity testing through Bell sampling
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements