Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 20 min ago
PreprintCC BY 4.0arXiv

Gauge freedom and efficient algorithms for Lindbladian learning

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 𝒪̃(ε−2log(N/δ)) 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.

Related

  1. Query-Optimal and Gate-Efficient Lindbladian Simulation
    Boyang Chen, Minbo Gao, Xinzhao Wang +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Physics-informed quantum algorithms for glueball-like excitations in a ℤ2 lattice gauge theory
    Dan-Bo Zhang
    arXivPreprintCC BY 4.0Full textHigh-energy & particle physicsQuantum physics & quantum informationarXiv
  3. Efficient Quantum Simulations of Yang-Mills theory with Maximal-tree Gauge
    Tianyin Li, Ying-Ying Li, Xiaoyang Wang +1
    arXivPreprintCC BY 4.0Full textHigh-energy & particle physicsQuantum physics & quantum informationarXiv
  4. Mixed-precision GPU algorithms for efficient turbulent flow simulations with Raviart-Thomas finite elements
    Ivan Prusak, Enes Mustafa Soydan, Ivan Pribec +1
    arXivPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingFluid dynamicsarXiv
  5. Convex optimization on moment polytopes: Hadamard mirror descent and efficient algorithms for quantum functionals and other tensor parameters
    Mahmut Levent Doğan, Keiya Sakabe, Michael Walter
    arXivPreprintCC BY 4.0Full textMathematical physicsOptimisation & controlarXiv
BibTeX
@misc{flammia2026gauge,
  title = {{Gauge freedom and efficient algorithms for Lindbladian learning}},
  author = {Steven T Flammia and Savar D Sinha and Yu Tong},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.35265},
  eprint = {2609.35265},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.35265},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Gauge freedom and efficient algorithms for Lindbladian learning
AU  - Steven T Flammia
AU  - Savar D Sinha
AU  - Yu Tong
PY  - 2026
DA  - 2026/09/28
PB  - arXiv
DO  - 10.48550/arxiv.2609.35265
UR  - https://arxiv.org/abs/2609.35265
AB  - 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 𝒪̃(ε^−2log(N/δ)) 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.
ER  -