Pith. sign in

REVIEW 3 cited by

A fault-tolerant non-Clifford gate for the surface code in two dimensions

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 1903.11634 v2 pith:RZT6WFMS submitted 2019-03-27 quant-ph cond-mat.str-el

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

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Fault-tolerant logic gates will consume a large proportion of the resources of a two-dimensional quantum computing architecture. Here we show how to perform a fault-tolerant non-Clifford gate with the surface code; a quantum error-correcting code now under intensive development. This alleviates the need for distillation or higher-dimensional components to complete a universal gate set. The operation uses both local transversal gates and code deformations over a time that scales with the size of the qubit array. An important component of the gate is a just-in-time decoder. These decoding algorithms allow us to draw upon the advantages of three-dimensional models using only a two-dimensional array of live qubits. Our gate is completed using parity checks of weight no greater than four. We therefore expect it to be amenable with near-future technology. As the gate circumvents the need for magic-state distillation, it may reduce the resource overhead of surface-code quantum computation considerably.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 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. Finding diagonal logical gates in CSS codes and circuits

    quant-ph 2026-07 conditional novelty 7.0 of 10

    Diagonal logical gates of a CSS code or circuit are exactly the kernel of a pullback map on phase functions, and that kernel can be computed in cubic time.

  3. Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes

    quant-ph 2025-12 conditional novelty 7.0 of 10

    Non-Abelian surface codes based on dihedral groups D_{4N} implement transversal phase gates T^{1/N} at any Clifford-hierarchy level in 2D, with a qubit-only version when 8N is a power of two.

Pith tools