Learning Arbitrary Lindbladians from Time Evolution
quant-ph, cs.DS
Submitted: 2026-07-30
Updated: 2026-11-03
Comments: 57 pages; lower bounds added in v2
License: http://creativecommons.org/licenses/by/4.0/
The gist: We study the problem of learning arbitrary n-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution.
Terminology
Abstract
We study the problem of learning arbitrary n-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution. We give the first known efficient algorithm that learns arbitrary Lindbladians without any structural assumptions. For an n-qubit Lindbladian of dynamical strength at most Λ, the algorithm estimates every coefficient to error epsilon using O(Λ 2/epsilon 2) experiments and O(Λ/epsilon 2) total evolution time, with classical running time polynomial in n and Λ/epsilon. Both experimental costs match known lower bounds up to polylogarithmic factors. The algorithm identifies candidate labels through product Pauli experiments and estimates their coefficients using random stabilizer preparations and Clifford measurements. It requires no ancillas or control during the unknown evolution. For constant k, our algorithm learns generic k-local Lindbladians of local dynamical strength at most Λ loc using O(n 2Λ loc 2/epsilon 2) experiments and O(nΛ loc/epsilon 2) total evolution time, improving the upper bounds of prior works in terms of the dependence on n. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of 3-local Lindbladians. They already hold when the support is known, and only one Hamiltonian coefficient is requested, even for adaptive protocols with arbitrary ancillas and quantum memory. These lower bounds establish that our algorithm is optimal up to polylogarithmic factors in both experiment count and total evolution time for every fixed k at least 3.
Sources
- Near-Optimal Learning of Local Lindbladians
- Quantum memory advantage for quantum process tomography
- Demonstrating and Benchmarking Classical Shadows for Lindblad Tomography
- An efficient and exact noncommutative quantum Gibbs sampler
- Quantum advantages for Pauli channel estimation
- 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
- Qubit stabilizer states are complex projective 3-designs
- Classical Shadows for Quantum Process Tomography on Near-term Quantum Computers
- 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
- 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