pith. sign in

arxiv: 1407.5103 · v1 · pith:RGXV3KVCnew · submitted 2014-07-18 · 🪐 quant-ph

Quantum computing by color-code lattice surgery

classification 🪐 quant-ph
keywords latticesurgerycolor-codesurface-codemethodsqubitssameenough
0
0 comments X
read the original abstract

We demonstrate how to use lattice surgery to enact a universal set of fault-tolerant quantum operations with color codes. Along the way, we also improve existing surface-code lattice-surgery methods. Lattice-surgery methods use fewer qubits and the same time or less than associated defect-braiding methods. Furthermore, per code distance, color-code lattice surgery uses approximately half the qubits and the same time or less than surface-code lattice surgery. Color-code lattice surgery can also implement the Hadamard and phase gates in a single transversal step---much faster than surface-code lattice surgery can. Against uncorrelated circuit-level depolarizing noise, color-code lattice surgery uses fewer qubits to achieve the same degree of fault-tolerant error suppression as surface-code lattice surgery when the noise rate is low enough and the error suppression demand is high enough.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation

    quant-ph 2026-06 unverdicted novelty 7.0

    Double-slice routing provides bounded-depth spacetime routing for lattice surgery with termination guarantees, cutting compilation cost by up to 2.4x versus single-slice baselines and 7.5x with mapping optimizations o...

  2. Defect-Adaptive Lattice Surgery on Irregular Boundary Surface-Code Patches

    quant-ph 2026-04 unverdicted novelty 6.0

    A defect-adaptive lattice surgery technique reconstructs joint logical parities on irregular surface-code patches via GF(2) binary synthesis from seam measurements and pre-merge constraints, yielding executable rules ...

  3. Adaptive Deformation of Color Code in Square Lattices with Defects

    quant-ph 2026-04 unverdicted novelty 6.0

    A universal superstabilizer method adapts color codes on square lattices to isolated defects in data and ancilla qubits, with optimizations that reuse resources and support Clifford gates plus lattice surgery.

  4. Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits

    quant-ph 2026-05 unverdicted novelty 5.0

    Resource estimation for magic-state distillation on silicon spin qubits finds 42% overhead reduction via optimized pulses and ~3x physical footprint reduction with biased codes versus surface code.