Metraipolis › archive › dc_e5fa1762873d
Learning unknown stabilizer codes using product measurements — arXiv:2609.04997
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.04997
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T00:01:39.656Z
- SHA-256 of the archived text
2cb30b7c1577e8682dc1bbea919b7b401b547799512716aa39c7950879c79d78- Stable URL of this page
https://metraipolis.com/documento/dc_e5fa1762873d
How to cite
Learning unknown stabilizer codes using product measurements — arXiv:2609.04997 — arXiv (en), https://arxiv.org/abs/2609.04997 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e5fa1762873d (Metraipolis archive dc_e5fa1762873d, sha256 2cb30b7c1577e8682dc1bbea919b7b401b547799512716aa39c7950879c79d78)
BibTeX
@misc{dce5fa1762873d,
title = {Learning unknown stabilizer codes using product measurements — arXiv:2609.04997},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.04997},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e5fa1762873d; sha256 2cb30b7c1577e8682dc1bbea919b7b401b547799512716aa39c7950879c79d78},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04997. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Efficiently characterizing quantum error correcting codes is a key challenge on the path to fault-tolerant quantum computation. Stabilizer codes, a central class of such codes, are defined by a set of stabilizer generators. Here, we present an algorithm that uses random single-qubit measurements to learn the stabilizer generators of any stabilizer code from $N$ copies of stabilizer states in its codespace, requiring no prior knowledge of the code's structure. This also enables verification that a device implements its intended code. We derive a lower bound on $N$ needed to recover the stabilizer generators with high probability, together with a bound on the algorithm's overall probability of success. When applied to quantum low-density parity-check (qLDPC) codes, a leading candidate for practical fault-tolerant architectures, our approach requires a number of states that scales polylogarithmically with $n$, the number of qubits. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-07 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.04997 — 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-16T23:41:14.309Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).