arXiv:2610.03663
BARC codes: general polynomial framework for coherent-state superposition codes
Praneel Gore, Davit Aghamalyan, Varun Narasimhachar, Andrew Tanggara
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.
AI Summary
Can coherent-state bosonic codes be constructed systematically from their error-detection moment constraints, rather than a prescribed constellation geometry? This paper formulates shared constellation moments as real polynomial ideals, defining bosonic algebraically-restricted constellation (BARC) codes. The formulation allows weighted, multimode constellations; explicit constructions and benchmarks concern uniformly weighted, single-mode codes. Shared moments and multiple energy shells already occur in quantum cubature codes (QCCs); BARC is not presented as a disjoint class. The polynomial formulation is related to approximate Knill–Laflamme conditions by bounding neglected coherent-state overlaps, which decrease exponentially with squared constellation separation. Through degree two, the centered constraints fix a Gram matrix, and the complete solution set is an orbit of $O(\ell-1)$ acting on point coordinates. Symmetry-based constructions yield ellipsoidal and hexagonal families. A volume-packing argument gives $d_E\leq4R^2/(N^{1/(2n)}-1)^2$ for $N$ amplitudes in $n$ modes within radius $R$; common centered radial moments further bound $R$. Pure-loss benchmarks optimize recovery and select amplitudes on a finite grid at loss probability $\gamma_0=0.095$, then hold amplitudes fixed. Under the stated candidate photon-budget reference-selection rule, Hex3 and Elliptical Hex3 outperform selected equal-size spherical and cubature references throughout sampled $0.01\leq\gamma\leq0.5$; independently optimized comparisons show regime-dependent gains. Finite-degree moment matching does not establish exact finite-separation correction or a recovery-error bound for the full pure-loss channel. The examples do not use systematic polynomial root searches, and constellation-distance optimality is not established. Explicit multimode families, logical operations, preparation and syndrome-extraction schemes, and benchmarking beyond pure loss remain future work.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 96 pages