REVIEW 11 cited by
Computation with quantum Reed-Muller codes and their mapping onto 2D atom arrays
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Computation with quantum Reed-Muller codes and their mapping onto 2D atom arrays
read the original abstract
We give a fault tolerant construction for error correction and computation using two punctured quantum Reed-Muller (PQRM) codes. In particular, we consider the $[[127,1,15]]$ self-dual doubly-even code that has transversal Clifford gates (CNOT, H, S) and the triply-even $[[127,1,7]]$ code that has transversal T and CNOT gates. We show that code switching between these codes can be accomplished using Steane error correction. For fault-tolerant ancilla preparation we utilize the low-depth hypercube encoding circuit along with different code automorphism permutations in different ancilla blocks, while decoding is handled by the high-performance classical successive cancellation list decoder. In this way, every logical operation in this universal gate set is amenable to extended rectangle analysis. The CNOT exRec has a failure rate approaching $10^{-9}$ at $10^{-3}$ circuit-level depolarizing noise. Furthermore, we map the PQRM codes to a 2D layout suitable for implementation in arrays of trapped atoms and try to reduce the circuit depth of parallel atom movements in state preparation. The resulting protocol is strictly fault-tolerant for the $[[127,1,7]]$ code and practically fault-tolerant for the $[[127,1,15]]$ code. Moreover, each patch requires a permutation consisting of $7$ sub-hypercube swaps only. These are swaps of rectangular grids in our 2D hypercube layout and can be naturally created with acousto-optic deflectors (AODs). Lastly, we show for the family of $[[2^{2r},{2r\choose r},2^r]]$ QRM codes that the entire logical Clifford group can be achieved using only permutations, transversal gates, and fold-transversal gates.
Forward citations
Cited by 11 Pith papers
-
LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction
LightStim automates DEM construction for QEC protocols via an augmented Pauli tableau during compilation, matching public tools on detector counts and error rates while enabling new cross-code designs.
-
Borrowed Identities: Malleable Distillation Factories and a Unified Numerical Search
A borrowed-identity condition unifies magic-state distillation across Clifford levels and output types, recovering all known distance-2 factories in one search and enabling malleable parent circuits.
-
Borrowed Identities: Malleable Distillation Factories and a Unified Numerical Search
Borrowed-identity condition unifies numerical searches for magic-state distillation factories across Clifford hierarchy levels and code families.
-
Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks
LightStim automates DEM construction for QEC protocols via a record-augmented Pauli tableau tracker, validated across memory, logical operations, distillation, and a novel cross-code lattice surgery design.
-
Simplified circuit-level decoding using Knill error correction
Knill error correction reduces circuit-level decoding for quantum LDPC codes to the simpler code-capacity decoder while remaining fault-tolerant under locally decaying noise.
-
Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates
High-rate self-dual quantum Reed–Muller codes admit ancilla-free addressable Clifford gates generated by transversal H and fold-transversal phase gates.
-
Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry
A symmetry-leveraging framework for fault-tolerant ancilla preparation in quantum BCH codes yields lower spatial overhead and logical error rates than standard distillation in simulations up to 127 qubits.
-
Spatial overhead reduction for 2D hypergraph product codes
A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and...
-
LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction
A tree-encoded fusion scheme and MemTree compiler suppress fusion erasure errors in photonic MBQC, achieving large execution-time reductions over prior compilers with real-hardware validation.
-
Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks
Novelty search generates diverse continuous multimodal landscapes with direct basin definitions, enabling low-cost local optima networks whose features predict evolutionary algorithm performance.
-
Parity-unfolded distillation architecture for noise-biased platforms
A new fault-tolerant scheme called parity unfolding distills gates from any Clifford hierarchy level using 2^{k+3} + O(2^{k/2}) biased-noise qubits, cutting logical error rates by 43% and resources by 26% for arbitrar...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.