REVIEW 9 cited by
Phase-free ZX diagrams are CSS codes (...or how to graphically grok the surface code)
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
Phase-free ZX diagrams are CSS codes (...or how to graphically grok the surface code)
read the original abstract
In this paper, we demonstrate a direct correspondence between phase-free ZX diagrams, a graphical notation for representing and manipulating a certain class of linear maps on qubits, and Calderbank-Shor-Steane (CSS) codes, a large family of quantum error correcting codes constructed from classical codes, including for example the Steane code, surface codes, and colour codes. The stabilisers of a CSS code have an especially nice structure arising from a pair of orthogonal $\mathbb F_2$-linear subspaces, or in the case of maximal CSS codes, a single subspace and its orthocomplement. On the other hand, phase-free ZX diagrams can always be efficiently reduced to a normal form given by the basis elements of an $\mathbb F_2$-linear subspace. Here, we will show that these two ways of describing a quantum state by an $\mathbb F_2$-linear subspace $S$ are in fact the same. Namely, the maximal CSS code generated by $S$ fixes the quantum state whose ZX normal form is also given by $S$. This insight gives us an immediate translation from stabilisers of a maximal CSS code into a ZX diagram describing its associated state. We show that we can extend this translation to stabilisers and logical operators of any (possibly non-maximal) CSS code by "bending wires". To demonstrate the utility of this translation, we give a simple picture of the surface code and a fully graphical derivation of the action of physical lattice surgery operations on the space of logical qubits, completing the ZX presentation of lattice surgery initiated by de Beudrap and Horsman.
Forward citations
Cited by 9 Pith papers
-
Finding diagonal logical gates in CSS codes and circuits
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.
-
The Delayed Stabilizer ZX-Calculus
A complete delayed stabilizer ZX-calculus with delay generator, generating-tableau semantics, and unique normal forms via generalized local complementation captures infinite translation-invariant stabilizer processes.
-
Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus
Extends ZX-calculus to dynamical stabilizer codes via gauge fixing to construct measurement-based logical automorphisms, shown with a distance-preserving phase gate on the seven-qubit code.
-
Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi
Graphical Algebraic Geometry creates universal diagrammatic languages for commutative algebras and affine varieties that also characterize the qudit ZH calculus for quantum computation.
-
Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory
The qufinite ZXW calculus is complete for the category FHilb of finite-dimensional Hilbert spaces, as any diagram rewrites to a unique normal form.
-
Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation
New search algorithms over stabilizer tableaus and modular assembly techniques yield encoders with up to 43% fewer two-qubit gates and 70% lower depth than prior constructions on tested stabilizer codes including qLDP...
-
String Diagrams for Quantum Foundations, Computing and Natural Language Processing
String diagrams formalize constructor theory with locality-composition conflicts, enable wave-based Boolean logic design and optimization, and map Urdu text circuits equivalently to English ones up to gate translation...
-
Meromorphic Quantum Computing
Projectivizing quantum kinematics produces meromorphic functions characterizing coherent circuits for quantum error correction and magic state distillation.
-
Transversal AND in Quantum Codes
A [[6,2,2]] qutrit code with a transversal logical AND is built from a symmetric Clifford+T circuit, and concatenation yields a [[48,2,4]] code.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.