ZX Contour Diagram Overview

• ZX Contour Diagram is a graphical representation of quantum circuits that leverages spiders and wires to emphasize connectivity over geometric layout.
• It aids in diagnosing long-range entanglement and topological order by analyzing non-local spiders and boundary contours in models like toric and color codes.
• The diagrammatic approach supports efficient circuit extraction and optimization using rewrite rules such as local complementation, pivoting, and alternating extraction.

A ZX contour diagram is a usage associated with the ZX-calculus in which quantum states, processes, and circuits are represented by spiders and wires and manipulated by graphical rewrite rules. In the cited literature, the expression is used in more than one way: as a near-synonym for a ZX-diagram when emphasizing its topological or network-theoretic character, and as a more specific construction such as the boundary contour diagram $\mathcal{D}_{\partial A}$ used to diagnose long-range entanglement and topological order. Across these uses, the common invariant is connectivity rather than geometric embedding (Backens et al., 2016, Backens et al., 2017, Mas-Mendoza et al., 15 Sep 2025).

1. Terminology and formal status

Within the stabilizer ZX-calculus, a ZX diagram $D:k \to l$ with $k$ inputs and $l$ outputs is a finite, open, edge-labelled multigraph built from generators and composed by tensor product and sequential composition (Backens et al., 2016). The generators are green spiders $R_Z^{(n,m)}(\alpha)$, red spiders $R_X^{(n,m)}(\alpha)$, Hadamard gates, scalars, identities, swaps, cups, and caps. Under the standard interpretation, such diagrams denote linear maps $$\llbracket D \rrbracket : \mathbb{C}^{2^k} \to \mathbb{C}^{2^l}$$ (Backens et al., 2016).

The term “contour” is tied to the doctrine that “only topology matters”: any diagram can be deformed freely so long as connectivity is preserved (Backens et al., 2016). In the minimal stabilizer setting, the same principle is recovered even in a weaker ambient category, namely a braided autonomous category instead of the usual compact closed category (Backens et al., 2017). This topological viewpoint is central to why ZX objects can be treated as contour-like structures rather than rigid circuit layouts.

The formal system has also been reduced and reorganized. A simplified stabilizer ZX-calculus keeps a significantly smaller set of axioms while deriving color symmetry and upside-down symmetry rather than postulating them (Backens et al., 2016). A related minimality analysis shows that most of the remaining rules are necessary, while leaving open the necessity of two rules, including the bialgebra rule (Backens et al., 2017). In a separate normalization of the language, renormalised generators make the bialgebra laws exact and eliminate scalar gadgets from the representation of common unitary transformations, yielding a “well-tempered” ZX calculus with simpler scalar-exact rewrites (Beaudrap, 2020).

2. Diagrammatic language and graph-like structure

ZX diagrams are built from spiders. A Z-spider with phase $\alpha$, $m$ inputs, and $n$ outputs denotes

$D:k \to l$0

with the corresponding X-spider defined in the $D:k \to l$1/$D:k \to l$2 basis (Duncan et al., 2019). The standard visual vocabulary uses green Z-spiders, red X-spiders, ordinary wires, and Hadamard wires or Hadamard boxes (Duncan et al., 2019, Schmid et al., 27 Jan 2026).

A particularly important normal form is the graph-like ZX diagram. It is defined by four conditions: all spiders are Z-spiders; Z-spiders are only connected via Hadamard edges; there are no parallel Hadamard edges or self-loops; and every input or output is connected to at most one Z-spider, and vice versa (Duncan et al., 2019). Every ZX-diagram can be rewritten into this form using spider fusion, color change, and rules removing parallel edges and self-loops (Duncan et al., 2019).

Graph-like form is the bridge from contour-style graphical reasoning to graph theory and compilation. Any quantum circuit can be represented as a graph-like ZX diagram by systematically applying ZX rules (Schmid et al., 27 Jan 2026). The resulting structure also matches a pattern in measurement-based quantum computing: each spider becomes a qubit in the $D:k \to l$3 state, and Hadamard wires represent $D:k \to l$4 gates (Schmid et al., 27 Jan 2026). This correspondence explains why graph-like diagrams support both rewrite-theoretic simplification and constructive circuit extraction.

3. Rewrite theory, simplification, and circuit extraction

The basic rewrite principles include spider fusion and Hadamard color change (Schmid et al., 27 Jan 2026). For graph-like diagrams, two graph-theoretic transformations are especially important: local complementation and pivoting. Local complementation complements the subgraph induced by the neighborhood of a vertex, while pivoting on an edge is a sequence of three local complementations; in ZX terms, these rules delete interior proper Clifford spiders or pairs of adjacent interior Pauli spiders while rewiring the environment (Duncan et al., 2019). A central structural guarantee is that both transformations preserve the existence of focused gFlow, which in turn ensures a deterministic extraction procedure after simplification (Duncan et al., 2019).

For Clifford circuits, this yields a normal form

$D:k \to l$5

together with an asymptotically optimal size characterization and a $D:k \to l$6 gate-depth bound for linear nearest-neighbour architectures (Duncan et al., 2019). For more general circuits, extraction proceeds by updating a frontier of boundary spiders toward the inputs and using Gaussian elimination on the associated biadjacency structure (Duncan et al., 2019).

Circuit extraction is not unique. In the extraction framework based on graph-like ZX diagrams, phases on frontier spiders become $D:k \to l$7 gates, Hadamard wires between frontier spiders yield $D:k \to l$8 gates, Hadamard wires between frontier and non-frontier spiders yield Hadamard gates, and a further $D:k \to l$9 extraction rule is available when each frontier spider connects to at least two non-frontier spiders (Schmid et al., 27 Jan 2026). Different valid choices define different extraction paths, and these paths can produce different two-qubit placements and counts (Schmid et al., 27 Jan 2026).

This non-uniqueness is exploited in alternating extraction for hardware-adaptive compilation. Rather than extracting first and routing afterward, the method alternates between generating multiple extraction options and evaluating them against hardware constraints, with routing feedback selecting the path to continue (Schmid et al., 27 Jan 2026). The scheme is modular with respect to extraction algorithms, routing strategies, and target hardware, and the reference implementation uses SWAP-based routing for neutral atom hardware with Approximate Success Probability as the evaluation metric (Schmid et al., 27 Jan 2026). A plausible implication is that, in contour-style diagrammatic compilation, the “shape” of the graph is not merely a semantic carrier but an active optimization resource.

4. Boundary contour diagrams and topological order

A more specialized meaning of ZX contour diagram appears in the diagnosis of topological order. There, the protocol takes a real-space bipartition of a state and returns a ZX contour diagram $k$0, displaying long-range graph connectivity only for long-range entangled states (Mas-Mendoza et al., 15 Sep 2025). The input state $k$1 is first represented as a ZX diagram. One then forms the density matrix, traces out all qubits by closing ket and bra wires, and pins the spiders associated with qubits entangled across the $k$2 boundary by leaving them unsimplified (Mas-Mendoza et al., 15 Sep 2025). After simplifying the rest of the diagram, the resulting scalar-valued object is $k$3 (Mas-Mendoza et al., 15 Sep 2025).

The diagnostic quantity is the number of non-local green Z-spiders, $k$4, in $k$5. In the reported examples, $k$6 for trivial or short-range entangled states, whereas $k$7 equals the topological entanglement entropy for topologically ordered states (Mas-Mendoza et al., 15 Sep 2025). For the toric code, simplification yields a single non-local Z-spider connecting all boundary plaquettes; for the color code, the corresponding contour diagram contains two non-local spiders; and for trivial states with spurious entropy contributions, such as the 2D cluster state discussed there, the contour diagram contains only local disconnected lines (Mas-Mendoza et al., 15 Sep 2025).

The protocol is presented as robust to the choice of boundary and to the choice of ground-state superposition, and the non-local nodes are absent for trivial states even when entropy-based diagnostics produce spurious contributions (Mas-Mendoza et al., 15 Sep 2025). In this sense, the contour diagram is not merely a depiction of a ZX network but a derived boundary object whose long-range connectivity encodes a physically discriminating invariant.

5. Scalable nests, code transformations, and holographic constructions

Another extension of contour-style reasoning appears in scalable ZX diagrams. In this framework, thick wires denote registers, bold spiders denote arrays of identical spiders acting in parallel, and arrows encode arbitrary biadjacency connectivity matrices (Kissinger et al., 2024). Spider nest identities are represented by recursively defined spider-nest maps $k$8, whose nested graphical structure captures all non-empty subsets of $k$9 outputs (Kissinger et al., 2024). The S4 rule gives the minimal complete extension needed to derive all spider nest identities at the third level of the Clifford hierarchy, and the resulting scalable calculus is used to characterize transversal diagonal gates implementable in arbitrary CSS codes (Kissinger et al., 2024). The cited description explicitly treats these objects as “contours” or nested subdiagrams, suggesting a specialized contour usage based on recursive graphical enclosure (Kissinger et al., 2024).

ZX methods also encode CSS codes directly. CSS code encoders can be represented in phase-free ZX normal form, and encoder maps support a bidirectional rewrite rule: for any logical ZX diagram $l$0, there is a unique physical ZX diagram $l$1 such that $l$2 (Huang et al., 2023). This permits graphical derivations of code morphing and gauge fixing, including transformations between the Steane code and the quantum Reed-Muller code (Huang et al., 2023). In this setting, contour-like reasoning takes the form of local unfusing, inserting identity spiders, cutting edges, and measuring or fixing gauge spiders to pass between equivalent encoders (Huang et al., 2023).

Holographic quantum error-correcting codes provide a further geometric instance. The pentagon holographic code can be expressed natively as a ZX-diagram by representing each six-qubit perfect tensor as a graph-state-like ZX component and gluing these along a $l$3 hyperbolic tessellation (Wan et al., 8 Jan 2026). Pauli webs overlaid on the ZX-diagram visualize stabilizers and logical operators; Rényi entropies are computed by contracting copies of the diagram; and toy models of black holes and wormholes are analyzed by removing or fusing horizon legs and simplifying the resulting diagrams (Wan et al., 8 Jan 2026). Motivated by this structure, new code families are built from ZX-diagrams on dual hyperbolic tessellations and studied with belief propagation decoders (Wan et al., 8 Jan 2026). Here the contour aspect is geometric in a literal sense: the global layout of the ZX network reflects code architecture, entanglement structure, and logical support.

6. Applications, optimization, and computational limits

ZX contour diagrams, in the broad sense of topological ZX representations, are used operationally in optimization and simulation. For tensor-network simulation, circuits are translated into graph-like ZX-diagrams and then simplified and sparsified using local complementation rules. On Sycamore circuits of depth 20, this improves contraction cost by an average factor of $l$4, with peak improvement up to $l$5 (Cam et al., 2023). For Clifford+T classical simulation, optimized cutting of ZX-diagrams assigns and propagates weights to vertices to determine which cuts most effectively reduce T-count; on small circuits the heuristic finds the optimal set of cuts $l$6 of the time, and on pseudo-structured benchmarks it achieves an effective efficiency $l$7, compared with $l$8 for the conventional BSS-style approach cited there (Sutcliffe et al., 2024).

In compilation, contour structure also governs two-qubit cost. Heuristics based on local complementation and pivoting can reduce the number of two-qubit gates by as much as $l$9 compared with current ZX-calculus approaches, while also improving the results of the optimization technique of Nam et al. for some circuits by up to $R_Z^{(n,m)}(\alpha)$0 (Staudacher et al., 2023). In hardware-adaptive extraction, the alternating scheme reports that routed Approximate Success Probability always improves over default extraction on the random Clifford+T instances used there, and standard benchmarks show significant fidelity improvements of up to $R_Z^{(n,m)}(\alpha)$1 on deep circuits (Schmid et al., 27 Jan 2026).

These practical gains coexist with a sharp negative result. Circuit extraction from arbitrary ZX-diagrams can be $R_Z^{(n,m)}(\alpha)$2-hard (Beaudrap et al., 2022). Efficient extraction is known only for subclasses with structural promises such as gFlow, and the general hardness result shows that one should not expect a polynomial-time procedure for translating an arbitrary unitary ZX-diagram into a comparable circuit (Beaudrap et al., 2022). This suggests a fundamental division within the subject: contour reasoning is powerful precisely because ZX diagrams can move far beyond circuit-like structure, but that same representational freedom creates worst-case barriers for generic extraction.