REVIEW 14 cited by
New circuits and an open source decoder for the color code
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
Signed reviews
abstract
We present two new color code circuits: one inspired by superdense coding and the other based on a middle-out strategy where the color code state appears halfway between measurements. We also present ``Chromobius'', an open source implementation of the m\"obius color code decoder. Using Chromobius, we show our new circuits reduce the performance gap between color codes and surface codes. Under uniform depolarizing noise with a noise strength of $0.1\%$, the middle-out color code circuit achieves a teraquop footprint of 1250 qubits (vs 650 for surface codes decoded by correlated matching). Finally, we highlight that Chromobius decodes toric color codes better when given *less* information, suggesting there's substantial room for improvement in color code decoders.
Forward citations
Cited by 14 Pith papers
-
Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
The paper constructs a family of planar fault-tolerant 'twisted color circuits' that implement logical T gates and magic-state measurements on the 2D color code via a path-integral and color-cohomology framework.
-
Spacetime Layout and Logical Compilation of Color Code
An automated color-code logical compiler maps Clifford+T circuits to admissible spacetime block layouts via edge-decorated ZX diagrams and fusion-region-aware routing, beating reported surface-code volumes on nine benchmarks.
-
Moveless: Minimizing Overhead on QCCDs via Versatile Execution and Low Excess Shuttling
Moveless compiles stabilizer-code syndrome extraction for QCCD trapped ions with ancilla-only shuttling, dynamic stabilizer reordering, and ancilla reuse, achieving up to 5.24x lower latency and up to two orders of ma...
-
Transversal Logical Clifford gates on rotated surface codes with reconfigurable neutral atom arrays
The authors complete a transversal Clifford gate set on rotated surface codes by embedding a fold-transversal S gate inside a syndrome extraction round, with detector construction and numerical support.
-
Towards Lattice Surgery Compilation for the Color Code Using Pipe Diagrams
Distance-independent pipe diagrams for the 6.6.6 triangular color code, with ZX correspondence, correlation surfaces, and syndrome extraction, enable spacetime lattice-surgery compilation beyond the surface code.
-
The Magic Scroll: Leveraging biased noise to improve magic state cultivation in register-based architectures
The Magic Scroll protocol uses biased noise and two-qubit registers to reduce the cost of producing high-fidelity magic T states by about 3x, reaching error rates near 1e-15 when combined with distillation.
-
Plaquette: A hardware-aware design platform for fault-tolerant quantum computers
Plaquette compiles realistic quantum hardware noise models into multiple sampler representations, showing that Pauli-twirled approximations can misestimate logical error rates by an order of magnitude compared to leak...
-
A matching decoder for bivariate bicycle codes
The authors introduce symatch, a minimum-weight matching decoder for bivariate bicycle quantum LDPC codes that uses code symmetries and a cylinder trick, and show it is competitive with BP-OSD and tesseract under code...
-
Pinball: A Cryogenic Predecoder for Surface Code Decoding Under Circuit-Level Noise
A cryogenic surface-code predecoder that adds spacetime-like and hook-error primitives to achieve near-MWPM logical error rates while cutting 4K-to-RT syndrome bandwidth by up to 3780x.
-
Efficient Post-Selection for General Quantum LDPC Codes
Cluster-size and cluster-LLR norm fractions from BP+LSD decoding suppress logical error rates by orders of magnitude at low abort rates on surface, bivariate bicycle, and hypergraph product codes.
-
Fast correlated decoding of transversal logical algorithms
Decoding only back-propagated reliable logical Pauli products turns transversal-circuit decoding into a matchable graph, so fast minimum-weight perfect matching works with memory-like thresholds.
-
Estimating decoding graphs and hypergraphs of memory QEC experiments
Syndrome statistics alone can reconstruct the detector error models of repetition, surface, and color code memories, including hyperedge probabilities, assuming independent Pauli noise with known error-event structure.
-
Diamond Circuits for Surface Codes
Diamond circuits implement a surface code on a Heavy-Square lattice using about 25% fewer qubits and 40% fewer control lines than the standard circuit, at the cost of a roughly 3x lower threshold and longer detecting regions.
-
Towards logical entanglement creation in trivalent planar architectures
Trivalent surface-code layouts can run lattice surgery without the extra data-qubit stripe used in four-valent layouts, but the simulated fidelity gain holds mainly at small distance or under assumed faster gates.
Discussion (0). Continue with ORCID to comment.