arXiv:2610.00561
Optimal two-mode bosonic loss codes from finite group symmetry
Argyris Giannisis Manes, Mahadevan Subramanian, Liang Jiang
Abstract
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.
AI Summary
The paper studies qubit codes in the fixed-total-photon-number subspace of two bosonic modes, asking how efficiently they can correct symmetric photon loss and whether finite-group symmetry characterizes optimized encodings. Loss distance $d$ means correction of up to $d-1$ lost photons. Alternating semidefinite optimization over encoders and recoveries for $4\leq n\leq25$ finds approximate finite-subgroup-of-$SU(2)$ structure in every best-found code: 11 carry irreducible two-dimensional representations and 11 carry reducible representations. A loss–spin correspondence identifies the correction conditions with detection of spin tensors through rank $d-1$. General finite-group-invariant Knill–Laflamme conditions are then reduced to multiplicity-space equations, with explicit orbit-generating operators attaining the minimum seed count at each tensor rank. These tools yield analytic constructions and codes missed by the initial search. MacWilliams linear programs with exact Farkas certificates establish distance optimality in 21 of the 22 scanned sectors; at $n=18$, the construction has $d=4$ while the bound permits $d=5$. Binary-polyhedral constructions attain $n_d=\lceil(3d^2+1)/4\rceil$ through $d=10$, including reported photon-number improvements at $(n,d)=(28,6),(49,8),(76,10)$. LP feasibility is proved monotone in $n$. The optimization does not certify global fidelity optimality. Existence of the proposed family at all distances, and its minimum-photon-number optimality, remain conjectural. Fixed-$n$ distance optimality does not establish photon-number minimality: the LP already permits distances 6 and 8 at $n=26$ and 43, respectively. The distance-10 construction also lies below its fixed-$n$ LP bound.
also assisted with analyzing numerical optimization results, generating figures, writing parts of our code, workshopping proofs, and preparing the manuscript, including minor arguments and expository revisions.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 7-page Letter and 65-page Supplemental Material; 3 main figures and 28 supplementary figures