ExplorerQuantum ComputingQuantum Physics
Research PaperResearchia:202606.23016

Robust Structure Learning of $k$-local Lindbladians

Tim Möbus

Abstract

We present an efficient protocol for learning an unknown $k$-local Lindblad generator on $n$ qubits using only product-state preparations, short-time evolution, and single-qubit Pauli measurements, without prior knowledge of the interaction structure. For fixed $k$ 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 $\widetilde{\mathcal O}_k(\varepsilon...

Submitted: June 23, 2026Subjects: Quantum Physics; Quantum Computing

Description / Details

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δ1-δ using O~k(ε2n2klog(1/δ))\widetilde{\mathcal O}_k(\varepsilon^{-2}n^{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(ε2n4klog(1/δ))\widetilde{\mathcal O}_k(\varepsilon^{-2}n^{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(ε2log(n/δ))\widetilde{\mathcal O}_k(\varepsilon^{-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.


Source: arXiv:2606.23652v1 - http://arxiv.org/abs/2606.23652v1 PDF: https://arxiv.org/pdf/2606.23652v1 Original Link: http://arxiv.org/abs/2606.23652v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Jun 23, 2026
Topic:
Quantum Computing
Area:
Quantum Physics
Comments:
0
Bookmark