Pith. sign in

REVIEW 2 cited by

Low-overhead quantum computing with 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

arxiv 2201.07806 v2 pith:V2BIUOZV submitted 2022-01-19 quant-ph cond-mat.str-el

classification quant-phcond-mat.str-el
keywords codecoloroverheadquantumtimesapproachcommutingcompared
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Fault-tolerant quantum computation demands significant resources: large numbers of physical qubits must be checked for errors repeatedly to protect quantum data as logic gates are implemented in the presence of noise. We demonstrate that an approach based on the color code can lead to considerable reductions in the resource overheads compared with conventional methods, while remaining compatible with a two-dimensional layout. We propose a lattice surgery scheme that exploits the rich structure of the color-code phase to perform arbitrary pairs of commuting logical Pauli measurements in parallel while keeping the space cost low. Compared to lattice surgery schemes based on the surface code with the same code distance, our approach yields about a $3\times$ improvement in the space-time overhead, obtained from a combination of a $1.5\times$ improvement in spatial overhead together with a $2\times$ speedup due to the parallelisation of commuting logical measurements. Even when taking into account the color code's lower error threshold using current decoders, the overhead is reduced by 10\% at a physical error rate of $10^{-3}$ and by 50\% at $10^{-4}$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Planar fault-tolerant circuits for non-Clifford gates on the 2D color code

    quant-ph 2025-05 conditional novelty 8.0 of 10

    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.

  2. The Pangaea Architecture: Fault-Tolerant Heterogeneous Topological Codes via a Quantum Bus

    quant-ph 2026-08 conditional novelty 7.0 of 10

    A quantum bus connects many logical qubits through a gauge-code strip, with a claimed factor O(d) reduction in qubit overhead for long-range logical interactions.

Pith tools