A 67%-Rate CSS Code on the FCC Lattice: [[192,130,3]] from Weight-12 Stabilizers

• URL: http://arxiv.org/abs/2603.20294v1
• Date: Thu, 19 Mar 2026 02:57:55 GMT
• Title: A 67%-Rate CSS Code on the FCC Lattice: [[192,130,3]] from Weight-12 Stabilizers
• Abstract summary: Face-Centered Cubic (FCC) lattice is a three-dimensional stabilizer code.<n>Code is 24x higher than the cubic 3D toric code.<n>Code yields encoding rates 67.7% and 67.0% respectively.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We construct a three-dimensional Calderbank-Shor-Steane (CSS) stabilizer code on the Face-Centered Cubic (FCC) lattice. Physical qubits reside on the edges of the lattice (coordination $K=12$); X-stabilizers act on octahedral voids and Z-stabilizers on vertices, both with uniform weight 12. Computational verification confirms CSS validity ($H_{X}H_{Z}^{T}=0$ over GF(2)) and reveals $k=2L^{3}+2$ logical qubits: $k=130$ at $L=4$ and $k=434$ at $L=6$, yielding encoding rates of 67.7% and 67.0% respectively. The minimum distance $d=3$ is proven exactly by exhaustive elimination of all weight-$\le 2$ candidates combined with constructive weight-3 non-stabilizer codewords. The code parameters are [[192, 130, 3]] at $L=4$ and [[648, 434, 3]] at $L=6$. This rate is 24x higher than the cubic 3D toric code (2.8% at $d=4$), though at a lower distance ($d=3$ vs. $d=4$); the comparison is across different distances. The high rate originates in a structural surplus: the FCC lattice has $3L^{3}$ edges but only $L^{3}-2$ independent stabilizer constraints, leaving $k=2L^{3}+2$ logical degrees of freedom. We provide a minimum-weight perfect matching (MWPM) decoder adapted to the FCC geometry, demonstrate a 10x coding gain at $p=0.001$ (and 63x at $p=0.0005$), and discuss implications for fault-tolerant quantum computing on neutral-atom and photonic platforms.

Related papers

• Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts [0.0]
  The code is a Calderbank-Shor-Steane (CSS) code with parameters $[34542,23032,dle 310]]$.<n>We do not regard this upper bound as an estimate of the true minimum distance; rather, $dle310$ is the tightest upper bound currently obtained from structural lifts and decoder-produced logical errors.
  arXiv  Detail & Related papers  (2026-06-25T15:08:16Z)
• Scaling Federated Linear Contextual Bandits via Sketching [49.12000877146222]
  This paper proposes Federated Sketch Contextual Linear Bandits (FSCLB)<n>Experiments on both synthetic and real-world datasets show that FSCLB significantly reduces computational and communication costs by over 90 %.
  arXiv  Detail & Related papers  (2026-05-01T08:22:06Z)
• High-Girth Regular Quantum LDPC Codes from Affine-Coset Structures [0.0]
  We construct a quantum low-density parity-check code family from a length-$512$ Calderbank-Shor--Steane base matrix pair.<n>The base pair is permutation-equivalent to the known SPC(3) product CSS code.
  arXiv  Detail & Related papers  (2026-04-22T17:59:08Z)
• Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition [50.36362492608702]
  We study entrywise scalar quantization of two matrices prior to multiplication.<n>We obtain a closed-form optimal point density [ star(u) propto exp!left(-fracu26right)bigl( (1-2)+2u22bigr), qquad u=fracx_X,, and prove a correlation-driven phase transition.
  arXiv  Detail & Related papers  (2026-03-20T01:53:44Z)
• Generalized $\mathbb{Z}_p$ toric codes as qudit low-density parity-check codes [5.692499671837265]
  We study two-dimensional translation-invariant CSS stabilizer codes over prime-dimensional qudits on the square lattice under twisted boundary conditions.<n>We find that the best observed $k d2$ at $n$ increases with $p$, with an empirical relation $k d2 = 0.0541, n2ln p + 3.84, n$, compatible with a Bravyi--Poulin--Terhal-type tradeoff when the interaction range grows with system size.
  arXiv  Detail & Related papers  (2026-02-23T18:59:31Z)
• Optimal Quantum $(r,δ)$-Locally Repairable Codes via Classical Ones [52.3857155901121]
  Local repairable codes (LRCs) play a crucial role in mitigating data loss in large-scale distributed and cloud storage systems.<n>This paper establishes a unified decomposition theorem for general optimal $(r,delta)$-LRCs.<n>We construct three infinite families of optimal quantum $(r,delta)$-LRCs with flexible parameters.
  arXiv  Detail & Related papers  (2025-07-24T08:21:20Z)
• Proving the Limited Scalability of Centralized Distributed Optimization via a New Lower Bound Construction [57.93371273485736]
  We consider a centralized distributed learning setup where all workers jointly find an unbiased bound LDeltaepsilon2,$ better poly-logarithmically in $n$, even in the homogeneous (i.i.d.) case, where all workers access the same distribution.
  arXiv  Detail & Related papers  (2025-06-30T13:27:39Z)
• Planar quantum low-density parity-check codes with open boundaries [7.741302957350027]
  We introduce the first systematic procedure to convert BB codes into fully planar, open-boundary qLDPC codes.<n>We present code families with logical dimensions $6 leq kleq13$, e.g., $[[78, 6, 6]]$, $[[107, 7, 7]]$, $[268, 8, 12]]$, $[405, 9, 15]]$, $[[348, 10, 13]]$, $[[450, 11, 15]]$, $[[386, 12, 12]]$, $[362, 13, 11]]$,
  arXiv  Detail & Related papers  (2025-04-11T18:00:05Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• The XYZ$^2$ hexagonal stabilizer code [0.0]
  The "XYZ$2$" code is a simple realization of a "matching code" discussed by Wootton. The code possesses distinctive syndrome properties with unidirectional pairs of plaquette defects along the three directions of the triangular lattice.
  arXiv  Detail & Related papers  (2021-12-11T17:47:16Z)
• Curse of Dimensionality on Randomized Smoothing for Certifiable Robustness [151.67113334248464]
  We show that extending the smoothing technique to defend against other attack models can be challenging. We present experimental results on CIFAR to validate our theory.
  arXiv  Detail & Related papers  (2020-02-08T22:02:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.