Pith. sign in

REVIEW 2 cited by

Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics

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 2302.02192 v2 pith:HENLPADA submitted 2023-02-04 quant-ph

classification quant-ph
keywords circuitscodehardwaresurfacegridinsteadlogicalstandard
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The typical time-independent view of quantum error correction (QEC) codes hides significant freedom in the decomposition into circuits that are executable on hardware. Using the concept of detecting regions, we design time-dynamic QEC circuits directly instead of designing static QEC codes to decompose into circuits. In particular, we improve on the standard circuit constructions for the surface code, presenting new circuits that can embed on a hexagonal grid instead of a square grid, that can use ISWAP gates instead of CNOT or CZ gates, that can exchange qubit data and measure roles, and that move logical patches around the physical qubit grid while executing. All these constructions use no additional entangling gate layers and display essentially the same logical performance, having teraquop footprints within 25% of the standard surface code circuit. We expect these circuits to be of great interest to quantum hardware engineers, because they achieve essentially the same logical performance as standard surface code circuits while relaxing demands on hardware.

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. OpenAlex reports about 5 citations worldwide. Full citation record

  1. A Unitary Encoder for Surface Codes

    quant-ph 2025-06 conditional novelty 7.0 of 10

    A new non-local unitary encoder grows a rotated surface code from distance d to 2d-1 in four time steps, giving about 43% less depth than the previous best logarithmic-depth encoder.

  2. A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes

    quant-ph 2025-08 conditional novelty 6.0 of 10

    Routing syndrome information through opposite-type ancilla qubits reduces long-range connectivity of quantum LDPC codes (up to 50% for BB codes) at the cost of roughly doubled circuit depth, with circuit-level distanc...

Pith tools