Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Apress eBooks

ZX-Calculus for Quantum Circuits: A Diagrammatic Approach to Quantum Circuit Analysis and Optimization

Subhojit Halder

Published Jan 1, 2026• 0 citations
Publisher

Abstract

This book is a coding-driven introduction to ZX-Calculus, guiding readers to the advanced techniques of diagrammatic reasoning and circuit optimization.
DOI
10.1007/979-8-8688-2857-7

Related papers

Fermionic ZX Calculus

Subhojit Halder

Over recent years, ZX calculus has developed into a versatile formalism that extends well beyond quantum circuit optimization. While the previous chapters established its foundational rules, graphical language, and computational workflow, this chapter shifts attention to a new setting in which diagrammatic reasoning becomes especially valuable: fermionic systems. In particular, we examine how ZX-based methods can be adapted to represent and manipulate fermionic tensor networks in a structured and intuitive way.

Apress eBooks•Jan 1, 2026•0 citations

Tutorial: Graphical calculus for quantum circuits

Bob Coecke, Duncan, Ross

We explain the graphical zx-calculus for reasoning about qubits without any reference to the underlying categorical semantics, and illustrate its use on quantum circuits. © 2013 Springer-Verlag Berlin Heidelberg. © Springer-Verlag Berlin Heidelberg 2013.

•Jan 1, 2013•0 citations

A Review on Quantum Circuit Optimization using ZX-Calculus

Tobias Fischbach, Talbot, Pierre, Pascal Bouvry

Quantum computing promises significant speed-ups for certain algorithms but the practical use of current noisy intermediate-scale quantum (NISQ) era computers remains limited by resources constraints (e.g., noise, qubits, gates, and circuit depth). Quantum circuit optimization is a key mitigation strategy. In this context, ZX-calculus has emerged as an alternative framework that allows for semantics-preserving quantum circuit optimization. We review ZX-based optimization of quantum circuits, categorizing them by optimization techniques, target metrics and intended quantum computing architecture. In addition, we outline critical challenges and future research directions, such as multi-objective optimization, scalable algorithms, and enhanced circuit extraction methods. This survey is valuable for researchers in both combinatorial optimization and quantum computing. For researchers in combinatorial optimization, we provide the background to understand a new challenging combinatorial problem: ZX-based quantum circuit optimization. For researchers in quantum computing, we classify and explain existing circuit optimization techniques.

arXiv:2509.20663•Sep 25, 2025•9 citations

The ZX-Calculus : A graphical calculus for multipartite qubit systems

Mohammed Al-Jaff

In this thesis we will give a presentation of a graphical/diagrammatic calculus for quantum systems involving interacting quantum observables such as multi-partite systems of qubits, the ZX-Calculu ...

•Jan 1, 2013•0 citations

Quantum Error Correction

Subhojit Halder

In the previous chapters, we developed the groundwork of ZX calculus, beginning with the basic structure of tensor networks such as edges, wires, and nodes, and the linear maps they represent. We also examined the rewrite and optimization procedures that make these diagrams useful for analyzing and transforming quantum circuits. Having seen that this graphical language also extends to applications such as fermionic ZX calculus, we now turn to another important application of ZX calculus in this chapter.

Apress eBooks•Jan 1, 2026•0 citations

PyZX: Large Scale Automated Diagrammatic Reasoning

Aleks Kissinger, John van de Wetering

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. Using the ZX-calculus, we can intuitively reason about quantum theory, and optimise and validate quantum circuits. In this paper we introduce PyZX, an open source library for automated reasoning with large ZX-diagrams. We give a brief introduction to the ZX-calculus, then show how PyZX implements methods for circuit optimisation, equality validation, and visualisation and how it can be used in tandem with other software. We end with a set of challenges that when solved would enhance the utility of automated diagrammatic reasoning.

arXiv:1904.04735•Electronic Proceedings in Theoretical Computer Science•Apr 30, 2020•249 citations
Over recent years, ZX calculus has developed into a versatile formalism that extends well beyond quantum circuit optimization. While the previous chapters established its foundational rules, graphical language, and computational workflow, this chapter shifts attention to a new setting in which diagrammatic reasoning becomes especially valuable: fermionic systems. In particular, we examine how ZX-based methods can be adapted to represent and manipulate fermionic tensor networks in a structured and intuitive way.
Quantum computing promises significant speed-ups for certain algorithms but the practical use of current noisy intermediate-scale quantum (NISQ) era computers remains limited by resources constraints (e.g., noise, qubits, gates, and circuit depth). Quantum circuit optimization is a key mitigation strategy. In this context, ZX-calculus has emerged as an alternative framework that allows for semantics-preserving quantum circuit optimization. We review ZX-based optimization of quantum circuits, categorizing them by optimization techniques, target metrics and intended quantum computing architecture. In addition, we outline critical challenges and future research directions, such as multi-objective optimization, scalable algorithms, and enhanced circuit extraction methods. This survey is valuable for researchers in both combinatorial optimization and quantum computing. For researchers in combinatorial optimization, we provide the background to understand a new challenging combinatorial problem: ZX-based quantum circuit optimization. For researchers in quantum computing, we classify and explain existing circuit optimization techniques.
In the previous chapters, we developed the groundwork of ZX calculus, beginning with the basic structure of tensor networks such as edges, wires, and nodes, and the linear maps they represent. We also examined the rewrite and optimization procedures that make these diagrams useful for analyzing and transforming quantum circuits. Having seen that this graphical language also extends to applications such as fermionic ZX calculus, we now turn to another important application of ZX calculus in this chapter.
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. Using the ZX-calculus, we can intuitively reason about quantum theory, and optimise and validate quantum circuits. In this paper we introduce PyZX, an open source library for automated reasoning with large ZX-diagrams. We give a brief introduction to the ZX-calculus, then show how PyZX implements methods for circuit optimisation, equality validation, and visualisation and how it can be used in tandem with other software. We end with a set of challenges that when solved would enhance the utility of automated diagrammatic reasoning.