A recursively partitioned approach to architecture-aware ZX Polynomial synthesis and optimization

Abstract

The synthesis of quantum circuits from phase gadgets in the ZX-calculus facilitates quantum circuit optimization. Our work provides an alternative formulation for the architecture-aware synthesis algorithm of PauliOpt by replacing the stochastic approach of PauliOpt with a heuristic based search and utilizes a divide and conquer method to synthesize an optimized circuit from a ZX polynomial. We provide a comparison of our algorithm with PauliOpt and other state-of-the-art optimization libraries. While we note poorer performance for highly structured circuits, as in the QAOA formulation for Max-Cut, we demonstrate a significant advantage for randomized circuits, which highlights the advantages of utilizing an architecture-aware methodology.

arXiv commentThis work has been submitted to the IEEE for possible publication

References in corpus (12)

• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Interacting Quantum Observables: Categorical Algebra and Diagrammatics
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Automated optimization of large quantum circuits with continuous parameters
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• The ZX-calculus is complete for stabilizer quantum mechanics
• Quantum circuit optimizations for NISQ architectures
• Phase Gadget Synthesis for Shallow Circuits
• Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
• Making the stabilizer ZX-calculus complete for scalars
• ZX-calculus for the working quantum computer scientist
• Annealing Optimisation of Mixed ZX Phase Circuits

Cited by in corpus (1)

• Optimizing ZX-Diagrams with Deep Reinforcement Learning