Color code off-the-hook: avoiding hook errors with a single auxiliary per plaquette
Gilad Kishony, Austin Fowler
Abstract
Syndrome extraction in the planar color code is complicated by high weight stabilizers and hook errors that can reduce the circuit-level distance. With a single auxiliary qubit per plaquette, any spatially uniform circuit halves the circuit-level distance. We propose a single-auxiliary syndrome extraction circuit with color-dependent gate schedules that avoids all malign hook errors in the bulk, thereby preserving the full circuit-level distance. The circuit has minimal depth: all stabilizers of the same Pauli type are measured in parallel in six time steps. Furthermore, this schedule can be readily applied to the XYZ color code circuit, yielding an improved temporal distance. We find that at the boundary, no single hook error alone reduces the distance; instead, only certain combinations of hook errors do, which we call fractional hook errors. We demonstrate through Monte Carlo simulations over a range of circuit-level noise models and physical error rates that our circuit outperforms the previous state of the art.
AI Impact Assessments
(3 models)Scientific Impact Assessment
1. Core Contribution
The paper addresses a well-known and practically significant problem in quantum error correction: the circuit-level distance reduction caused by hook errors in color code syndrome extraction. The central insight is elegantly simple — different hook errors are malign on plaquettes of different colors, so assigning color-dependent gate schedules (rather than spatially uniform ones) can avoid all malign hook errors in the bulk. This breaks a previously implicit assumption in the field that all plaquettes should use the same schedule.
The resulting circuit achieves a total qubit to circuit-level distance ratio of , which is a substantial improvement over the middle-out circuit (), the conventional single-auxiliary circuit (), and even the superdense circuit () which requires more physical qubits per plaquette. The circuit maintains minimal depth (six time steps for all stabilizers of the same Pauli type measured in parallel).
2. Methodological Rigor
The paper combines analytical reasoning with numerical validation effectively:
Analytical side: The identification of malign hook errors per plaquette color is systematic and clearly presented. The authors enumerate all weight-2 hook error pairs, explain why weight-3 hook errors are benign (they flip too many stabilizers to serve as shortcuts), and construct schedules that avoid all problematic cases. The boundary analysis is particularly nuanced — they identify "fractional hook errors" where no single hook error reduces the distance, but combinations of three hook errors plus two data-qubit errors can create shortcuts. The exact formula for the circuit-level distance is verified numerically up to .
Numerical side: Monte Carlo simulations are performed using Stim and decoded with the Tesseract decoder across three noise models (SI1000, uniform depolarizing, noisy CNOT) at multiple physical error rates. The comparison against four prior circuits (middle-out, superdense, tri-optimal, tri-optimal XYZ) is fair — all use the same decoder. The code is publicly available, supporting reproducibility. The presentation of results across noise models is thorough and demonstrates robustness.
One limitation is that simulations are restricted to relatively modest code distances, though the authors argue convincingly that advantages should grow with distance given the analytical distance properties.
3. Potential Impact
Near-term hardware relevance: The ~20% teraquop footprint reduction under the SI1000 noise model is practically significant for superconducting quantum computers, which are the leading platform for surface/color code implementations. The circuit requires only nearest-neighbor connectivity on a honeycomb lattice with a single auxiliary per plaquette — the minimal possible hardware overhead.
Architectural implications: The figure is remarkably efficient and strengthens the case for color codes over surface codes in fault-tolerant architectures, especially given the color code's transversal Clifford gates and compatibility with magic state cultivation. This could influence hardware roadmaps for companies pursuing fault-tolerant quantum computing.
Broader methodological lesson: The principle that spatially non-uniform but color-aware scheduling can circumvent fundamental-seeming limitations is a transferable insight. The authors explicitly note potential applications to other code families.
4. Timeliness & Relevance
This work arrives at a critical moment. Color codes have recently achieved performance competitive with surface codes (as noted by the reference to Koutsioumpas et al. 2025), and there is active interest in practical fault-tolerant architectures. The competition between color codes and surface codes for hardware implementations is ongoing, and improvements to color code syndrome extraction circuits directly feed into this decision. The integration with XYZ color code variants and magic state cultivation protocols further enhances relevance.
5. Strengths & Limitations
Key Strengths:
Notable Limitations:
Additional Observations
The paper is well-written with clear figures. The naming ("off-the-hook," "fractional hook errors") is memorable and aids communication. The comparison metric is well-chosen and provides clear intuition. The work fits into a productive line of research on syndrome extraction optimization that is increasingly important as experimental platforms approach the threshold for fault-tolerant operation.
Generated Apr 1, 2026
Comparison History (47)
Paper 2 likely has higher impact: it addresses a central bottleneck in fault-tolerant quantum computing (syndrome extraction for planar color codes) with a concrete, low-overhead circuit (single ancilla per plaquette, minimal depth) that preserves full circuit-level distance and generalizes to XYZ color codes. It supports claims with Monte Carlo simulations across noise models, indicating methodological rigor and near-term relevance for hardware implementations. Paper 1 is novel and potentially broadly useful for low-noise switchable magnetic fields, but its impact depends more on engineering adoption and experimental validation beyond a proposed trapped-ion application.
Paper 1 addresses a broadly relevant and timely question—the energy efficiency of quantum computers across multiple platforms—establishing a new benchmarking framework applicable to all future quantum architectures. Its cross-platform analysis, involvement of domain experts, and relevance to practical deployment decisions give it broader interdisciplinary impact. Paper 2, while technically strong and important for quantum error correction, addresses a more specialized problem (hook errors in color codes) with a narrower audience. Paper 1's framework-setting nature and timeliness in the growing quantum computing industry give it higher overall impact potential.
Paper 2 addresses multiple fundamental bottlenecks in fault-tolerant quantum computing with broader scope: flag fault tolerance with exponential qubit reduction, improved state preparation with 100% yield, a distance-4 code matching distance-5 surface code performance at 1/10 the qubits, and classical code protection cutting computation time 2-6x. Its hardware-agnostic optimizations span multiple building blocks and codes, giving it wider applicability. Paper 1, while technically strong with its hook-error-avoiding color code circuit, addresses a more specific problem within color code syndrome extraction.
Paper 1 addresses a concrete, well-defined problem in quantum error correction—hook errors in color codes—with a clear, implementable solution that demonstrably outperforms prior state-of-the-art through rigorous simulations. Color codes are critical for fault-tolerant quantum computing, giving this work immediate practical relevance in a rapidly advancing field. Paper 2, while intellectually ambitious in connecting information causality to representation learning, is more abstract and theoretical, with less clear practical applicability. The quantum error correction community is large and actively building hardware, making Paper 1's contributions more directly impactful.
Paper 2 bridges theoretical quantum advantage with practical hardware implementations, targeting high-impact real-world applications like financial markets and electric grids. Its comprehensive framework for realistic latency-constrained scenarios offers broader cross-disciplinary impact and immediate relevance compared to the highly specialized, though rigorous, error correction improvements in Paper 1.
Paper 1 proposes a fundamental paradigm shift in linear-optical quantum computing (LOQC) by demonstrating deterministic, low-resource multi-qubit gates without the historically required post-selection or ancilla measurements. While Paper 2 offers a highly practical and significant optimization for quantum error correction, Paper 1 introduces a highly novel encoding scheme that could fundamentally change the trajectory and scalability of photonic quantum computing architectures.
While Paper 1 presents an impressive experimental advancement in bosonic quantum computing, Paper 2 addresses a fundamental algorithmic bottleneck in Quantum Error Correction (QEC). Fault-tolerant QEC is the most critical hurdle for scalable quantum computing. By demonstrating a minimal-depth syndrome extraction circuit that avoids malign hook errors using only a single auxiliary qubit, Paper 2 offers a highly efficient, platform-agnostic theoretical solution. Its potential to improve circuit-level distance and outperform state-of-the-art error correction methods gives it a broader and more critical long-term scientific impact across the quantum computing discipline.
Paper 1 addresses a concrete, practically important problem in quantum error correction implementation—reducing hook errors in color codes with minimal hardware overhead. It provides a constructive circuit design, proves performance improvements, and validates with Monte Carlo simulations, making it immediately applicable to near-term quantum computing experiments. Paper 2, while intellectually interesting in connecting gauge symmetry to QECC via quantum reference frames, is more conceptual/foundational and less likely to have immediate practical impact. Paper 1's direct relevance to active experimental efforts in fault-tolerant quantum computing gives it broader and more timely impact.
Paper 1 addresses a critical practical challenge in quantum error correction—hook errors in color codes—with a concrete, implementable solution that preserves full circuit-level distance using minimal resources. It demonstrates clear performance improvements via Monte Carlo simulations across multiple noise models. Color codes are central to fault-tolerant quantum computing, making this highly relevant and timely. Paper 2 proposes an interesting but more incremental theoretical quantum memory protocol; while novel in using continuum Brillouin systems, it lacks experimental validation and faces competition from established quantum memory platforms.
Paper 1 addresses a fundamental, broad problem in quantum physics—state determinability from marginals—bridging pure theory and experimental reality. Its introduction of a robustness classification and practical entanglement witnesses gives it wide-ranging implications across quantum information and many-body physics. Paper 2 is highly significant for quantum error correction, but its scope is more narrowly focused on optimizing specific color code circuits, making Paper 1's foundational contributions likely to have broader scientific impact.