Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.35265

Gauge freedom and efficient algorithms for Lindbladian learning

Steven T Flammia, Savar D Sinha, Yu Tong

quant-phSubmitted Sep 28, 2026• Announced Sep 29, 2026• 3 citations
arXivHTMLPDF

Abstract

We study the problem of learning a local Lindbladian in the presence of state-preparation-and-measurement (SPAM) noise. Although recent work has developed scalable learning algorithms under idealized access assumptions, SPAM can make distinct Lindbladians experimentally indistinguishable, thus making part of the Lindbladian fundamentally unlearnable. We give a sharp characterization of this obstruction for bounded-degree local Lindbladians. We identify a family of locality-preserving gauge transformations that commutes with trusted single-qubit control, and use it to classify Lindbladian components. For the generically gauge dependent components, we construct Lindbladians to show that they can have $Ω(1)$ uncertainty independent of system size, even after imposing complete positivity. We complement this characterization with SPAM-robust algorithms for learning every universally gauge-invariant component. Our algorithms use only trusted single-qubit operations, require neither ancillas nor entangling control, and use $\widetilde{\mathcal O}\left(ε^{-2}\log(N/δ)\right)$ experiments and total evolution time for constant locality and degree. Our guarantees allow global SPAM to become arbitrarily far from ideal as $N$ grows, requiring only nonvanishing local visibility. We also establish sufficient conditions for boundary-induced gauge invariance of additional Hamiltonian coefficients under physical positivity constraints, though learning these additional parameters in general remains an open problem. More broadly, our gauge-aware framework and SPAM-cancellation techniques offer a practical toolkit for the scalable characterization of open quantum systems.

AI Summary

The paper asks which coefficients of a bounded-degree local Lindbladian remain identifiable under unknown state-preparation-and-measurement (SPAM) noise with trusted single-qubit control, and how efficiently they can be estimated. It assumes a known interaction-support pattern, bounded coefficients, fixed locality and degree, and nonvanishing local SPAM visibility; global SPAM need not approach ideal operations. Local depolarizing similarity transformations commute with the controls, preserve locality, and can be absorbed into SPAM. Analyzing their action in Pauli-transfer and $\chi$ representations identifies exactly three universally invariant classes: diagonal Kossakowski coefficients; $\Re\alpha_{ab}$ when the Pauli strings differ at one site with both factors nonidentity; and $\Im\alpha_{ab}$ when they differ at one site with exactly one identity, together with single-qubit Hamiltonian coefficients. Every other locally allowed component is gauge dependent on an open dense, full-measure subset of physical generators. Positivity-buffered constructions establish system-size-independent $\Omega(1)$ marginal ambiguities despite complete positivity. Protocols learn all universal invariants without ancillas or entangling control. Pauli twirling, local rotations, and SPAM-canceling decay ratios handle the first two classes; partial twirling isolates two-dimensional dynamical blocks for derivative estimation of the third. Experiment counts and total evolution time scale as $\widetilde O(\epsilon^{-2}\log(N/\delta))$; single-qubit gate counts scale as $\widetilde O(N\epsilon^{-3}\log(N/\delta))$, using finite-rate randomized pulses. Positivity also yields sufficient conditions for additional, instance-specific Hamiltonian invariance at boundary generators, but general learning protocols for these remain open. Other stated directions include learning invariant parameter combinations, robustness to imperfect trusted controls, and stability near physical boundaries.

Almost certainly largely AI-generatedAI use disclosedStrong assumptions
ChatGPT was used to polish and organize these notes into an initial manuscript draft. It was also used to draft the proofs

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Efficient and SPAM-Robust Ansatz-Free Lindbladian Learning

Savar D. Sinha

Describing the dynamics of open systems is essential for fault-tolerant quantum computation. Under Markovian assumptions, we can characterize dissipative dynamics via the Lindbladian. Using Bell sampling, we provide an efficient, ansatz-free Lindbladian learning algorithm with polynomial-time classical postprocessing. Motivated by the prevalence of state preparation and measurement (SPAM) noise on near-term devices, we also introduce the first efficient SPAM-robust protocol capable of learning the gauge-independent components of sparse Lindbladians to arbitrary precision in the presence of constant-order SPAM error. In doing so, we provide the first rigorous characterization of the gauge degrees of freedom in noisy Lindbladian learning, precisely identifying which components remain learnable under SPAM noise.

quant-pharXiv:2606.20706•Jun 17, 2026•8 citations

Near-Optimal Learning of Local Lindbladians

Itai Arad, Zhili Chen, Naixu Guo +2 more

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 $\varepsilon$, whose experiment count and total evolution time scale as $\widetilde{O}(Λ^2/\varepsilon^2)$ and $\widetilde{O}(Λ/\varepsilon^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/\varepsilon^2)$ experiments and $Ω(Λ/\varepsilon^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.

quant-pharXiv:2606.20535•Jun 19, 2026•14 citations

Characterizing Arbitrary Lindbladian Dynamics with a Few Pauli Measurements

Taiqi Zhou, Weiyuan Gong

Quantum devices are open systems whose dynamics interleave coherent evolution with dissipation, and benchmarking, error mitigation, and error correction all rest on a faithful model of both. Existing characterization protocols either assume prior knowledge of the interaction and noise structure, or demand ancillas, entangled probes, or mid-circuit control, or capture only the Pauli-diagonal part of the noise. Here, we present a protocol that reconstructs an arbitrary sparse Markovian generator, including every Hamiltonian together with the jump operator coefficients, using only product Pauli state preparation, single uninterrupted forward evolutions, and product Pauli measurements. Given a sparsity budget $M_0$ and a strength bound $Γ$ of the Lindbladian, every coefficient is learned to precision $ε$ from $\widetilde{O}(Γ^2M_0^2/ε^4)$ experiments and $\widetilde{O}(ΓM_0^2/ε^2)$ total evolution time, with both supports identified from data without locality assumptions. The protocol runs at a logarithmic number of positive evolution times on a hardware clock lattice and is provably robust to calibrated state-preparation and measurement errors.

quant-pharXiv:2607.23044•Jul 28, 2026•4 citations

Learning Arbitrary Lindbladians from Time Evolution

Zhili Chen, Zhan Yu

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 $\varepsilon$ using $\widetilde O(Λ^2/\varepsilon^2)$ experiments and $\widetilde O(Λ/\varepsilon^2)$ total evolution time, with classical running time polynomial in $n$ and $Λ/\varepsilon$. 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 $Λ_{\mathrm{loc}}$ using $\widetilde O(n^2Λ_{\mathrm{loc}}^2/\varepsilon^2)$ experiments and $\widetilde O(nΛ_{\mathrm{loc}}/\varepsilon^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 \geq 3$.

quant-pharXiv:2607.28610•Jul 31, 2026•5 citations

SPAM-robust learnability of quantum dynamics

Zitai Xu, Guoding Liu, Senrui Chen

Accurate characterization of quantum dynamics is essential for the calibration and control of quantum devices. Unknown state preparation and measurement (SPAM) errors, however, introduce gauge ambiguities that limit what can be learned. A central question is therefore which properties are learnable despite SPAM errors, and whether physical structure in the dynamics can restrict these ambiguities and expand the set of learnable properties. In this work, we address both questions within a unified framework for quantum channels and continuous-time evolution. First, for general quantum channels and Lindbladian dynamics, we use the cycle structure of a generalized pattern-transfer graph to fully characterize all learnable parameter combinations and show achievability by constructing explicit SPAM-robust learning protocols, establishing a baseline where continuous gauge freedom prevents many individual parameters from being identified. Second, we show that coherent structure drastically restricts this gauge ambiguity, reducing continuous gauge freedom to discrete or even trivial choices. This restriction manifests across both discrete- and continuous-time settings, including purely Hamiltonian evolution, noisy quantum channels close to a target unitary, and Lindbladian dynamics close to a target Hamiltonian. In particular, when the dynamics preserves or remains close to a coherent Hamiltonian form, all coherent coefficients and broad classes of dissipative error parameters become individually learnable. These results establish a systematic route to exploiting physical structure for SPAM-robust characterization, providing a foundation for the reliable calibration and control of quantum devices.

arXiv:2611.05561•Nov 3, 2026•0 citations

Efficient Lindbladian Learning from Constant-Time Pauli Responses

Jiaxing Song, Yukun Zhang, Xiao Yuan +1 more

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 $M$, 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 $M$ candidate coefficients to entrywise accuracy $ε$ using $\widetilde{\mathcal{O}}(M/ε^2)$ 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.

quant-pharXiv:2607.25795•Jul 29, 2026•2 citations
We study the problem of learning a local Lindbladian in the presence of state-preparation-and-measurement (SPAM) noise. Although recent work has developed scalable learning algorithms under idealized access assumptions, SPAM can make distinct Lindbladians experimentally indistinguishable, thus making part of the Lindbladian fundamentally unlearnable. We give a sharp characterization of this obstruction for bounded-degree local Lindbladians. We identify a family of locality-preserving gauge transformations that commutes with trusted single-qubit control, and use it to classify Lindbladian components. For the generically gauge dependent components, we construct Lindbladians to show that they can have Ω(1)Ω(1)Ω(1) uncertainty independent of system size, even after imposing complete positivity.
We complement this characterization with SPAM-robust algorithms for learning every universally gauge-invariant component. Our algorithms use only trusted single-qubit operations, require neither ancillas nor entangling control, and use O~(ε−2log⁡(N/δ))\widetilde{\mathcal O}\left(ε^{-2}\log(N/δ)\right)O(ε−2log(N/δ)) experiments and total evolution time for constant locality and degree. Our guarantees allow global SPAM to become arbitrarily far from ideal as NNN grows, requiring only nonvanishing local visibility. We also establish sufficient conditions for boundary-induced gauge invariance of additional Hamiltonian coefficients under physical positivity constraints, though learning these additional parameters in general remains an open problem. More broadly, our gauge-aware framework and SPAM-cancellation techniques offer a practical toolkit for the scalable characterization of open quantum systems.
The paper asks which coefficients of a bounded-degree local Lindbladian remain identifiable under unknown state-preparation-and-measurement (SPAM) noise with trusted single-qubit control, and how efficiently they can be estimated. It assumes a known interaction-support pattern, bounded coefficients, fixed locality and degree, and nonvanishing local SPAM visibility; global SPAM need not approach ideal operations.
Local depolarizing similarity transformations commute with the controls, preserve locality, and can be absorbed into SPAM. Analyzing their action in Pauli-transfer and χ\chiχ representations identifies exactly three universally invariant classes: diagonal Kossakowski coefficients; ℜαab\Re\alpha_{ab}ℜαab​ when the Pauli strings differ at one site with both factors nonidentity; and ℑαab\Im\alpha_{ab}ℑαab​ when they differ at one site with exactly one identity, together with single-qubit Hamiltonian coefficients. Every other locally allowed component is gauge dependent on an open dense, full-measure subset of physical generators. Positivity-buffered constructions establish system-size-independent Ω(1)\Omega(1)Ω(1) marginal ambiguities despite complete positivity.
Protocols learn all universal invariants without ancillas or entangling control. Pauli twirling, local rotations, and SPAM-canceling decay ratios handle the first two classes; partial twirling isolates two-dimensional dynamical blocks for derivative estimation of the third. Experiment counts and total evolution time scale as O~(ϵ−2log⁡(N/δ))\widetilde O(\epsilon^{-2}\log(N/\delta))O(ϵ−2log(N/δ)); single-qubit gate counts scale as O~(Nϵ−3log⁡(N/δ))\widetilde O(N\epsilon^{-3}\log(N/\delta))O(Nϵ−3log(N/δ)), using finite-rate randomized pulses.
Positivity also yields sufficient conditions for additional, instance-specific Hamiltonian invariance at boundary generators, but general learning protocols for these remain open. Other stated directions include learning invariant parameter combinations, robustness to imperfect trusted controls, and stability near physical boundaries.
Describing the dynamics of open systems is essential for fault-tolerant quantum computation. Under Markovian assumptions, we can characterize dissipative dynamics via the Lindbladian. Using Bell sampling, we provide an efficient, ansatz-free Lindbladian learning algorithm with polynomial-time classical postprocessing. Motivated by the prevalence of state preparation and measurement (SPAM) noise on near-term devices, we also introduce the first efficient SPAM-robust protocol capable of learning the gauge-independent components of sparse Lindbladians to arbitrary precision in the presence of constant-order SPAM error. In doing so, we provide the first rigorous characterization of the gauge degrees of freedom in noisy Lindbladian learning, precisely identifying which components remain learnable under SPAM noise.
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 ε\varepsilonε, whose experiment count and total evolution time scale as O~(Λ2/ε2)\widetilde{O}(Λ^2/\varepsilon^2)O(Λ2/ε2) and O~(Λ/ε2)\widetilde{O}(Λ/\varepsilon^2)O(Λ/ε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/ε2)Ω(Λ^2/\varepsilon^2)Ω(Λ2/ε2) experiments and Ω(Λ/ε2)Ω(Λ/\varepsilon^2)Ω(Λ/ε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.
Quantum devices are open systems whose dynamics interleave coherent evolution with dissipation, and benchmarking, error mitigation, and error correction all rest on a faithful model of both. Existing characterization protocols either assume prior knowledge of the interaction and noise structure, or demand ancillas, entangled probes, or mid-circuit control, or capture only the Pauli-diagonal part of the noise. Here, we present a protocol that reconstructs an arbitrary sparse Markovian generator, including every Hamiltonian together with the jump operator coefficients, using only product Pauli state preparation, single uninterrupted forward evolutions, and product Pauli measurements. Given a sparsity budget M0M_0M0​ and a strength bound ΓΓΓ of the Lindbladian, every coefficient is learned to precision εεε from O~(Γ2M02/ε4)\widetilde{O}(Γ^2M_0^2/ε^4)O(Γ2M02​/ε4) experiments and O~(ΓM02/ε2)\widetilde{O}(ΓM_0^2/ε^2)O(ΓM02​/ε2) total evolution time, with both supports identified from data without locality assumptions. The protocol runs at a logarithmic number of positive evolution times on a hardware clock lattice and is provably robust to calibrated state-preparation and measurement errors.
We study the problem of learning arbitrary nnn-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 nnn-qubit Lindbladian of dynamical strength at most ΛΛΛ, the algorithm estimates every coefficient to error ε\varepsilonε using O~(Λ2/ε2)\widetilde O(Λ^2/\varepsilon^2)O(Λ2/ε2) experiments and O~(Λ/ε2)\widetilde O(Λ/\varepsilon^2)O(Λ/ε2) total evolution time, with classical running time polynomial in nnn and Λ/εΛ/\varepsilonΛ/ε. 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 kkk, our algorithm learns generic kkk-local Lindbladians of local dynamical strength at most ΛlocΛ_{\mathrm{loc}}Λloc​ using O~(n2Λloc2/ε2)\widetilde O(n^2Λ_{\mathrm{loc}}^2/\varepsilon^2)O(n2Λloc2​/ε2) experiments and O~(nΛloc/ε2)\widetilde O(nΛ_{\mathrm{loc}}/\varepsilon^2)O(nΛloc​/ε2) total evolution time, improving the upper bounds of prior works in terms of the dependence on nnn. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of 333-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≥3k \geq 3k≥3.
Accurate characterization of quantum dynamics is essential for the calibration and control of quantum devices. Unknown state preparation and measurement (SPAM) errors, however, introduce gauge ambiguities that limit what can be learned. A central question is therefore which properties are learnable despite SPAM errors, and whether physical structure in the dynamics can restrict these ambiguities and expand the set of learnable properties. In this work, we address both questions within a unified framework for quantum channels and continuous-time evolution. First, for general quantum channels and Lindbladian dynamics, we use the cycle structure of a generalized pattern-transfer graph to fully characterize all learnable parameter combinations and show achievability by constructing explicit SPAM-robust learning protocols, establishing a baseline where continuous gauge freedom prevents many individual parameters from being identified. Second, we show that coherent structure drastically restricts this gauge ambiguity, reducing continuous gauge freedom to discrete or even trivial choices. This restriction manifests across both discrete- and continuous-time settings, including purely Hamiltonian evolution, noisy quantum channels close to a target unitary, and Lindbladian dynamics close to a target Hamiltonian. In particular, when the dynamics preserves or remains close to a coherent Hamiltonian form, all coherent coefficients and broad classes of dissipative error parameters become individually learnable. These results establish a systematic route to exploiting physical structure for SPAM-robust characterization, providing a foundation for the reliable calibration and control of quantum devices.
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 MMM, 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 MMM candidate coefficients to entrywise accuracy εεε using O~(M/ε2)\widetilde{\mathcal{O}}(M/ε^2)O(M/ε2) 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.