Diagrammatic Analysis for Parameterized Quantum Circuits
arXiv:2204.01307 · doi:10.4204/EPTCS.394.15
Abstract
Diagrammatic representations of quantum algorithms and circuits offer novel approaches to their design and analysis. In this work, we describe extensions of the ZX-calculus especially suitable for parameterized quantum circuits, in particular for computing observable expectation values as functions of or for fixed parameters, which are important algorithmic quantities in a variety of applications ranging from combinatorial optimization to quantum chemistry. We provide several new ZX-diagram rewrite rules and generalizations for this setting. In particular, we give formal rules for dealing with linear combinations of ZX-diagrams, where the relative complex-valued scale factors of each diagram must be kept track of, in contrast to most previously studied single-diagram realizations where these coefficients can be effectively ignored. This allows us to directly import a number useful relations from the operator analysis to ZX-calculus setting, including causal cone and quantum gate commutation rules. We demonstrate that the diagrammatic approach offers useful insights into algorithm structure and performance by considering several ansatze from the literature including realizations of hardware-efficient ansatze and QAOA. We find that by employing a diagrammatic representation, calculations across different ansatze can become more intuitive and potentially easier to approach systematically than by alternative means. Finally, we outline how diagrammatic approaches may aid in the design and study of new and more effective quantum circuit ansatze.
In Proceedings QPL 2022, arXiv:2311.08375
References in corpus (22)
- Variational Quantum Algorithms
- A Quantum Approximate Optimization Algorithm
- Noisy intermediate-scale quantum (NISQ) algorithms
- Training variational quantum algorithms is NP-hard
- General parameter-shift rules for quantum gradients
- Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition
- There and back again: A circuit extraction tale
- Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
- Classical symmetries and the Quantum Approximate Optimization Algorithm
- Dimensional Expressivity Analysis of Parametric Quantum Circuits
- Exploiting Symmetry Reduces the Cost of Training QAOA
- Analytical Framework for Quantum Alternating Operator Ansätze
- Qutrit Dichromatic Calculus and Its Universality
- Diagrammatic Differentiation for Quantum Machine Learning
- Depicting qudit quantum mechanics and mutually unbiased qudit theories
- ZX-Calculus and Extended Wolfram Model Systems II: Fast Diagrammatic Reasoning with an Application to Quantum Circuit Simplification
- Simplification Strategies for the Qutrit ZX-Calculus
- Diagrammatic Design and Study of Ansätze for Quantum Machine Learning
- AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
- Sheet diagrams for bimonoidal categories
- Quantum Algorithms and Oracles with the Scalable ZX-calculus
- Kindergarden quantum mechanics graduates (...or how I learned to stop gluing LEGO together and love the ZX-calculus)