REVIEW 6 cited by
Floquetifying stabiliser codes with distance-preserving rewrites
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
Signed reviews
read the original abstract
Stabiliser codes with large weight measurements can be challenging to implement fault-tolerantly. To overcome this, we propose a Floquetification procedure which, given a stabiliser code, synthesises a novel Floquet code that only uses single- and two-qubit operations. Moreover, this procedure preserves the distance and number of logicals of the original code. The new Floquet code requires additional physical qubits. This overhead is linear in the weight of the largest measurement of the original code. Our method is based on the ZX calculus, a graphical language for representing and rewriting quantum circuits. However, a problem arises with the use of ZX in the context of rewriting error-correcting codes: ZX rewrites generally do not preserve code distance. Tackling this issue, we define the notion of distance-preserving rewrite that enables the transformation of error-correcting codes without changing their distance. These distance-preserving rewrites are used to decompose arbitrary weight stabiliser measurements into quantum circuits with single- and two-qubit operations. As we only use distance-preserving rewrites, we are guaranteed that a single error in the resulting circuit creates at most a single error on the data qubits. These decompositions enable us to generalise the Floquetification procedure of [arXiv:2307.11136] to arbitrary stabiliser codes, provably preserving the distance and number of logicals of the original code.
Forward citations
Cited by 6 Pith papers
-
Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
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.
-
Floquet Abelian Multicycle Codes
Floquet Abelian multicycle codes encode logical qubits in measurement-only schedules derived from higher-dimensional chain complexes, with compact examples at [[108,6,5]], [[144,6,8]], and [[324,6,10]].
-
Dynamical codes for hardware with noisy readouts
Repeating measurement rounds in dynamically condensed colour codes substantially reduces teraquop volume under measurement-biased noise, while decoder choice determines whether XZ-only or XYZ schedules win.
-
From Fermions to Qubits: A ZX-Calculus Perspective
A ZX-calculus framework unifies linear, ternary-tree, and local fermion-to-qubit encodings and yields a direct algorithm for the binary matrix of any ternary tree mapping.
-
Pauli web of the $|Y\rangle$ state surface code injection
Applying Pauli web rules to the Lao-Criger Y-state injection circuit recovers the logical Y correlator of the rotated surface code, confirming the triangular initialisation pattern and the need for post-selection.
-
Pauli webs spun by transversal $|Y\rangle$ state initialisation
A diagrammatic verification, using Pauli webs, that the CCLP fold-transversal S gate maps the logical X correlator to the logical Y correlator.
Discussion (0). Continue with ORCID to comment.