Metraipolis › archive › dc_8bcaa1b054db

Gauge freedom and efficient algorithms for Lindbladian learning — arXiv:2609.35265

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.35265
License (as archived)
CC0-1.0
Archived
2026-10-08T00:45:31.793Z
SHA-256 of the archived text
2c298a6b4a6686c9d167c5f1a1ce476f3c91cc7d3db539f6e50e2a8bf81b5443
Stable URL of this page
https://metraipolis.com/documento/dc_8bcaa1b054db

How to cite

Gauge freedom and efficient algorithms for Lindbladian learning — arXiv:2609.35265 — arXiv (en), https://arxiv.org/abs/2609.35265 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8bcaa1b054db (Metraipolis archive dc_8bcaa1b054db, sha256 2c298a6b4a6686c9d167c5f1a1ce476f3c91cc7d3db539f6e50e2a8bf81b5443)
BibTeX
@misc{dc8bcaa1b054db,
  title = {Gauge freedom and efficient algorithms for Lindbladian learning — arXiv:2609.35265},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.35265},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8bcaa1b054db; sha256 2c298a6b4a6686c9d167c5f1a1ce476f3c91cc7d3db539f6e50e2a8bf81b5443},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.35265. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\Omega(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(\epsilon^{-2}\log(N/\delta)\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.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-29 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.35265 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T00:19:23.491Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).