Metraipolis › archive › dc_5874873cef64

Optimal two-mode bosonic loss codes from finite group symmetry — arXiv:2610.00561

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.00561
License (as archived)
CC0-1.0
Archived
2026-10-07T11:37:19.573Z
SHA-256 of the archived text
f899da96cf2946a0223f04fc7b45acad8175ae335d81d9cfd62062f748f86f52
Stable URL of this page
https://metraipolis.com/documento/dc_5874873cef64

How to cite

Optimal two-mode bosonic loss codes from finite group symmetry — arXiv:2610.00561 — arXiv (en), https://arxiv.org/abs/2610.00561 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5874873cef64 (Metraipolis archive dc_5874873cef64, sha256 f899da96cf2946a0223f04fc7b45acad8175ae335d81d9cfd62062f748f86f52)
BibTeX
@misc{dc5874873cef64,
  title = {Optimal two-mode bosonic loss codes from finite group symmetry — arXiv:2610.00561},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.00561},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5874873cef64; sha256 f899da96cf2946a0223f04fc7b45acad8175ae335d81d9cfd62062f748f86f52},
  year = {2026}
}

Archived text

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

Photon loss is a dominant noise process in bosonic quantum hardware, including superconducting cavities. Fixed-total-photon-number qubit encodings in two bosonic modes retain the loss-detection advantage of dual-rail qubits while supporting photon loss correction. Optimizing entanglement fidelity in this setting for $4\leq n\leq25$ over arbitrary encoders and decoders reveals finite-group structure in every best-found code: 11 correspond to two-dimensional irreducible representations and 11 to reducible ones. Motivated by this emergence, we derive the necessary-and-sufficient Knill-Laflamme conditions for arbitrary finite-group-invariant codes, reducing their construction to equations on representation multiplicity spaces. For every finite subgroup of $SU(2)$ and every tensor rank, we explicitly construct the minimum number of operators required to impose all corresponding loss-correction constraints. These results produce analytic counterparts to most numerical codes and predict constructions missed by the initial search. Exact MacWilliams-Farkas certificates show that our codes achieve the maximum possible loss distance in 21 of the 22 sectors, and we prove that the resulting distance bound is monotone in total photon number. Beyond the scan, we identify a binary-polyhedral sequence with photon number $n_d=\lceil(3d^2+1)/4\rceil$ and construct each corresponding code through distance $d=10$. To our knowledge, the constructed $(n,d)=(28,6),(49,8),(76,10)$ codes give the smallest reported $n$ for their respective distances; all members through $d=9$ attain the fixed-$n$ LP distance bound. Together, these constructions, certificates, and a symmetry-reduced constraint count provide evidence for an infinite code family conjectured to attain every distance at the minimum photon number.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-02 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.00561 — 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-07T11:19:01.644Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).