Fact-checked by Grok 2 weeks ago

ZX-calculus

The ZX-calculus is a graphical language for reasoning about linear maps between qubits, representing quantum operations as string diagrams known as ZX-diagrams.^[1] Introduced by Bob Coecke and Ross Duncan in 2009, it axiomatizes the complementarity of quantum observables using dagger symmetric monoidal categories and provides a universal framework for multi-qubit systems that simplifies derivations in quantum computation and information theory.^[1] The calculus decomposes standard quantum logic gates into primitive components called Z-spiders and X-spiders, which encode phase shifts and interact via rewriting rules to manipulate diagrams equivalently.^[2] Developed within the paradigm of categorical quantum mechanics, the ZX-calculus emerged from efforts to formalize quantum protocols graphically, with its initial axioms focusing on Frobenius algebras and Hopf laws to capture entanglement and measurement.^[1] Over time, it has been extended for broader applicability, including completeness proofs for stabilizer quantum mechanics in 2014, for Clifford+T quantum operations in 2018, for full pure qubit quantum mechanics in 2020, and for arbitrary finite-dimensional Hilbert spaces in 2024, ensuring that any equality of diagrams can be proven using the rules without reference to matrix representations. These advancements, including the addition of supplementary rules such as the two axioms for Clifford+T completeness, have made it a foundational tool in quantum software and hardware design.^[3]^[4]^[5] Key features of the ZX-calculus include its soundness and completeness with respect to the category of finite-dimensional Hilbert spaces over complex numbers, allowing for visual proofs of quantum identities that are often more intuitive than algebraic ones.^[2]^[5] It supports scalable representations for arbitrary numbers of qubits and integrates with tensor network methods, enabling efficient classical simulation of quantum circuits.^[6] The diagrammatic approach reveals underlying structures in quantum gates, such as bialgebraic interactions, which facilitate automated simplification and error analysis.^[7] In applications, the ZX-calculus is widely used for quantum circuit optimization, reducing the T-gate count essential for fault-tolerant quantum computing on noisy hardware.^[2] It models surface code lattice surgery for error-corrected quantum computation, aligning directly with topological operations in measurement-based paradigms.^[8] Additionally, it aids in quantum foundations research, mixed-state extensions for open quantum systems, and as an intermediate representation in compilers like PyZX for practical quantum programming.^[2]

Informal Introduction

Generators

The generators of the ZX-calculus form the foundational primitives for building ZX-diagrams, which visually represent linear maps on qubit systems within the framework of categorical quantum mechanics. These include Z-spiders, X-spiders, Hadamard boxes, and wires, each encoding specific quantum operations that capture the structure of Clifford+T quantum circuits and beyond. Introduced in the seminal work on interacting quantum observables, these elements allow for a graphical syntax that mirrors tensor network representations while enabling rigorous algebraic manipulation.^[1] The Z-spider is depicted as a white vertex linked to an arbitrary number of input and output wires, symbolizing a generalized phase gate aligned with the computational (Z) basis. For a Z-spider with m inputs and n outputs parameterized by a phase angle α ∈ [0, 2π), the corresponding linear map is defined as

Z_{m,n}(\alpha) = |0^{\otimes n}\rangle \langle 0^{\otimes m}| + e^{i\alpha} |1^{\otimes n}\rangle \langle 1^{\otimes m}|,

where the map projects onto the all-zero and all-one basis states, applying the phase shift only to the latter while annihilating all other input states. This construction ensures that Z-spiders naturally implement copy and deletion operations in the Z-basis, such as the identity map for α = 0 or the single-qubit phase gate for m = n = 1.^[1] The X-spider, illustrated as a green vertex with flexible connectivity to wires, generalizes the Hadamard-basis operations, fusing multiple qubits in the X-basis defined by the states |+⟩ = (|0⟩ + |1⟩)/√2 and |-⟩ = (|0⟩ - |1⟩)/√2. Its matrix form for m inputs and n outputs with phase α is

X_{m,n}(\alpha) = |+^{\otimes n}\rangle \langle +^{\otimes m}| + e^{i\alpha} |-^{\otimes n}\rangle \langle -^{\otimes m}|,

yielding analogous copy and deletion behaviors in the X-basis and enabling representations of operations like the CNOT gate when combined appropriately.^[1] The Hadamard box, or H-box, appears as a labeled rectangular element connecting a single input wire to a single output wire, embodying the unitary Hadamard transformation that interchanges the Z- and X-bases:

H = \frac{1}{\sqrt{2}} \begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix}.

This generator facilitates basis rotations within diagrams, allowing Z-spiders to be converted to equivalent X-spider forms and vice versa, which is essential for simplifying expressions across bases.^[1] Wires serve as the connective tissue, each representing the identity morphism on the qubit Hilbert space ℂ², with parallel wires denoting tensor products thereof. Unlike traditional circuit notations, ZX-calculus wires lack a rigid distinction between inputs and outputs, as the semantics incorporate partial traces (via diagrammatic caps and cups) to handle connectivity and marginalization flexibly.^[1]

Composition

In the ZX-calculus, diagrams are constructed by combining generators through sequential and parallel composition, which provide the foundational syntax for building complex quantum processes. Sequential composition connects the output wires of one diagram to the input wires of another, represented graphically by stacking the diagrams vertically, with the overall diagram read from bottom to top. This operation corresponds to matrix multiplication, where if A is placed above B, the resulting diagram represents the composite map A \cdot B.^[1] Parallel composition places diagrams side by side, juxtaposing their wires without connection, which graphically aligns with arranging components horizontally. This corresponds to the tensor product of linear maps, denoted A \otimes B, allowing the representation of multi-qubit systems as independent subsystems.^[1] Together, these compositions enable the assembly of arbitrary qubit linear maps from simpler generators like spiders.^[1] Bending rules permit wires to curve freely in diagrams without altering their semantic meaning, facilitated by specific diagrammatic elements known as caps and cups. A cap diagram, depicted as a curved connection merging two input wires into one output, represents the unnormalized map \sum_i |i\rangle \langle i i |, while a cup diagram, shown as a split from one input to two outputs, represents the unnormalized map \sum_i |i i \rangle \langle i |. These elements enforce the compact closed structure of the underlying category, allowing inputs and outputs to be interchanged via duality.^[1] The yanking rule, which straightens a bent wire formed by a cup followed by a cap (or vice versa), preserves the diagram's interpretation as the identity map.^[1] The partial trace operation in ZX-diagrams discards selected wires to trace out subsystems, effectively reducing the dimensionality of the represented map. This is achieved by connecting the wire to be traced to a dangling end, where the open termination implies summation over the basis states of that subsystem, corresponding to the quantum partial trace. Such constructions leverage caps and cups to close loops on discarded wires, ensuring the diagram remains well-defined within the monoidal category. This mechanism supports applications like decoherence modeling without explicitly computing traces algebraically.

Topological Invariance

In the ZX-calculus, topological invariance refers to the principle that the semantic interpretation of a ZX-diagram remains unchanged under continuous deformations of its graphical representation, as long as the connectivity between components is preserved. This is formalized by the T-rule, which states that "only the topology matters," allowing arbitrary stretching, bending, rotating, or braiding of wires without altering the underlying linear map they represent. Such deformations, known as planar isotopies, ensure that diagrams are equivalent if one can be continuously transformed into the other while maintaining planarity and avoiding wire crossings. This invariance is justified by the underlying dagger compact closed structure of the category, where equations hold up to isotopy, as established in the foundational presentation of the calculus.^[1] For instance, a straight wire connecting two spiders is semantically identical to a curved or looped wire between the same points, as the deformation does not affect the matrix representation. Similarly, spider fusion—where adjacent Z- or X-spiders connected by a single wire merge into a single spider with combined legs—preserves the diagram's meaning regardless of the wire's layout, relying on the S-rules (spider fusion rules) that are invariant under such topological changes. These examples illustrate how the calculus abstracts away from rigid geometric coordinates, emphasizing combinatorial connectivity over precise positioning.^[1] This topological invariance plays a crucial role in proof techniques within the ZX-calculus, enabling researchers to visualize and manipulate quantum protocols solely based on their topological structure, without dependence on specific coordinate systems or layouts. It facilitates intuitive reasoning about quantum circuits and observables, such as deriving commutation relations through diagrammatic isotopies rather than algebraic manipulation. However, the standard ZX-calculus is inherently limited to planar diagrams, as non-planar configurations (e.g., those requiring wire crossings) cannot be represented without extensions; for such cases, braided variants of the ZX-calculus have been developed to handle topological quantum computing scenarios involving braid groups.^[1]^[9]

Diagram Rewriting

Diagram rewriting in the ZX-calculus involves applying local rules to transform ZX-diagrams while preserving their semantic meaning, enabling simplification and equivalence proofs through intuitive graphical manipulations.^[1] These rules operate on the generators—spiders and Hadamard boxes—allowing structural changes that reduce diagram complexity without altering the underlying linear map. Basic techniques include fusion of compatible elements and propagation of phases, which facilitate the decomposition and recombination of quantum operations.^[1] One fundamental rewriting rule is spider fusion, which merges two adjacent spiders of the same color (Z or X) connected by one or more wires into a single spider. The resulting spider has a phase equal to the sum of the original phases, and its arity increases by one for each connecting wire (inputs and outputs combined). For instance, if a Z-spider with phase \alpha and a Z-spider with phase \beta share a wire, they fuse into a Z-spider with phase \alpha + \beta and the total number of legs adjusted accordingly:

\begin{tikzpicture} \draw (0,0) -- (0,1); \draw (1,0) -- (1,1); \node[circle,draw,fill=green] at (0,0.5) {$\alpha$}; \node[circle,draw,fill=green] at (1,0.5) {$\beta$}; \draw (0.5,0.5) -- (0.5,0.5); % connecting wire implied \end{tikzpicture} \quad = \quad \begin{tikzpicture} \draw (0,0) -- (0,1); \draw (1,0) -- (1,1); \node[circle,draw,fill=green] at (0.5,0.5) {$\alpha + \beta$}; \end{tikzpicture}

This rule, part of the S1 axiom in the original ZX-calculus, is essential for eliminating redundant structure and is applicable to both Z- and X-spiders symmetrically.^[1] Spider fusion extends to higher-arity cases, where multiple connections lead to arity addition minus the fused legs, promoting efficient diagram normalization. The bialgebra laws govern interactions between Z- and X-spiders, leveraging their algebraic structure as complementary Frobenius algebras. Specifically for Z-spiders, which encode copying in the Z-basis, they satisfy the bialgebraic commutation ( \Delta \otimes \mathrm{[id](/page/id)} ) \circ \mu = ( \mathrm{[id](/page/id)} \otimes \Delta ) \circ \mu, where \mu is the multiplication (merging legs) and \Delta is the comultiplication (splitting legs). This manifests graphically as a Y-shaped equivalence, allowing a Z-spider to distribute its copying operation across wires:

\begin{tikzpicture} \node[circle,draw,fill=green] at (0,1) {}; \draw (0,1) -- (0,0); \draw (-0.5,1) -- (-0.5,2); \draw (0.5,1) -- (0.5,2); \draw (-0.5,2) -- (-1,2.5); \draw (-0.5,2) -- (0,2.5); \end{tikzpicture} \quad = \quad \begin{tikzpicture} \node[circle,draw,fill=green] at (0,0) {}; \draw (0,0) -- (0,1); \draw (-0.5,0) -- (-0.5,-1); \draw (0.5,0) -- (0.5,-1); \draw (-0.5,-1) -- (-1,-1.5); \draw (0.5,-1) -- (0,-1.5); \end{tikzpicture}

This rule, derived from the strong complementarity in the ZX-calculus, enables Z-spiders to "copy" phases or states intuitively, forming the basis for deriving more complex identities like the Hopf law.^[1] It highlights the diagrammatic representation of the Z-algebra's special dagger Frobenius structure, crucial for qubit operations. Phase teleportation provides a method to relocate phases across Hadamard (H) boxes, which interchange Z- and X-spiders, using triangle identities from the calculus rules. This involves applying the \pi-copy and phase-flip rules (K1 and K2) to propagate a phase \alpha through an H-box, effectively teleporting it while potentially negating the phase via an intervening \pi-spider:

\mathrm{H} \circ Z(\alpha) = X(\alpha) \circ \mathrm{H}, \quad \text{but with teleportation via } Z(\pi) \circ \mathrm{H} = \mathrm{H} \circ Z(-\alpha).

The process relies on the bialgebra and scalar rules to maintain equivalence, allowing phases to move non-locally in the diagram without changing the overall computation.^[10] This technique simplifies circuits by consolidating phases, as seen in optimizations where multiple T-gates (phase \pi/4) combine or cancel.^[10] An initial example of these rewritings is the representation of the CNOT gate, which can be expressed as two phase-free Z-spiders (each with one input and one output) connected by a wire, sandwiched between H-boxes on the target qubit: \mathrm{CNOT} = \mathrm{H}_{\mathrm{target}} \circ \mathrm{CZ} \circ \mathrm{H}_{\mathrm{target}}, where CZ is the connected Z-spiders. Applying spider fusion and bialgebra laws simplifies this to a direct Z-X spider pair, confirming the gate's action as a controlled-X operation.^[1] This decomposition illustrates how rewriting reveals the topological and algebraic underpinnings of standard quantum gates.

Historical Development

Origins

The ZX-calculus emerged from the broader framework of categorical quantum mechanics (CQM), developed by Bob Coecke and Ross Duncan around 2008, which extended Roger Penrose's tensor notation into a graphical language for quantum processes using category theory.^[11]^[12] This approach aimed to model quantum information flows diagrammatically, emphasizing compositionality and complementarity between observables. The ZX-calculus itself was introduced by Bob Coecke and Ross Duncan in their 2007 preprint "A graphical calculus for quantum observables", formalized in the 2009 paper "Interacting Quantum Observables" (published 2011 in New J. Phys.), which explores its limitations for Clifford + T quantum mechanics.^[13]^[1]^[14] The initial motivation was to create a graphical alternative to traditional matrix algebra for representing qubit computations involving Clifford and T gates, overcoming the shortcomings of density matrix visualizations that struggle with open systems and multi-partite entanglement. Early work applying the ZX-calculus included explorations of its use in measurement-based quantum computing, highlighting its potential for simplifying proofs in quantum error correction and measurement-based computation, distinct from the informal generators like Z- and X-spiders briefly referenced in introductory overviews.

Key Milestones

In 2013, Miriam Backens proved the completeness of the ZX-calculus for the Clifford fragment, which corresponds to pure-state stabilizer quantum mechanics, allowing full graphical reasoning for stabilizer circuits without reference to matrices.^[15] In 2017, Sheung Chun Ng and Quanlong Wang established universal completeness of the ZX-calculus for pure qubit quantum mechanics, demonstrating that it captures all unitary quantum operations up to global scalars.^[16] Building on this, also in 2017 (published 2018), Emmanuel Jeandel, Dominic Miller, and Simon de Féligonde provided a complete axiomatization for the Clifford+T fragment.^[17] The scope of the ZX-calculus has been extended to higher-dimensional systems (qudits) in subsequent works, including graphical representations for measurement-based quantum computation and resource states in such models. Recent advancements from 2023 to 2025 include AI-assisted rewriting techniques, such as reinforcement learning for optimizing ZX-diagram transformations, as detailed in a 2025 preprint.^[18] Growing interest in the ZX-calculus is evidenced by the weekly ZX Seminar, initiated in 2023 at the University of Oxford, providing a virtual venue for researchers to share work on graphical methods for quantum information.^[19]

Formal Definition

Categorical Framework

The ZX-calculus is a graphical language for representing linear maps within the category FHilb, which consists of finite-dimensional Hilbert spaces as objects and linear maps as morphisms, equipped with a dagger symmetric monoidal structure.^[1] This framework allows diagrams to encode quantum processes abstractly, with composition corresponding to sequential application of maps and tensor product to parallel execution.^[2] FHilb serves as the ambient category, providing the necessary structure for the calculus to manipulate multi-qubit systems diagrammatically while preserving monoidal properties.^[1] At the core of the ZX-calculus are its generators, which are presented as specific objects within this categorical setting. The Z-spider, depicted as a green node with multiple legs, functions as a comonoid in the computational (Z) basis, capturing the algebraic structure of Z-observables with an associated phase parameter.^[1] Complementarily, the X-spider, shown as a red node, acts as a comonoid in the Hadamard-rotated (X) basis, forming a dual pair with the Z-spider under the Hadamard gate, which interchanges the two bases categorically.^[2] These generators embody the essential building blocks for expressing Pauli observables and their interactions in a monoidal context.^[1] Syntactically, the ZX-calculus is formalized as a PROP (a symmetric strict monoidal category where objects are natural numbers representing the number of wires, and morphisms are diagrams connecting inputs to outputs).^[1] Wires serve as the identity morphisms on single objects, while diagrams compose horizontally via domain-codomain matching and tensor vertically by juxtaposing structures, enabling the representation of arbitrary multi-wire linear maps.^[2] This PROP structure ensures that the calculus is generated by the spiders and wires, with permutations arising from the symmetric monoidal tensor.^[1] The axioms governing the ZX-calculus enforce equalities between diagrams, establishing its categorical consistency. Central to this are the Frobenius axioms, which include spider fusion (merging adjacent same-color spiders by summing phases) and the (S) rules for copying and deleting via the comonoid structure, ensuring the generators satisfy Frobenius reciprocity.^[2] Complementarity between Z- and X-spiders is axiomatized by the bialgebra laws, which allow commuting connections between opposite-color spiders, and the Hopf law, which simplifies such interactions by removing excess wires.^[1] Additionally, the dagger-compact structure provides adjoints through the dagger functor and duality via cup and cap morphisms, with the yanking axiom straightening bent wires to enforce topological invariance.^[1] These axioms collectively define the rewrite rules that make the calculus a sound and complete language for the targeted quantum operations.^[2]

Semantics and Interpretation

The semantics of the ZX-calculus provides a denotational interpretation that maps ZX-diagrams to linear maps in the category FHilb of finite-dimensional Hilbert spaces and linear maps, thereby connecting the graphical language to concrete quantum operations.^[1] This interpretation functor assigns to each generator a specific matrix representation, allowing entire diagrams to be evaluated as compositions and tensor products of these maps.^[1] The Z-spider with n inputs, m outputs, and phase \alpha is interpreted as the linear map Z_{n m}(\alpha) that sends the all-zero state |0\dots0\rangle to itself and the all-one state |1\dots1\rangle to e^{i\alpha} |1\dots1\rangle, while mapping all other basis states to zero; this generalizes the diagonal phase gate \operatorname{diag}(1, e^{i\alpha}) for single qubits.^[1] Similarly, the X-spider X_{n m}(\alpha) acts on the Hadamard basis, sending the all-plus state |+\dots+\rangle to itself and the all-minus state |-\dots-\rangle to e^{i\alpha} |-\dots-\rangle, with other basis states to zero, generalizing the Bell-state projector.^[1] The Hadamard gate H, represented as a special box or edge color change, is interpreted as the matrix

H = \frac{1}{\sqrt{2}} \begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix},

which swaps the Z- and X-bases, enabling the transformation between spider types under rewriting.^[1] Full ZX-diagrams are evaluated by composing these generators along wires (sequential composition \circ) and tensoring across parallel wires (\otimes), yielding a matrix in \operatorname{Hom}(\mathbb{C}^{2^k}, \mathbb{C}^{2^l}) for a diagram with k inputs and l outputs.^[1] Two ZX-diagrams are semantically equivalent if their interpreting matrices are equal up to a global scalar phase factor e^{i\phi}, reflecting the physical indistinguishability of quantum states differing only by such phases.^[1] For open quantum systems, the interpretation incorporates the compact closed structure of FHilb, where unused wires correspond to partial traces over ancillary subsystems, allowing diagrams to represent channels from input to output Hilbert spaces.^[1] The soundness of the ZX-calculus axioms follows from the fact that all rewriting rules preserve the denotational semantics in FHilb; for instance, the bialgebra law, which equates the antipode composition of Z- and X-spiders, holds as a scaled bialgebra relation in the Hilbert space representation.^[1] This ensures that graphical manipulations correspond exactly to equalities of quantum operations.^[1]

Properties

Completeness Results

The phase-free fragment of the ZX-calculus, consisting solely of Z- and X-spiders without parameters, is complete for stabilizer quantum mechanics. This means that every Clifford unitary on qubits can be represented as a ZX-diagram, and any equality between such diagrams that holds in the matrix formalism can be derived using the graphical rewrite rules. The proof establishes this completeness by showing that every diagram can be normalized to a unique gcd-normal form, where the greatest common divisor of the degrees of connected spiders determines the structure, allowing systematic verification of equalities.^[15] Extending the ZX-calculus by introducing phase parameters on Z-spiders achieves completeness for the Clifford+T fragment of quantum mechanics. This extension enables the representation of arbitrary single-qubit gates from the Clifford+T set combined with CNOT gates, up to global scalar factors, covering a universal gate set for quantum computation. Completeness is attained by supplementing the standard rules with two additional axioms—the pivot rule and a specific phase fusion rule—allowing derivation of all relations in a complete generating set for Clifford+T circuits.^[17] In 2022, the ZX-calculus was shown to be complete for the overall pure qubit quantum mechanics, providing a full axiomatization where any equality in the category of pure qubit states and processes can be proven diagrammatically using the rules, including phases. This result was obtained via a translation to the complete ZW-calculus and verification of key circuit identities.^[20] Further extensions generalize the ZX-calculus to higher-dimensional systems (qudits) through the use of generalized spiders, which adapt the Z- and X-generators to prime dimensions d > 2. For the stabilizer fragment in dimension 3 (qutrits), completeness has been proven, demonstrating that all stabilizer operations can be expressed and equalities verified diagrammatically, with the proof relying on a dimension-specific adaptation of normalization techniques. Recent developments have also established completeness results for measurement-based quantum computation (MBQC) within the ZX framework, where diagrams capture universal MBQC patterns including measurements and corrections.^[2] Despite these advances, gaps remain in the completeness of the standard ZX-calculus for general qudits. While completeness holds for the full unitary group in qubits, universal completeness for qudit operations with d > 2 required extensions. In 2024, completeness was established for finite-dimensional Hilbert spaces using an extended ZX-calculus incorporating mixed-dimensional Z-spiders and qudit X-spiders, enabling diagrammatic proofs for all linear maps in finite dimensions. Ongoing research continues to explore minimal axiomatizations and applications beyond prime dimensions.^[20]^[5]

Simplification Rules

The simplification rules of the ZX-calculus constitute the axiomatic foundation for manipulating diagrams through equational reasoning, enabling the proof of equalities between quantum processes represented graphically. These rules are sound with respect to the categorical semantics, where diagrams interpret as linear maps on Hilbert spaces, and they facilitate reductions that preserve computational equivalence. The core axioms encompass spider fusion, the Hopf law for antipodes, and the golden rules linking Z- and X-structures via Hadamard gates, as formalized in the original presentation of the calculus.^[21]^[22] Spider fusion is a primary axiom allowing the coalescence of adjacent spiders of the same color sharing a wire, which combines their phases additively and merges their legs. For Z-spiders, this yields:

\begin{array}{c} \begin{tikzpicture}[baseline=(current bounding box.center), scale=0.7] \draw (0,0) -- (0,1); \draw (1,0) -- (1,1); \node[zx z spider, legs=2, phase=\alpha] at (0,0) {}; \node[zx z spider, legs=2, phase=\beta] at (1,0) {}; \end{tikzpicture} = \begin{tikzpicture}[baseline=(current bounding box.center), scale=0.7] \draw (0,0) -- (0,1); \draw (1,0) -- (1,1); \node[zx z spider, legs=0, phase=\alpha + \beta] at (0.5,0) {}; \end{tikzpicture} \end{array}

Generalizing to m inputs/outputs on the left and n on the right, the rule states Z_m(\alpha) \bullet Z_n(\beta) = Z_{m+n-2}(\alpha + \beta), with an analogous form for X-spiders; this reflects the multiplicative structure of the underlying Frobenius algebras.^[21]^[22] The Hopf law addresses interactions between opposite-color spiders, leveraging the antipode to simplify connectivity: when a Z-spider and an X-spider are fully connected by k wires, the diagram reduces to a scalar times an identity on k \mod 2 wires, as

(Z \otimes X^\dagger) \circ ( \delta_Z \otimes \delta_X ) = d \cdot \epsilon_Z \otimes \epsilon_X,

where \delta and \epsilon denote comultiplication and counit, and d is the dimension; this enables removal of even pairings and is crucial for eliminating redundant wires.^[21]^[22] The golden rules integrate Hadamard gates (H) to relate Z- and X-spiders, forming the "golden" bridge between complementary observables. These include the bialgebra law, where connecting the Z-comultiplication to the X-multiplication produces a scaled Z-spider:

(\delta_Z \otimes id) \circ (id \otimes \delta_X^\dagger) \circ \sigma = \sqrt{d} \cdot Z_2(0),

and the special dagger property, ensuring spiders with two legs and zero phase act as identities (removable). Additionally, Hadamard conjugation swaps colors while preserving phases: H \circ Z(\alpha) = X(\alpha) \circ H, allowing global color changes via H boxes.^[21]^[22] Derived from these axioms, the color swap rule extends this by fusing Hadamard gates with spiders to interchange Z and X components directly, streamlining rewrites across color domains. Phase addition follows from fusion and scalar rules, where triangular configurations (bialgebra triangles) enable combining phases \alpha + \beta = \gamma in connected phase gadgets, as scalars multiply under composition.^[22] These rules support canonical normal forms for simplification. In the Clifford fragment, diagrams reduce to a phase-free form using only Z-spiders (with phases 0 or \pi) connected by Hadamard edges, equivalent to graph-state representations via local complementations.^[23] For general qubit unitaries, gadget decomposition isolates non-Clifford elements into phase spiders (with arbitrary phases) sandwiched between Clifford layers, yielding a form U = C_1 P C_2 where C_i are Cliffords and P a diagonal phase gate, achievable through iterative application of the axioms.^[22] The rules are sound by interpretive fidelity to matrix mechanics and complete for covered fragments, such as the stabilizer (Clifford) sector, where any equality provable algebraically follows diagrammatically without supplements.^[23] For the Clifford+T fragment, derived rules like the T-gadget axiom ensure completeness, covering approximate universal quantum computation.^[22]

Applications

Quantum Circuit Optimization

ZX-calculus provides a graphical framework for optimizing quantum circuits by representing them as diagrams that can be simplified using rewrite rules, leading to reductions in gate counts and circuit depth. This approach decomposes circuits into spiders and phases, allowing for structural simplifications that preserve semantics while minimizing resource usage, particularly in noisy intermediate-scale quantum (NISQ) and fault-tolerant settings. Optimization typically involves converting a circuit to a ZX-diagram, applying rules to eliminate redundancies, and extracting an optimized circuit, often achieving superior results compared to traditional algebraic methods.^[7] In parameterized ZX-diagrams, phases are extracted from non-Clifford gates to minimize T-count, a critical metric for fault-tolerant quantum computing due to the high overhead of T-gates. This process uses gadget matching to identify and simplify phase gadgets—subdiagrams representing non-Clifford rotations—via rules like phase teleportation and spider fusion, reducing the number of T-gates needed for approximation. For instance, the PHAGE strategy applies spider nest identities to parameterized circuits, improving T-count on a majority of benchmark circuits by leveraging composite structures for more aggressive reductions. Overall, these techniques have demonstrated up to 50% T-count reduction on selected circuits, outperforming prior methods like window optimization.^[10]^[24]^[25] For Clifford subcircuits, optimization relies on local complementation and pivot rules, which manipulate the graph-like structure of ZX-diagrams to eliminate redundant Pauli spiders and CNOT gates. Local complementation inverts connections around a vertex, preserving the diagram's semantics, while pivoting removes pairs of connected spiders, reducing connectivity. These rules, applied iteratively, transform Clifford diagrams into canonical forms with minimal edges, achieving approximately 16% reduction in CNOT count and 30% in depth for pure Clifford circuits. Briefly referencing simplification rules from the ZX framework, these graph-theoretic operations enable efficient heuristics for large diagrams. Extending to full unitaries, circuit extraction from simplified ZX-diagrams uses optimization techniques like linear programming to approximate general rotations with minimal gates, akin to interior-point methods for solving the phase polynomial. This decomposes the diagram into Clifford and T-layers, minimizing overall gate overhead for arbitrary unitaries. In fault-tolerant compilation, ZX-optimization enforces nearest-neighbor CNOT constraints, reducing layout costs for surface code architectures. Case studies highlight practical impacts, such as optimizing QAOA circuits where ZX-reductions yield significant depth decrease by fusing mixers and cost Hamiltonians, enabling shallower implementations on NISQ hardware. Similarly, fault-tolerant QAOA variants benefit from T-count minimization, lowering error rates in variational algorithms. Recent advances include 2024 hybrid classical-quantum methods combining ZX with reinforcement learning, where agents learn rewrite sequences to achieve significant reductions in two-qubit gates for circuits up to 80 qubits, scalable via tree search integration. These approaches address post-2020 challenges in variational optimization, outperforming stochastic baselines.^[26]

Quantum Verification

ZX-calculus provides a graphical framework for equivalence checking of quantum circuits by translating them into ZX-diagrams and applying simplification rules to determine if two diagrams are equivalent, often reducing them to the identity diagram. This process involves decomposing circuits into Z- and X-spiders connected by wires and phases, then using rewrite rules such as the bialgebra rules or spider fusion to simplify the diagram while preserving semantics. For instance, verifying the equivalence of a swap gate circuit can be achieved by converting both the standard three-CNOT implementation and an alternative representation into ZX-diagrams, then confirming they simplify identically through rule applications. This method has been integrated into tools like MQT QCEC, where it excels for circuits with rational phase angles, enabling scalable verification of compilation flows.^[27]^[28] For measurement-based quantum computing (MBQC), a hybrid approach combining ZX- and ZH-calculus facilitates verification by modeling measurement patterns and post-selections graphically, often reducing the problem to solving equations over integer matrices. The ZH-calculus, an extension of ZX that incorporates H-boxes for classical nonlinearity and is complete for Clifford+T computations, allows MBQC protocols to be represented as diagrams where measurement outcomes correspond to integer linear constraints, enabling formal proofs of correctness without full state simulation. This reduction leverages the fact that ZH-diagrams are universal for matrices with integer entries in certain settings, such as qudit systems with prime dimension, making verification efficient for stabilizer-based MBQC.^[29] ZX-calculus has been applied to verify properties of quantum circuits in error correction, such as constructing and verifying encoding/decoding circuits for stabilizer codes, including surface codes, through diagram equivalences that confirm error detection and correction capabilities. It has also supported classical simulation efforts for complex circuits in quantum supremacy experiments.^[30] Recent developments in 2025 have integrated ZX-calculus with lattice surgery protocols for fault-tolerant verification, enabling graphical reasoning about merges and splits in surface code patches to prove fault-equivalence of fault-tolerant gates. This unification allows automated checking of modular fault-tolerant computations, reducing the need for low-level simulations and enhancing scalability for large-scale quantum hardware. In 2025, extensions include formalizing defect braiding in surface codes using ZX-calculus and string diagrams.^[8]^[31]

Tools and Implementations

PyZX

PyZX is an open-source Python library designed for the construction, visualization, simplification, and extraction of ZX-diagrams that represent quantum circuits using the ZX-calculus. Developed primarily by Aleks Kissinger and John van de Wetering, the library originated from research efforts beginning around 2017, with its formal introduction and initial release in 2019.^[32]^[33] It enables users to manipulate large-scale quantum computations by converting circuits into graphical ZX representations, applying automated rewriting strategies, and extracting optimized circuits back into executable formats.^[34] Key features of PyZX include rule-based rewriting, which applies ZX-calculus simplification rules such as spider fusion and pivot to reduce diagram complexity while preserving semantics.^[35] The library supports circuit extraction from simplified ZX-diagrams to standard quantum assembly language (QASM), facilitating integration into broader quantum workflows.^[36] Additionally, it provides visualization capabilities for ZX-diagrams using libraries like Matplotlib for rendering or TikZ for LaTeX-compatible outputs, aiding in the inspection and debugging of quantum structures.^[33] In terms of performance, PyZX excels in optimizing Clifford+T circuits, achieving reductions in T-depth ranging from 10x to over 100x in benchmark suites such as random Clifford circuits and quantum algorithms like Grover's search.^[7] These improvements stem from its graph-theoretic simplification techniques, which outperform traditional gate-level optimizers in T-gate minimization. PyZX integrates seamlessly with Qiskit via dedicated transpiler passes, allowing it to be used as a plugin for circuit optimization within IBM's quantum software ecosystem.^[37]^[38] The library's Python implementation, while flexible, can be slower for very large inputs (such as circuits with millions of gates) compared to compiled alternatives, and may encounter scalability challenges with high memory usage and extended computation times. For such cases, QuiZX, a Rust-based library, provides a high-performance alternative for ZX-calculus operations, including faster circuit optimization and classical simulation.^[39]^[40] Recent version 0.9.0, released on January 30, 2025, introduces new features including support for a Multigraph backend that allows multiple edges between nodes (e.g., for ZH- and ZW-diagrams), along with experimental functions such as extended gflow, Pauli flow, and 3D diagram drawing.^[41]

Other Software

Quantomatic was an early prototype tool developed for automated theorem proving and equational reasoning in graphical calculi, including the ZX-calculus.^[42] It supported the manipulation of string diagrams through a rewriting engine, allowing users to define rewrite rules and apply them semi-automatically to prove equalities in monoidal categories relevant to quantum information.^[42] Active development occurred primarily from 2012 to 2015, after which the project was archived, though its codebase remains available for reference in diagrammatic proof techniques.^[43] In commercial quantum software ecosystems, ZX-calculus has been integrated into major SDKs for circuit optimization. IBM's Qiskit framework includes extensions via transpiler passes that leverage ZX-calculus for reducing gate counts and improving circuit efficiency, with implementations building on PyZX for seamless incorporation into compilation workflows.^[44] Similarly, Quantinuum's pytket toolkit incorporates ZX-diagram representations to facilitate optimization and analysis of quantum operations, tailored for execution on their H-series trapped-ion hardware platforms.^[45] These integrations enable practitioners to apply ZX-based simplifications directly within industry-standard tools, enhancing scalability for near-term quantum devices. Emerging tools emphasize accessibility and education through web-based interfaces for ZX-calculus. ZXLab provides an interactive, browser-based environment for visualizing and simplifying quantum circuits using ZX-graphs, supporting automated optimizations, manual edits, and exports to formats like QASM and Qiskit code, with over 1,250 users and dedicated tutorials for learners.^[46] Likewise, ZX Calculator offers a lightweight web tool for creating, editing, and importing/exporting ZX-diagrams via PyZX JSON, featuring modes for graph manipulation and force-directed layouts to aid exploratory reasoning without local installation.^[47] These platforms address gaps in pre-2020 toolsets by prioritizing intuitive, no-code interactions for teaching ZX-calculus concepts and prototyping diagrams.

Categorical Quantum Mechanics

Categorical quantum mechanics (CQM) provides a foundational framework for modeling quantum processes using the language of dagger-compact categories, where physical systems are represented as objects and quantum operations as morphisms composed via string diagrams. This approach emphasizes the compositional structure of quantum mechanics, capturing phenomena like entanglement and superposition through graphical calculi in symmetric monoidal categories enriched with a dagger structure for adjoint processes. In this setting, quantum protocols such as teleportation and dense coding emerge naturally from the categorical axioms, enabling abstract reasoning about quantum information without direct reference to Hilbert spaces.^[12] The ZX-calculus emerges as a specialized graphical language within CQM, tailored specifically for multi-qubit quantum computation by restricting the general morphisms to "spider" diagrams that encode the Z (Pauli-Z) and X (Pauli-X) observables. While CQM accommodates arbitrary self-adjoint maps to represent measurements and channels in a broad categorical context, ZX-calculus simplifies this by using connected green spiders for Z-basis operations and red spiders for X-basis operations, enhancing efficiency for qubit-based systems through rule-based manipulations. This restriction allows for complete axiomatization of stabilizer quantum mechanics, where diagrams equate to linear maps in finite-dimensional Hilbert spaces.^[1] Shared between CQM and ZX-calculus are core concepts of complementary observables, exemplified by the Z and X bases, which satisfy strong complementarity axioms derived from interacting Frobenius algebras. These axioms ensure that the bases behave as unbiased phase groups, enabling the graphical derivation of key quantum effects like the Hopf law, which formalizes the non-commutativity of complementary measurements. ZX-calculus inherits CQM's high-level abstraction for diagrammatic proofs, but extends it with explicit phase parameters on spiders to handle unitary evolutions and scalar factors, facilitating practical computations in quantum circuit design.^[1]^[12]

Tensor Network Calculi

ZX-diagrams in the ZX-calculus can be interpreted as planar tensor networks, where the wires represent qubit dimensions and the Z- and X-spiders serve as higher-rank tensors with multiple input and output legs that encode linear maps between Hilbert spaces. A Z-spider with m inputs and n outputs, for instance, corresponds to a tensor of rank m + n that is symmetric under permutations of its Z-colored legs, allowing compact representation of phase gates and their generalizations. This mapping leverages the graphical composition of ZX-diagrams—where connecting wires corresponds to tensor contractions—to model quantum processes as interconnected tensors on a plane.^[48] The primary advantage of this perspective lies in the ZX-calculus's rewriting rules, which enable graphical optimizations that reduce the computational cost of tensor network contractions, such as by fusing adjacent spiders to lower effective bond dimensions and eliminate redundant paths.^[30] For example, rules like spider fusion merge tensors, potentially decreasing the dimension of intermediate contractions from exponential in the number of qubits to more manageable scales, facilitating efficient simulation of large circuits.^[49] These optimizations outperform standard tensor network methods in scenarios where planarity and qubit locality align, providing a visual and algebraic handle on contraction sequences without explicit matrix computations.^[30] This framework overlaps significantly with tensor network simulations of many-body quantum states, particularly matrix product states (MPS) and projected entangled pair states (PEPS), where ZX simplification rules compress representations of entangled states like the AKLT model, enabling diagrammatic computation of correlation functions and ground state properties.^[50] In one dimension, the AKLT state maps to an MPS with bond dimension 2, and ZX-diagrams reproduce its tensor structure through symmetric subspaces, allowing rewrite-based verification of translational invariance without numerical contraction.^[50] For two-dimensional systems, PEPS on lattices are similarly encoded, with ZX tools simplifying the network to extract physical observables efficiently.^[51] Extensions to the ZX-calculus, such as the ZXH-calculus introduced in 2022, incorporate non-local Hadamard spiders to handle hyperbolic network geometries, extending the language to represent states on non-Euclidean lattices like hexagonal tilings for enhanced many-body simulations.^[51] These developments allow diagrammatic reasoning for projectors and symmetries in curved spaces, updating earlier planar limitations and enabling applications in holographic models.^[50]

Algebraic Connections

Relation to Clifford Algebras

The phase-free fragment of the ZX-calculus, which omits phase parameters on spiders, provides a complete graphical language for stabilizer quantum mechanics, where the generators of the Clifford group—such as the Hadamard gate H, the phase gate S, and the controlled-NOT gate CNOT—are represented as specific ZX-diagrams without phases.^[15] For instance, the Hadamard gate corresponds to a bialgebra anticommutation relation between Z- and X-spiders, while S and CNOT emerge from spider fusions and connections.^[15] In this representation, X-spiders (green nodes) embody the Pauli X generators, with their arity determining the number of legs connected to input/output wires, while Z-spiders handle the complementary Pauli Z basis.^[15] Fusion of spiders, a core ZX rule allowing adjacent spiders of the same color to merge while adding their arities, directly corresponds to the multiplication of Pauli generators, preserving the algebraic structure of anticommuting basis elements.^[15] Similarly, the bialgebra laws in ZX-diagrams reflect the copy and sum operations inherent to the Frobenius structure in stabilizer mechanics. The completeness of the phase-free ZX-calculus for the Clifford fragment ensures that its graphical rewrite rules fully capture the identities of the Pauli group, such as the relations (e.g., X Z = -[Z X](/page/Z/X)) and the defining quadratic relations \gamma_i^2 = 1 for generators \gamma_i. These rules, including spider fusion, the Hopf law, and complementarity, provide a diagrammatic proof system equivalent to algebraic manipulations in the stabilizer formalism, enabling equivalence checking and simplification of stabilizer circuits.^[15] Extensions of the ZX-calculus to include scalar phases on spiders allow representation of the Clifford+T group, incorporating non-real phases (e.g., multiples of \pi/4).^[17] In this augmented setting, phases introduce complex coefficients aligned with the cyclotomic field \mathbb{Q}(e^{i\pi/4}), enabling proofs of completeness for Clifford+T quantum operations.^[17]

Hopf Algebra Structures

The ZX-calculus derives much of its expressive power from the underlying Hopf algebra structures associated with its spiders, which provide a categorical framework for reasoning about quantum processes. Specifically, the Z-spiders (green nodes) form a commutative special dagger-Frobenius algebra in the computational basis, equipped with a Hopf structure that captures classical copying and deletion operations. The comultiplication \Delta on the basis projector |0\rangle\langle 0| is given by \Delta(|0\rangle\langle 0|) = \sum_i |i i\rangle\langle i i|, reflecting the copying of classical bits in the Z-basis, while the antipode S acts on phase factors as S(e^{i\alpha}) = e^{-i\alpha}, ensuring the invertibility required for the Hopf law.^[1]^[52] This Hopf structure for Z-spiders is complemented by a dual Hopf algebra for X-spiders (red nodes), achieved through the Hadamard gate, which interchanges the Z and X bases and thus maps one algebra to the dual of the other. The Hadamard operator H = \frac{1}{\sqrt{2}} \begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix} conjugates the Z-Frobenius algebra to the X-Frobenius algebra, preserving the Hopf properties such as coassociativity and the antipode, while adapting the comultiplication to the superposition basis |+\rangle, |-\rangle. This duality underpins the complementarity of observables in quantum mechanics and allows seamless translation between basis-dependent representations within the ZX framework.^[1]^[52] The core axioms of the ZX-calculus, including the bialgebra and Hopf rules, directly emerge from the identities of these interacting Hopf algebras, providing a sound foundation for diagrammatic manipulations. For instance, the bialgebra rule—composing the multiplication of one algebra with the comultiplication of the dual—follows from the compatibility condition between the Z and X structures, enabling quantum teleportation protocols by effectively transferring states across spiders without explicit measurement. Similarly, the Hopf rule, which connects the antipode to the unit and counit, facilitates spider fusion by allowing phase additions and wire mergers, simplifying diagrams while preserving semantics. These derivations ensure that ZX rewritings correspond to algebraic manipulations in the Hopf category, guaranteeing correctness for quantum circuit optimizations.^[1]^[52] The Hopf algebra framework in ZX-calculus generalizes naturally to representations of finite groups, extending beyond qubits to qudits and higher-dimensional systems. In this setting, spiders are parameterized by finite abelian groups G, where Z-spiders implement copying over group elements via comultiplication \Delta(g) = g \otimes g in the group algebra \mathbb{C}[G], and the antipode S(g) = g^{-1} inverts group elements, accommodating non-trivial phases from group characters. This generalization captures broader quantum resources, such as those in Spekkens' toy model or multi-level systems, while maintaining the interacting Hopf structure for completeness in algebraic verifications.^[52]

References

[1]
[0906.4725] Interacting Quantum Observables: Categorical Algebra ...
Jun 25, 2009 · This paper has two tightly intertwined aims: (i) To introduce an intuitive and universal graphical calculus for multi-qubit systems, the ZX-calculus.Missing: original | Show results with:original
[2]
[2012.13966] ZX-calculus for the working quantum computer scientist
Dec 27, 2020 · The ZX-calculus is a graphical language for reasoning about quantum computation that has recently seen an increased usage in a variety of areas.
[3]
A Complete Axiomatisation of the ZX-Calculus for Clifford+T ...
We make the ZX-Calculus, a diagrammatic language introduced by Coecke and Duncan, complete for the so-called Clifford+T quantum mechanics by adding two new ...Missing: original paper<|control11|><|separator|>
[4]
The ZX-calculus
The ZX-calculus is a graphical language that goes beyond circuit diagrams. It 'splits the atom' of well-known quantum logic gates to reveal the compositional ...Tutorial · The ZX Seminar · Publications · Accessibility
[5]
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
Jun 4, 2020 · In this paper, we give a technique for optimising quantum circuits that first breaks the gates open to reveal a graph-like structure underneath.
[6]
The ZX calculus is a language for surface code lattice surgery
Jan 9, 2020 · In this paper we demonstrate that the operations of the ZX calculus --- a form of quantum diagrammatic reasoning based on bialgebras --- match exactly the ...
[7]
[2103.07264] Quantum and braided ZX calculus - arXiv
Mar 11, 2021 · Title:Quantum and braided ZX calculus ... Abstract:We revisit the notion of interacting Frobenius Hopf algebras for ZX-calculus in quantum ...
[8]
[1903.10477] Reducing T-count with the ZX-calculus - arXiv
Mar 25, 2019 · Phase teleportation does not change the number or location of non-phase gates and the method also applies to arbitrary non-Clifford phase gates ...
[9]
https://arxiv.org/abs/2103.07264
[10]
[0808.1023] Categorical quantum mechanics - arXiv
Aug 7, 2008 · Authors:Samson Abramsky, Bob Coecke. View a PDF of the paper titled Categorical quantum mechanics, by Samson Abramsky and Bob Coecke. View PDF.Missing: Duncan | Show results with:Duncan
[11]
Interacting quantum observables: categorical algebra and ...
Interacting quantum observables: categorical algebra and diagrammatics. Bob Coecke and Ross Duncan. Published 14 April 2011 • Published under licence by IOP ...
[12]
A graphical approach to measurement-based quantum computing
Mar 28, 2012 · Abstract:Quantum computations are easily represented in the graphical notation known as the ZX-calculus, a.k.a. the red-green calculus.
[13]
The ZX-calculus is complete for stabilizer quantum mechanics - arXiv
Jul 26, 2013 · The ZX-calculus is a graphical calculus for reasoning about quantum systems and processes. It is known to be universal for pure state qubit quantum mechanics.
[14]
Entanglement and Quaternions: The graphical calculus ZQ - arXiv
Mar 22, 2020 · The ZX calculus, built from generalised Z and X rotations, has difficulty reasoning about arbitrary rotations. This contrasts with the cross ...Missing: Jeandel de Féligonde
[15]
Optimizing Quantum Circuits via ZX Diagrams using Reinforcement ...
Apr 4, 2025 · We introduce a framework based on ZX calculus, graph-neural networks and reinforcement learning for quantum circuit optimization.Missing: assisted 2023 2024
[16]
The ZX Seminar - The ZX-calculus
Our results single out ZX calculus as a tool to detect topological long-range entanglement by leveraging the advantages of diagrammatic reasoning against ...
[17]
A Complete Axiomatisation of the ZX-Calculus for Clifford+T ... - arXiv
May 31, 2017 · The completeness of the ZX-Calculus for Clifford+T quantum mechanics was one of the main open questions in categorical quantum mechanics. We ...
[18]
[2209.14894] Completeness of the ZX-calculus - arXiv
Sep 29, 2022 · In this thesis, we give the first complete axiomatisation the ZX-calculus for the overall pure qubit quantum mechanics, via a translation from ...Missing: 2020 | Show results with:2020
[19]
None
Summary of each segment:
[20]
[PDF] ZX-calculus for the working quantum computer scientist - arXiv
Dec 29, 2020 · The ZX-calculus is a graphical language for reasoning about quantum com- putation that has recently seen an increased usage in a variety of ...
[21]
https://arxiv.org/pdf/0906.4725
[22]
[PDF] Fast and Effective Techniques for T-Count Reduction via Spider ...
In this section, we describe how we applied the concept of T-count reduction via PHAGE tactics as part of a complete procedure to transform unitary circuits ...
[23]
https://arxiv.org/abs/1307.7048
[24]
A Review on Quantum Circuit Optimization using ZX-Calculus - arXiv
Sep 25, 2025 · We review ZX-based optimization of quantum circuits, categorizing them by optimization techniques, target metrics and intended quantum computing ...Missing: seminal | Show results with:seminal
[25]
[PDF] Optimizing ZX-diagrams with deep reinforcement learning
Sep 19, 2024 · In this work, we bring together ZX-diagrams with reinforcement learning, a machine learning technique designed to discover an optimal sequence ...
[26]
https://arxiv.org/abs/2312.11597
[27]
Quantum Circuit Equivalence Checking - MQT QCEC 3.3.1.dev13 ...
ZX-Calculus Equivalence Checker¶ · Most effective for: proving equivalence of two circuits involving many rotation gates with angles of the form π k for k ∈ N .
[28]
[PDF] Completeness of the ZH-calculus - Compositionality
Furthermore, we construct an extended version of the ZH-calculus that is complete with respect to matrices over any ring R where 1 + 1 is not a zero-divisor.Missing: Féligonde | Show results with:Féligonde
[29]
Graphical Structures for Design and Verification of Quantum Error ...
Nov 23, 2016 · We introduce a high-level graphical framework for designing and analysing quantum error correcting codes, centred on what we term the coherent parity check ( ...
[30]
[1904.04735] PyZX: Large Scale Automated Diagrammatic Reasoning
Apr 9, 2019 · In this paper we introduce PyZX, an open source library for automated reasoning with large ZX-diagrams.Missing: Python | Show results with:Python<|control11|><|separator|>
[31]
zxcalc/pyzx: Python library for quantum circuit rewriting and ... - GitHub
A Python tool implementing the theory of ZX-calculus for the creation, visualisation, and automated rewriting of large-scale quantum circuits.
[32]
[PDF] PyZX: Large Scale Automated Diagrammatic Reasoning
The ZX-calculus is a graphical language for reasoning about ZX-diagrams, a type of tensor networks that can represent arbitrary linear maps between qubits.
[33]
Optimizing and simplifying circuits — PyZX 0.7.3 documentation
The main optimization methods work by converting a circuit into a ZX-diagram, simplifying this diagram, and then converting it back into a quantum circuit.<|separator|>
[34]
Importing and exporting quantum circuits and ZX-diagrams - PyZX
PyZX also offers a convenience function to construct a circuit out of a string containing QASM code using either from_qasm or qasm . To convert a Circuit ...Missing: features rule- based rewriting extraction visualization
[35]
qiskit-zx-transpiler - PyPI
Apr 7, 2024 · Qiskit ZX Transpiler. A transpiler pass for Qiskit which uses ZX-Calculus for circuit optimization, implemented using PyZX. Example usage.
[36]
Exhaustive Search for Quantum Circuit Optimization using ZX Calculus
This paper uses exhaustive search algorithms and ZX calculus to optimize quantum circuits, using depth-first search and iterative deepening depth-first search.Missing: assisted 2023 2024
[37]
[PDF] Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum ...
By combining them with existing opti- mization approaches, we maintain the T gate count reduction rate and improve the total gate count and the 2-qubit gate ...
[38]
pyzx - PyPI
A Python tool implementing the theory of ZX-calculus for the creation, visualisation, and automated rewriting of large-scale quantum circuits.Missing: GPU acceleration
[39]
A Proof Assistant for Diagrammatic Reasoning - Quantomatic - arXiv
Mar 3, 2015 · Quantomatic is a tool that supports the (semi-)automatic construction of equational proofs using string diagrams.
[40]
GitHub - zxcalc/quantomatic: Quantomatic is a tool for doing automated graph rewriting.
- **What is Quantomatic**: A tool for automated graph rewriting, designed for reasoning about monoidal theories, particularly quantum information processing.
[41]
dlyongemallo/qiskit-zx-transpiler - GitHub
A transpiler pass for Qiskit which uses ZX-Calculus for circuit optimization, implemented using PyZX. - dlyongemallo/qiskit-zx-transpiler.
[42]
ZX Diagrams - pytket user guide
In this section, we will assume the reader is familiar with the theory of ZX-calculus in terms of how to construct diagrams, apply rewrites to them, and ...
[43]
ZXLab - Interactive Quantum Circuit Simplifier | AI Youth Alliance
ZXLab is the first tool that brings this power to the browser. With interactive circuit visualization, live ZX graph editing, and one-click simplification.
[44]
ZX Calculator — 0 nodes, 0 edges
ZX Calculator is a tool for creating and manipulating graph-like ZX diagrams. To start, load an example graph, create one in Edit mode, or import from PyZX.
[45]
Introduction to the ZX-calculus | PennyLane Demos
Jun 5, 2023 · The ZX-calculus is a graphical language for reasoning about quantum computations and circuits. Introduced by Coecke and Duncan 1, it can represent any linear ...ZX-calculus: rewriting rules · The ZXH-calculus · ZX-diagrams with PennyLane
[46]
Speeding up quantum circuits simulation using ZX-Calculus - arXiv
May 4, 2023 · We present a simple and efficient way to reduce the contraction cost of a tensor network to simulate a quantum circuit.
[47]
[PDF] Graphical calculus for Tensor Network Contractions
Some common ZX-diagrams and their linear map representations are given below. A 1-input, 1-output Z-spider with a phase α corresponds to the RZ(α) phase gate ( ...
[48]
AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum ...
Dec 2, 2020 · In this paper we introduce the ZXH-calculus, a graphical language based on the ZX-calculus, that we use to represent and reason about many-body states entirely ...
[49]
None
Nothing is retrieved...<|control11|><|separator|>
[50]
https://arxiv.org/abs/2012.01219
[51]
[1601.04964] Interacting Frobenius Algebras are Hopf - arXiv
Jan 19, 2016 · Title:Interacting Frobenius Algebras are Hopf. Authors:Ross Duncan, Kevin Dunne. View a PDF of the paper titled Interacting Frobenius Algebras ...