Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

From the FCC Lattice Code to the Proton-Electron Mass Ratio

Raghu Kulkarni

Published Mar 26, 2026• 0 citations
Publisher

Abstract

The [[192, 130, 3]] CSS code on the Face-Centered Cubic (FCC) lattice has weight- 3 logical operators at tetrahedral voids. We show that the QCD baryon Y-junction three color ux tubes meeting at a pointis realized as an interstitial defect at these voids: one quark per orthogonal sheet of the triad decomposition, junction at the interstitial node, color singlet realized as the weight-3 logical acting on the three bounding edges. The code's coupling matrix B ∈ {0, 1}36×51 has fault-tolerant syndrome extraction cost dim(B) = 36 ×51 = 1836. By Landauer's principle, specifying 1836 bits requires energy 1836 ×kT ln 2; by E= mc2, this energy is mass. In a vacuum with no independent storage mediumwhere the code state is the vacuumthe information content of the baryon is its mass: mp/me = 1836, matching experiment to 0.008%.

DOI
10.5281/zenodo.19230981

Related papers

Tunable Distance Quantum Error Correction at 29 Percent Encoding Rate of the Face Centered Cubic Lattice

Raghu Kulkarni

Abstract The [[3𝐿 3 , 2𝐿 3 +2, 3]] CSS code on the Face-Centered Cubic (FCC) lattice achieves 67.7% encoding rate with weight-12 stabilizers, but its distance is capped at 𝑑 = 3 by weight-3 logical operators sitting at tetrahedral interstitial voids. These logicals carry a geometric fingerprint—one error per triad sheet, all three converging at a known void—that makes them detectable by a flag ancilla measuring the three-body parity 𝑍 𝑒𝑎 𝑍 𝑒𝑏 𝑍 𝑒𝑐 . The weight-3 logical flips this parity from +1 to −1; the stabilizer syndrome stays silent, but the flag sees it. Running 𝑅 independent flag rounds per syndrome cycle pushes the logical failure rate to 𝑝 3+𝑅 , so the effective distance is simply 𝑑eff = 3+𝑅—adjustable at runtime, with no changes to the code or its logical count. At 𝑅 = 4 the FCC+flags code achieves the same 𝑝 7 distance scaling as a distance-7 surface code, with a prefactor 𝑁void = 256 versus ∼ 10 for the surface code—the cost of encoding 130 logical qubits at 29.0% rate versus 1 logical qubit at 1.0%. An adaptive scheduling protocol cuts the flag overhead to under 0.1% of measurement cycles at realistic noise levels.

•May 15, 2026•0 citations

A Self-Correcting Discrete Vacuum: Baryon Conservation and Color, from an Emergent Qutrit to Dynamical su(3), on One FCC Code

Raghu Kulkarni

A single stabilizer code on a face-centered-cubic (FCC) vacuum, with a quark a node trapped in a tetrahedral void, protects both the conserved quantities of baryonic matter and its color, and we develop both sectors at one standard of rigor, every quantitative claim reproduced by an accompanying script. The [[192,130,3]] CSS code with weight-twelve vertex and octahedral-void stabilizers is the common origin. In the external sector it makes the defect's winding charge a Gauss-law super-selection invariant, yielding the baryon ladder Δ⁻, n, p, Δ⁺⁺ with charges Q = −1 + W; the void orientation, by contrast, is not protected (a negative result we record); the migrating defect obeys E = γE_rest; and migration is a code-corrected string. In the internal sector the same code protects color. A color qutrit emerges as the symmetric sector of the cage kinetic term T = (J₃ − I₃) ⊗ J₂; the three skew-pair matchings carry an S₃ Weyl symmetry and a rank-two torus, and among the rank-two simple Lie algebras both the Weyl order and the existence of a three-dimensional representation independently select A₂ ≅ su(3); anchor-induced color/dark leakage is a weight-one correctable error. The FCC complex is then gauge-ready — its minimal plaquettes are triangles, each carrying one bond of every color — and supports a genuine ℤ₃ triality code, whose vertex Gauss law enforces q₀ + q₁ + q₂ ≡ 0 (mod 3) and which subsumes the octahedral baryon operator, so one code carries both sectors at the triality level; the non-abelian SU(3) Gauss law at a vertex has a 513-dimensional gauge-invariant space gated by triality, and the triangular plaquette Hamiltonian is gauge-invariant, so a Kogut–Susskind theory is well-posed. Building the color connection from the vacuum's processes gives a two-part dynamical result: the spatial channels transport color only diagonally, an N(T) = T ⋊ S₃ connection short of SU(3) by the root generators because the colors are bond-disjoint; but the temporal link, the cage time evolution with off-diagonal generator J₃ − I₃, supplies the missing direction and with the torus closes the full eight-dimensional su(3). Leading strong-coupling confinement holds on the triangular plaquettes with a positive string tension, and the single-plaquette spectrum has the correct 4/3 mass gap. The color algebra, both protected sectors, and the well-posed gauge theory are thus attained on one code; the continuum dynamics — confinement in the continuum limit, the running coupling, Λ_QCD — are not addressed and remain open.

•Jan 24, 2026•0 citations

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

Raghu Kulkarni

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.

quant-pharXiv:2603.20294•Mar 20, 2026•5 citations

Flag-Assisted Error Correction on the FCC Lattice: Tunable Distance at Constant Rate

Raghu Kulkarni

The [[3L3, 2L3+2, 3]] CSS code on the Face-Centered Cubic (FCC) lattice achieves 67.7% encoding rate with weight-12 stabilizers, but its distance is capped at d = 3 by weight-3 logical operators sitting at tetrahedral interstitial voids. These logicals carry a geometric 􏰂ngerprint􏰀one error per triad sheet, all three converging at a known void􏰀that makes them detectable by a 􏰃ag ancilla measuring the three-body parity Zea Zeb Zec . The weight-3 logical 􏰃ips this parity from +1 to −1; the stabilizer syndrome stays silent, but the 􏰃ag sees it. Running R independent 􏰃ag rounds per syndrome cycle pushes the logical failure rate to p3+R, so the e􏰁ective distance is simply deff = 3 + R􏰀adjustable at runtime, with no changes to the code or its logical count. At R = 4 the FCC+􏰃ags code suppresses errors as well as a distance-7 surface code, while encoding 130 logical qubits at 29.0% rate versus 1 logical qubit at 1.0%. An adaptive scheduling protocol cuts the 􏰃ag overhead to under 0.1% of measurement cycles at realistic noise levels.

•Mar 24, 2026•1 citation

Three Sheets, One Architecture: Inter-Sheet Logical Gates for K=4 Quantum Error Correction

Raghu Kulkarni

Abstract We present a CSS quantum error correcting code on the Face-Centered Cubic (FCC) lattice that combines surface-code-compatible K=4 connectivity with native inter-sheet logical gates between co-located CSS code blocks — a combination not previously achieved among well-studied codes. The construction has two parts. First, restricting the [[3L³, 2L³+2, 3]] FCC lattice code to a single triad sheet yields the sheet code with parameters [[L³, 2L, L]] at even L (or [[L³, L, L]] as a planar variant), uniform weight-4 stabilizers, and K=4 per-qubit connectivity. Three triad sheets share the FCC lattice geometry and can be deployed in one of three ways — monolithic 2D for small L, a three-layer stacked architecture for scalable deployment, or native 3D hardware — in each case encoding 6L logical qubits at distance L. Second, we introduce a fault-tolerant lattice surgery protocol that uses local FCC triangle measurements to implement joint Pauli measurements between logical qubits in different sheets. Each surgery operation adds O(L) two-qubit gates to the O(L³) per-round syndrome extraction cost. Under circuit-level depolarizing noise with MWPM decoding, the static memory threshold is p_th ≈ 0.63% and the surgery threshold is p_th ≈ 0.5%, both above the operating range of current quantum processors. Compared to surface code lattice surgery (also K=4, lattice surgery confined within a single patch), the sheet code provides 2L logicals per sheet at the same distance and connectivity; compared to bivariate bicycle codes (which target inter-block gates between physically separated modules at K=6 with long-range couplers), the sheet code achieves inter-sheet gates at K=4 with only short-range couplings between co-located sheets.

•Jun 19, 2026•0 citations

The Holographic Bound as a Code Selection Principle on the FCC Lattice

Raghu Kulkarni

The Face-Centered Cubic (FCC) lattice supports two CSS quantum error correction codes: the full code [[3L^3, 2L^3+2, 3]] with K=12 connectivity, and the sheet code [[L^3, 2L, L]] obtained by restricting to one of three triad sheets. If the FCC lattice is identified with Planck-scale spacetime geometry, the Bekenstein-Hawking entropy bound S <= A/(4l_P^2) constrains the number of independent degrees of freedom (logical qubits) in any region. We show that the full FCC code violates this bound at every lattice size (k ~ L^3, volume scaling), while the sheet code satisfies it for L >= 4 (k ~ L, sub-area scaling). At L=4, the three-sheet code utilizes a fraction ln 2 ≈ 69% of the holographic capacity, the maximum at any admissible lattice size. The holographic principle thus acts as a code selection rule on the FCC lattice, uniquely selecting the sheet decomposition in which the 3D lattice reduces to 3L independent 2D toric codes as the physically admissible encoding.

•Apr 4, 2026•0 citations
The [[192, 130, 3]] CSS code on the Face-Centered Cubic (FCC) lattice has weight- 3 logical operators at tetrahedral voids. We show that the QCD baryon Y-junction three color ux tubes meeting at a pointis realized as an interstitial defect at these voids: one quark per orthogonal sheet of the triad decomposition, junction at the interstitial node, color singlet realized as the weight-3 logical acting on the three bounding edges. The code's coupling matrix B ∈ {0, 1}36×51 has fault-tolerant syndrome extraction cost dim(B) = 36 ×51 = 1836. By Landauer's principle, specifying 1836 bits requires energy 1836 ×kT ln 2; by E= mc2, this energy is mass. In a vacuum with no independent storage mediumwhere the code state is the vacuumthe information content of the baryon is its mass: mp/me = 1836, matching experiment to 0.008%.
Abstract The [[3𝐿 3 , 2𝐿 3 +2, 3]] CSS code on the Face-Centered Cubic (FCC) lattice achieves 67.7% encoding rate with weight-12 stabilizers, but its distance is capped at 𝑑 = 3 by weight-3 logical operators sitting at tetrahedral interstitial voids. These logicals carry a geometric fingerprint—one error per triad sheet, all three converging at a known void—that makes them detectable by a flag ancilla measuring the three-body parity 𝑍 𝑒𝑎 𝑍 𝑒𝑏 𝑍 𝑒𝑐 . The weight-3 logical flips this parity from +1 to −1; the stabilizer syndrome stays silent, but the flag sees it. Running 𝑅 independent flag rounds per syndrome cycle pushes the logical failure rate to 𝑝 3+𝑅 , so the effective distance is simply 𝑑eff = 3+𝑅—adjustable at runtime, with no changes to the code or its logical count. At 𝑅 = 4 the FCC+flags code achieves the same 𝑝 7 distance scaling as a distance-7 surface code, with a prefactor 𝑁void = 256 versus ∼ 10 for the surface code—the cost of encoding 130 logical qubits at 29.0% rate versus 1 logical qubit at 1.0%. An adaptive scheduling protocol cuts the flag overhead to under 0.1% of measurement cycles at realistic noise levels.
A single stabilizer code on a face-centered-cubic (FCC) vacuum, with a quark a node trapped in a tetrahedral void, protects both the conserved quantities of baryonic matter and its color, and we develop both sectors at one standard of rigor, every quantitative claim reproduced by an accompanying script. The [[192,130,3]] CSS code with weight-twelve vertex and octahedral-void stabilizers is the common origin. In the external sector it makes the defect's winding charge a Gauss-law super-selection invariant, yielding the baryon ladder Δ⁻, n, p, Δ⁺⁺ with charges Q = −1 + W; the void orientation, by contrast, is not protected (a negative result we record); the migrating defect obeys E = γE_rest; and migration is a code-corrected string. In the internal sector the same code protects color. A color qutrit emerges as the symmetric sector of the cage kinetic term T = (J₃ − I₃) ⊗ J₂; the three skew-pair matchings carry an S₃ Weyl symmetry and a rank-two torus, and among the rank-two simple Lie algebras both the Weyl order and the existence of a three-dimensional representation independently select A₂ ≅ su(3); anchor-induced color/dark leakage is a weight-one correctable error. The FCC complex is then gauge-ready — its minimal plaquettes are triangles, each carrying one bond of every color — and supports a genuine ℤ₃ triality code, whose vertex Gauss law enforces q₀ + q₁ + q₂ ≡ 0 (mod 3) and which subsumes the octahedral baryon operator, so one code carries both sectors at the triality level; the non-abelian SU(3) Gauss law at a vertex has a 513-dimensional gauge-invariant space gated by triality, and the triangular plaquette Hamiltonian is gauge-invariant, so a Kogut–Susskind theory is well-posed. Building the color connection from the vacuum's processes gives a two-part dynamical result: the spatial channels transport color only diagonally, an N(T) = T ⋊ S₃ connection short of SU(3) by the root generators because the colors are bond-disjoint; but the temporal link, the cage time evolution with off-diagonal generator J₃ − I₃, supplies the missing direction and with the torus closes the full eight-dimensional su(3). Leading strong-coupling confinement holds on the triangular plaquettes with a positive string tension, and the single-plaquette spectrum has the correct 4/3 mass gap. The color algebra, both protected sectors, and the well-posed gauge theory are thus attained on one code; the continuum dynamics — confinement in the continuum limit, the running coupling, Λ_QCD — are not addressed and remain open.
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=12K=12K=12); X-stabilizers act on octahedral voids and Z-stabilizers on vertices, both with uniform weight 12. Computational verification confirms CSS validity (HXHZT=0H_{X}H_{Z}^{T}=0HX​HZT​=0 over GF(2)) and reveals k=2L3+2k=2L^{3}+2k=2L3+2 logical qubits: k=130k=130k=130 at L=4L=4L=4 and k=434k=434k=434 at L=6L=6L=6, yielding encoding rates of 67.7% and 67.0% respectively. The minimum distance d=3d=3d=3 is proven exactly by exhaustive elimination of all weight-≤2\le 2≤2 candidates combined with constructive weight-3 non-stabilizer codewords. The code parameters are [[192, 130, 3]] at L=4L=4L=4 and [[648, 434, 3]] at L=6L=6L=6. This rate is 24x higher than the cubic 3D toric code (2.8% at d=4d=4d=4), though at a lower distance (d=3d=3d=3 vs. d=4d=4d=4); the comparison is across different distances. The high rate originates in a structural surplus: the FCC lattice has 3L33L^{3}3L3 edges but only L3−2L^{3}-2L3−2 independent stabilizer constraints, leaving k=2L3+2k=2L^{3}+2k=2L3+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.001p=0.001p=0.001 (and 63x at p=0.0005p=0.0005p=0.0005), and discuss implications for fault-tolerant quantum computing on neutral-atom and photonic platforms.
The [[3L3, 2L3+2, 3]] CSS code on the Face-Centered Cubic (FCC) lattice achieves 67.7% encoding rate with weight-12 stabilizers, but its distance is capped at d = 3 by weight-3 logical operators sitting at tetrahedral interstitial voids. These logicals carry a geometric 􏰂ngerprint􏰀one error per triad sheet, all three converging at a known void􏰀that makes them detectable by a 􏰃ag ancilla measuring the three-body parity Zea Zeb Zec . The weight-3 logical 􏰃ips this parity from +1 to −1; the stabilizer syndrome stays silent, but the 􏰃ag sees it. Running R independent 􏰃ag rounds per syndrome cycle pushes the logical failure rate to p3+R, so the e􏰁ective distance is simply deff = 3 + R􏰀adjustable at runtime, with no changes to the code or its logical count. At R = 4 the FCC+􏰃ags code suppresses errors as well as a distance-7 surface code, while encoding 130 logical qubits at 29.0% rate versus 1 logical qubit at 1.0%. An adaptive scheduling protocol cuts the 􏰃ag overhead to under 0.1% of measurement cycles at realistic noise levels.
Abstract We present a CSS quantum error correcting code on the Face-Centered Cubic (FCC) lattice that combines surface-code-compatible K=4 connectivity with native inter-sheet logical gates between co-located CSS code blocks — a combination not previously achieved among well-studied codes. The construction has two parts. First, restricting the [[3L³, 2L³+2, 3]] FCC lattice code to a single triad sheet yields the sheet code with parameters [[L³, 2L, L]] at even L (or [[L³, L, L]] as a planar variant), uniform weight-4 stabilizers, and K=4 per-qubit connectivity. Three triad sheets share the FCC lattice geometry and can be deployed in one of three ways — monolithic 2D for small L, a three-layer stacked architecture for scalable deployment, or native 3D hardware — in each case encoding 6L logical qubits at distance L. Second, we introduce a fault-tolerant lattice surgery protocol that uses local FCC triangle measurements to implement joint Pauli measurements between logical qubits in different sheets. Each surgery operation adds O(L) two-qubit gates to the O(L³) per-round syndrome extraction cost. Under circuit-level depolarizing noise with MWPM decoding, the static memory threshold is p_th ≈ 0.63% and the surgery threshold is p_th ≈ 0.5%, both above the operating range of current quantum processors. Compared to surface code lattice surgery (also K=4, lattice surgery confined within a single patch), the sheet code provides 2L logicals per sheet at the same distance and connectivity; compared to bivariate bicycle codes (which target inter-block gates between physically separated modules at K=6 with long-range couplers), the sheet code achieves inter-sheet gates at K=4 with only short-range couplings between co-located sheets.
The Face-Centered Cubic (FCC) lattice supports two CSS quantum error correction codes: the full code [[3L^3, 2L^3+2, 3]] with K=12 connectivity, and the sheet code [[L^3, 2L, L]] obtained by restricting to one of three triad sheets. If the FCC lattice is identified with Planck-scale spacetime geometry, the Bekenstein-Hawking entropy bound S <= A/(4l_P^2) constrains the number of independent degrees of freedom (logical qubits) in any region. We show that the full FCC code violates this bound at every lattice size (k ~ L^3, volume scaling), while the sheet code satisfies it for L >= 4 (k ~ L, sub-area scaling). At L=4, the three-sheet code utilizes a fraction ln 2 ≈ 69% of the holographic capacity, the maximum at any admissible lattice size. The holographic principle thus acts as a code selection rule on the FCC lattice, uniquely selecting the sheet decomposition in which the 3D lattice reduces to 3L independent 2D toric codes as the physically admissible encoding.