Pith. sign in

REVIEW 1 cited by

The x+y Floquet code: A simple example for topological quantum computation in the path integral approach

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 2408.07265 v2 pith:6FT2LV73 submitted 2024-08-14 quant-ph

The x+y Floquet code: A simple example for topological quantum computation in the path integral approach

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

The path-integral approach to topological quantum error correction provides a unified way to construct and analyze fault-tolerant circuits in spacetime. In this work, we demonstrate its utility and versatility at hand of a simple example: We construct a new fault-tolerant circuit for the toric-code phase by traversing its path integral on a $(x,y,z)$ cubic lattice in the $x+y$ direction. The circuit acts on qubits on a square lattice, and alternates between horizontal nearest-neighbor $CX$ gates and vertical nearest-neighbor $ZZ$ and $XX$ measurements. We show how to incorporate boundaries and corners into the fault-tolerant circuit and how to perform topologically protected logic gates. As a specific example, we consider performing a fault-tolerant logical $ZZ$ measurement via lattice surgery of two spatial rectangular blocks of our fault-tolerant circuit.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. Finding diagonal logical gates in CSS codes and circuits

    quant-ph 2026-07 conditional novelty 7.0

    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.