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

arXiv:2503.10983 · Communications in computer and information science

Exhaustive Search for Quantum Circuit Optimization Using ZX Calculus

Tobias Fischbach, P. Talbot, Pascal Bouvry

Published Jan 1, 2026• 3 citations
arXivHTMLPDF
DOI
10.1007/978-3-032-13589-6_18

Related papers

Approximate Optimisation of Quantum Circuits Using the ZX Calculus with Phase Squashing

Thomas Kelly, Aleks Kissinger

Lecture notes in computer science•Jan 1, 2025•0 citations

Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus

Agustín Borgna, Simon Perdrix, Benoît Valiron

arXiv:2109.06071•Lecture notes in computer science•Jan 1, 2021•17 citations

Equivalence Checking of Quantum Circuits with the ZX-Calculus

Lukas Burgholzer, Robert Wille

Springer eBooks•Jan 1, 2026•0 citations

Optimizing Quantum Circuits Using Algebraic Expressions

Varun Puram, Krishnageetha Karuppasamy, Johnson P. Thomas

Lecture notes in computer science•Jan 1, 2024•1 citation

Quantum Circuit Optimization Based on Dynamic Grouping and ZX-Calculus for Reducing 2-Qubit Gate Count

Kai Chen, Wenyu Liu, Guofu Xu +3 more

In the noisy intermediate-scale quantum (NISQ) era, two-qubit gates in quantum circuits are more susceptible to noise than single-qubit gates. Therefore, reducing the number of two-qubit gates is crucial for improving circuit efficiency and reliability. As quantum circuits scale up, the optimization search space becomes increasingly complex, leading to challenges such as low efficiency and suboptimal solutions. To address these issues, this paper proposes a quantum circuit optimization approach based on dynamic grouping and ZX-calculus. First, a random strategy-based dynamic grouping method partitions the circuit into multiple subcircuits. Second, a ZX-calculus guided k-step lookahead search performs equivalent subcircuit filtering to minimize two-qubit gate counts. Third, a delay-aware placement method optimizes the recombined circuit to reduce the overall gate count. Finally, simulated annealing iteratively updates the grouping strategy to achieve an optimized two-qubit gate count. Experimental results on benchmark datasets demonstrate the effectiveness and superiority of the proposed method in reducing two-qubit gates. Compared to the original circuits, the approach achieves an average reduction of 18% in two-qubit gates. It outperforms classical methods with up to 25% reduction, especially on gf circuits, and shows a 4% average improvement over heuristic ZX-calculus-based methods, validating its efficiency.

arXiv:2507.14434•Jul 19, 2025•1 citation

Application of ZX-calculus to quantum architecture search

Tom Ewen, Ivica Turkalj, Patrick Holzer +1 more

Abstract This paper presents a novel approach to quantum architecture search by integrating the techniques of ZX-calculus with Genetic Programming (GP) to optimize the structure of parameterized quantum circuits employed in quantum machine learning (QML). Recognizing the challenges in designing efficient quantum circuits for QML, we propose a GP framework that utilizes mutations defined via ZX-calculus, a graphical language that can simplify visualizing and working with quantum circuits. Our methodology focuses on evolving quantum circuits with the aim of enhancing their capability to approximate functions relevant in various machine learning tasks. We introduce several mutation operators inspired by the transformation rules of ZX-calculus and investigate their impact on the learning efficiency and accuracy of quantum circuits. The empirical analysis involves a comparative study where these mutations are applied to a diverse set of quantum regression problems, measuring performance metrics such as the percentage of valid circuits after the mutation, improvement of the objective, and circuit depth and width. Our results indicate that certain ZX-calculus-based mutations perform significantly better than others for quantum architecture search (QAS) in all metrics considered. They suggest that ZX-diagram-based QAS results in shallower circuits and more uniformly allocated gates than crude genetic optimization based on the circuit model. The code used for the numerical experiments is open source and can be found at TODO https://gitlab.cc-asp.fraunhofer.de/itwm-fm-qc-public/cvqa .

arXiv:2406.01095•Quantum Machine Intelligence•Mar 4, 2025•14 citations
In the noisy intermediate-scale quantum (NISQ) era, two-qubit gates in quantum circuits are more susceptible to noise than single-qubit gates. Therefore, reducing the number of two-qubit gates is crucial for improving circuit efficiency and reliability. As quantum circuits scale up, the optimization search space becomes increasingly complex, leading to challenges such as low efficiency and suboptimal solutions. To address these issues, this paper proposes a quantum circuit optimization approach based on dynamic grouping and ZX-calculus. First, a random strategy-based dynamic grouping method partitions the circuit into multiple subcircuits. Second, a ZX-calculus guided k-step lookahead search performs equivalent subcircuit filtering to minimize two-qubit gate counts. Third, a delay-aware placement method optimizes the recombined circuit to reduce the overall gate count. Finally, simulated annealing iteratively updates the grouping strategy to achieve an optimized two-qubit gate count. Experimental results on benchmark datasets demonstrate the effectiveness and superiority of the proposed method in reducing two-qubit gates. Compared to the original circuits, the approach achieves an average reduction of 18% in two-qubit gates. It outperforms classical methods with up to 25% reduction, especially on gf circuits, and shows a 4% average improvement over heuristic ZX-calculus-based methods, validating its efficiency.
Abstract This paper presents a novel approach to quantum architecture search by integrating the techniques of ZX-calculus with Genetic Programming (GP) to optimize the structure of parameterized quantum circuits employed in quantum machine learning (QML). Recognizing the challenges in designing efficient quantum circuits for QML, we propose a GP framework that utilizes mutations defined via ZX-calculus, a graphical language that can simplify visualizing and working with quantum circuits. Our methodology focuses on evolving quantum circuits with the aim of enhancing their capability to approximate functions relevant in various machine learning tasks. We introduce several mutation operators inspired by the transformation rules of ZX-calculus and investigate their impact on the learning efficiency and accuracy of quantum circuits. The empirical analysis involves a comparative study where these mutations are applied to a diverse set of quantum regression problems, measuring performance metrics such as the percentage of valid circuits after the mutation, improvement of the objective, and circuit depth and width. Our results indicate that certain ZX-calculus-based mutations perform significantly better than others for quantum architecture search (QAS) in all metrics considered. They suggest that ZX-diagram-based QAS results in shallower circuits and more uniformly allocated gates than crude genetic optimization based on the circuit model. The code used for the numerical experiments is open source and can be found at TODO https://gitlab.cc-asp.fraunhofer.de/itwm-fm-qc-public/cvqa .