arXiv:2610.06749
Efficient Logic with Ultra-High-Rate Quantum Codes
Nishad Maskara, Rohan Mehta, Zhiyang He, Varun Menon, J. Pablo Bonilla Ataides, Mikhail D. Lukin, Hengyun Zhou
Abstract
Quantum low-density parity-check (qLDPC) codes offer a promising route to reducing the qubit overhead of fault tolerance, with recent ultra-high-rate constructions achieving encoding rates above one half. In this work, we develop fast and parallel logical computation methods for ultra-high-rate codes. We first utilize the group symmetries of the codes to partition the logical qubits into orbits, and then apply parallel surgery methods to implement group-invariant collections of logical Pauli-product measurements. These measurements are highly programmable, as we may arbitrarily couple logical orbits as long as each measurement is repeated across the whole orbit(s). To reduce the space and time overheads, we develop a technique called chain-map convolution, which uses the group structure to boost both the spatial and temporal distances of our protocol in a highly efficient manner. As case studies, we construct distance-preserving parallel measurement gadgets for the [[256, 68, 12]], [[576, 148, 18]] pair-partition codes, and a [[1152, 580, 12]] rate-$1/2$ code, with only around $2.5\times$ space overhead and 3-4 rounds of syndrome extraction each. The same methods also enable parallel injection of cultivated magic states into high-rate codes. Finally, we extend programmability through subgroup restrictions, revealing a tradeoff between logical control and the spacetime resources required for fault tolerance and highlighting the crucial role structured parallelism plays in reducing overhead. These results provide new methods for designing qLDPC logical operations with low spacetime overhead, opening a route toward more efficient fault-tolerant quantum architectures.
AI Summary
The paper addresses how to perform parallel logical operations on ultra-high-rate qLDPC codes without the space and $O(d)$ syndrome-round costs of conventional surgery. It targets symmetry-invariant families of Pauli-product measurements rather than independently addressable operations. A symmetry-adapted logical basis organizes encoded qubits into group orbits. Sparse surgery ancillas program measurements repeated across these orbits. “Chain-map convolution” replaces identity couplings between spatial or temporal layers with sums of group-translated couplings, preserving check commutation while increasing fault distance. Restricting to subgroups provides finer logical control but reduces the available convolution structure. Explicit gadgets on $[[256,68,12]]$, $[[576,148,18]]$, and $[[1152,580,12]]$ codes perform respectively 32, 72, and 288 pairwise measurements, plus residual-sector parities, with $2.5\times$ qubit-plus-check footprint and 3–4 syndrome rounds. Distances are verified numerically in a phenomenological fault model. Circuit-level block-readout simulations at $p=0.1\%$, without idle noise, give failure probabilities approximately $4\times10^{-7}$ for a three-round convolved gadget versus $9\times10^{-7}$ for twelve-round repetition on the smallest code. Asymptotic constructions give $O(\log^2|G|)$ spatial overhead when $|G|=\Omega(d)$ and, for a specified code class, $O(\log^4|G|)$ spacetime overhead. Parallel magic-state transfer is also constructed. The low-overhead regime requires repeated, symmetry-compatible operations. Phenomenological distance does not certify circuit-level distance; simulations use readout proxies rather than complete surgery or injection. Hardware scheduling, matched-error-rate resource comparisons, compilation into complete algorithms, and protection of arbitrarily long operation sequences remain unresolved.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 15 + 44 pages