arXiv:2610.03594
Fault-tolerant and fully addressable unitary logical gates via round-robin sparsification
Kaavya Sahay, Cody Jones
Abstract
For quantum low-density parity check (qLDPC) codes, the ability to manipulate individual logical units of information, i.e. the use of addressable gates, enables maximal utility of their efficient encoding. We introduce explicit low-depth unitary circuits that realize fully addressable and fault-tolerant two-qubit Clifford gates for a subset of two-dimensional translationally invariant qLDPC codes. Our transversal unitaries are created by applying a geometrically structured sparsification procedure to round-robin circuits. We verify the general applicability of our protocol by proposing and numerically simulating a range of addressable CZs between toric, cyclic hypergraph-product, color, gross, and directional codes, demonstrating fault-tolerant memory-like logical error rate scaling.
AI Summary
The paper addresses how to implement individually addressable logical entangling gates in multi-logical-qubit qLDPC blocks without the $O(d)$ measurement rounds typically used by code surgery. It constructs CZ circuits by starting with all-to-all round-robin gates between two logical-$Z$ supports, then multiplying by logically trivial stabilizer-controlled circuits to redistribute and sparsify the physical interactions. A sliding-cylinder construction supplies disjoint equivalent logical representatives. For selected two-dimensional translationally invariant CSS families, the resulting inter-block circuits have two-qubit gate depth independent of distance: 3 for toric codes, 6 for cyclic hypergraph-product-2 and color codes, 8 for a directional family, and 14 for cyclic hypergraph-product-3. Full addressability is obtained for several families by translating or reorienting circuit supports; cross-family and simultaneous gates are also constructed. Toric gates are argued to preserve fault distance $d$. Circuit-level depolarizing-noise simulations using the tesseract decoder show memory-like logical-error scaling for several families. Applicability is restricted to selected structures with $|A|,|B|\leq3$; the algorithm can fail for non-gridlike symmetries, and gross-code addressability is partial. Bare cyclic-HGP-3 gates reduce fault distance to $d/2$; an intermediate stabilizer-measurement round restores it in the verified $d=4$ example. Intra-block constructions also reduce distance. Distance bounds are generally not tight, especially for the gross code. Constant gate depth excludes potentially substantial qubit-reconfiguration costs, and “transversal” denotes bounded connectivity rather than strict transversality. A preliminary gross-code surgery comparison reports roughly fourfold lower spacetime overhead, but compares different primitives and code sizes.
Gemini was used to iterate on maximal-matching and constraint-sliced gate scheduling, make faster bit-packed versions of human-generated GF(2) rowspace functions, and for minor formatting.
Error found: The distance-optimized cHGP3 circuit is not wholly unitary because it includes an intermediate stabilizer measurement, and its full fault-distance restoration is explicitly verified only for d=4. The gross-code simulation does not validate the abstract's full combination of properties: it includes an intermediate measurement, supports only some logical operators, and leaves preservation of memory fault distance unresolved.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 10 pages main text (9 figures), 7 pages appendix