Papers
Topics
Authors
Recent
Search
2000 character limit reached

Robust Structure Learning of kk-local Lindbladians

Published 22 Jun 2026 in quant-ph, cs.IT, math.NA, and math.ST | (2606.23652v1)

Abstract: We present an efficient protocol for learning an unknown kk-local Lindblad generator on nn qubits using only product-state preparations, short-time evolution, and single-qubit Pauli measurements, without prior knowledge of the interaction structure. For fixed kk and bounded weighted interaction strength, the protocol estimates all Hamiltonian and dissipative Pauli--GKSL coefficients to entrywise accuracy ε\varepsilon with probability at least $1-δ$ using O~k(ε<sup>2n<sup>2klog(1/δ))\widetilde{\mathcal O}_k(\varepsilon<sup>{-2}n<sup>{2k}\log(1/δ)) samples and polylogarithmically many evolution times. A semidefinite projection converts these estimates into a valid kk-local Lindblad generator with diamond-norm error at most ε\varepsilon using O~k(ε<sup>2n<sup>4klog(1/δ))\widetilde{\mathcal O}_k(\varepsilon<sup>{-2}n<sup>{4k}\log(1/δ)) samples and polynomial-time classical postprocessing. If a suitable set of influential coefficients is supplied and satisfies a stable sparsity condition, the dependence on nn can improve from polynomial to logarithmic; in particular, exact supports of bounded intersection degree require only O~k(ε<sup>2log(n/δ))\widetilde{\mathcal O}_k(\varepsilon<sup>{-2}\log(n/δ)) samples, with analogous reductions in system-size dependence for sufficiently decaying long-range interactions. We also provide a robust structure-learning procedure, extend the guarantees to model misspecification, and prove complementary sample-complexity lower bounds. To our knowledge, these are the first efficient learning guarantees for general kk-local dissipative quantum dynamics under such limited experimental control.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.