Optimal compilation of parametrised quantum circuits

Abstract

Parametrised quantum circuits contain phase gates whose phase is determined by a classical algorithm prior to running the circuit on a quantum device. Such circuits are used in variational algorithms like QAOA and VQE. In order for these algorithms to be as efficient as possible it is important that we use the fewest number of parameters. We show that, while the general problem of minimising the number of parameters is NP-hard, when we restrict to circuits that are Clifford apart from parametrised phase gates and where each parameter is used just once, we *can* efficiently find the optimal parameter count. We show that when parameter transformations are required to be sufficiently well-behaved, the only rewrites that reduce parameters correspond to simple 'fusions'. Using this we find that a previous circuit optimisation strategy by some of the authors [Kissinger, van de Wetering. PRA (2019)] finds the optimal number of parameters. Our proof uses the ZX-calculus. We also prove that the standard rewrite rules of the ZX-calculus suffice to prove any equality between parametrised Clifford circuits.

V2, V3: Added 6 pages of more proof details. In particular the main result now proves optimality and not just minimality of the parameter count

References in corpus (22)

• A variational eigenvalue solver on a quantum processor
• Supervised learning with quantum enhanced feature spaces
• Measurement-based quantum computation with cluster states
• Evaluating analytic gradients on quantum hardware
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• Interacting Quantum Observables: Categorical Algebra and Diagrammatics
• Automated optimization of large quantum circuits with continuous parameters
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• Reducing T-count with the ZX-calculus
• Generalized Flow and Determinism in Measurement-based Quantum Computation
• Towards Large-scale Functional Verification of Universal Quantum Circuits
• The ZX-calculus is complete for stabilizer quantum mechanics
• There and back again: A circuit extraction tale
• ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
• T-count optimization and Reed-Muller codes
• Relating Measurement Patterns to Circuits via Pauli Flow
• Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
• Supplementarity is Necessary for Quantum Diagram Reasoning
• The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
• Completeness of the ZH-calculus
• Finite Verification of Infinite Families of Diagram Equations

Cited by in corpus (3)

• A dataflow programming framework for linear optical distributed quantum computing
• Hamiltonian simulation with explicit formulas for Digital-Analog Quantum Computing
• Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation