BARC codes: general polynomial framework for coherent-state superposition codes
Abstract
We introduce an algebraic framework for constructing a new class of quantum error-correcting codes, bosonic algebraically-restricted constellation (BARC) codes. The code states are finite superpositions of coherent-state constellations constrained by symmetries of solution sets to multivariate complex polynomial systems. The constraints are associated with photon-gain and photon-loss errors, thereby imposing approximate Knill--Laflamme conditions for such errors. For equally-weighted constellation points, we derive upper bounds on the minimum geometric separation between points, indicating how noise-resilient the code is. In the single-mode case, we characterize degree-two polynomial solution sets using an orthogonal group symmetry to obtain explicit ellipsoidal and hexagonal BARC codes. We benchmark representative instances of these families against spherical and cubature codes using the entanglement fidelity with optimal recovery under pure-loss noise.
Related
- Power-resolved ergotropy and correlation redistribution in a bosonic quantum battery driven by a coherent-state superposition
- From Syndromes to Computation: A General Framework for Logical Operations in Quantum Error-Correcting Codes
- Classical simulation of coherent crosstalk in surface codes
- Fault-tolerant quantum error correction for constant-excitation stabilizer codes under coherent noise
- Conserved and relaxing modes enable polynomial-success coherent Carleman lattice Boltzmann evolution
BibTeX
@misc{gore2026barc,
title = {{BARC codes: general polynomial framework for coherent-state superposition codes}},
author = {Praneel Gore and Davit Aghamalyan and Varun Narasimhachar and Andrew Tanggara},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.03663},
eprint = {2610.03663},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.03663},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - BARC codes: general polynomial framework for coherent-state superposition codes
AU - Praneel Gore
AU - Davit Aghamalyan
AU - Varun Narasimhachar
AU - Andrew Tanggara
PY - 2026
DA - 2026/10/02
PB - arXiv
DO - 10.48550/arxiv.2610.03663
UR - https://arxiv.org/abs/2610.03663
AB - We introduce an algebraic framework for constructing a new class of quantum error-correcting codes, bosonic algebraically-restricted constellation (BARC) codes. The code states are finite superpositions of coherent-state constellations constrained by symmetries of solution sets to multivariate complex polynomial systems. The constraints are associated with photon-gain and photon-loss errors, thereby imposing approximate Knill--Laflamme conditions for such errors. For equally-weighted constellation points, we derive upper bounds on the minimum geometric separation between points, indicating how noise-resilient the code is. In the single-mode case, we characterize degree-two polynomial solution sets using an orthogonal group symmetry to obtain explicit ellipsoidal and hexagonal BARC codes. We benchmark representative instances of these families against spherical and cubature codes using the entanglement fidelity with optimal recovery under pure-loss noise.
ER -