Reducing 2-qubit gate count for ZX-calculus based quantum circuit optimization

DOI10.4204/EPTCS.394.3MaRDI QIDQ6940508zbMATH OpenFDO

Authors Korbinian Staudacher, Tobias Guggemos, Sophia Grundner-Culemann, Wolfgang Gehrke

Publication date 19 August 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.394.3

zbMATH Keywords

2-qubit gatesquantum circuit optimizationZX-calculus

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• "NON-IDENTITY-CHECK" IS QMA-COMPLETE
• A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
• A near-minimal axiomatisation of ZX-calculus for pure qubit quantum mechanics
• Circle graph obstructions under pivoting
• Circuit extraction for ZX-diagrams can be \(\#\mathbf{P}\)-hard
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Interacting quantum observables: categorical algebra and diagrammatics
• Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}
• Quantum computation and quantum information. 10th anniversary edition
• Transforming trees by successive local complementations

Cited in

(4)

• An algebraic formulation of Pauli flow, leading to faster flow-finding algorithms
• Approximate optimisation of quantum circuits using the ZX calculus with phase squashing
• Pauli flow on open graphs with unknown measurement labels
• Multi-controlled phase gate synthesis with ZX-calculus applied to neutral atom hardware

This page was built for publication: Reducing 2-qubit gate count for ZX-calculus based quantum circuit optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940508)