arXiv:2610.12685
Fast computational primitives for La-cross qLDPC codes
Andrea Di Fini, Tom Hartweg, Laura Pecorari, Guido Pupillo, Samuel Crew
Abstract
Quantum LDPC codes promise to reduce the overhead of fault-tolerant quantum computation, but their practical use requires efficient logical gates, measurements, and access to non-Clifford resources. Here, we develop a complete set of computational primitives for La-cross hypergraph product codes. For a subclass of these codes, we show that seed automorphisms together with fold-transversal gates generate the full logical Clifford group up to Pauli corrections. We further prove that every rank one logical operator admits $D$ pairwise disjoint physical representatives, enabling parallel gauging and a space--time tradeoff for logical measurements. Finally, we construct an addressable surface code interface for injecting externally prepared resource states into selected logical qubits. Together, these results establish La-cross codes as a simple, low-connectivity generalisation of surface code computation, retaining analogous computational primitives while providing a complete Clifford+$T$ instruction set across multiple encoded qubits.
AI Summary
The paper studies computational primitives for open-boundary La-cross hypergraph-product codes: native logical Clifford gates, logical Pauli measurements, and an interface for importing surface-code resource states. Its main results concern primitive complete-period seeds, with $n=s(2^k-1)$ and quantum parameters $[[n^2+(n-k)^2,k^2,D]]$, where $D=s2^{k-1}$. Examples include $[[65,9,4]]$ and $[[346,16,8]]$. For $k\ge3$, seed automorphisms together with Hadamard and phase folds generate the full logical Clifford group modulo Paulis, $\mathrm{Sp}(2k^2,2)$. The argument classifies seed automorphisms through generator-column multiplicities and shows that conjugated phase folds span all symmetric symplectic shears. These automorphisms can require check-sector CNOT circuits, rather than physical permutations alone; phase folds have a stated fault-distance bound of $\lceil D/2\rceil$ and require intervening error correction. Every rank-one logical $X$ or $Z$ has $D$ disjoint equivalent representatives, each of weight $D$ or $2D$, obtained by pairing generator columns whose sum is fixed. Parallel gauging motivates a two-round measurement using $O(D^2\log D)$ ancillas, but its circuit-level fault-tolerance analysis remains open. An explicit chain-map construction couples a distance-$D$ surface-code patch to a selected logical qubit. The interface uses $O_k(D^2)$ CNOTs at depth $O_k(1)$ and has proved transfer fault distance $D$ under a specified Pauli-fault model with ideal initial states and final target checks. The codes are not asymptotically constant-rate; practical noise, scheduling costs, and measurement space–time tradeoffs remain to be quantified.
Central claim may not hold: The advertised two-round fault-tolerant logical measurement has a justified ancillary-qubit count but only a heuristic protection argument, so distance-independent fault-tolerant measurement time remains unestablished.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.