Addition and Differentiation of ZX-diagrams
arXiv:2202.11386 · doi:10.46298/lmcs-20(2:10)2024
Abstract
The ZX-calculus is a powerful framework for reasoning in quantum computing. It provides in particular a compact representation of matrices of interests. A peculiar property of the ZX-calculus is the absence of a formal sum allowing the linear combinations of arbitrary ZX-diagrams. The universality of the formalism guarantees however that for any two ZX-diagrams, the sum of their interpretations can be represented by a ZX-diagram. We introduce a general, inductive definition of the addition of ZX-diagrams, relying on the construction of controlled diagrams. Based on this addition technique, we provide an inductive differentiation of ZX-diagrams. Indeed, given a ZX-diagram with variables in the description of its angles, one can differentiate the diagram according to one of these variables. Differentiation is ubiquitous in quantum mechanics and quantum computing (e.g. for solving optimization problems). Technically, differentiation of ZX-diagrams is strongly related to summation as witnessed by the product rules. We also introduce an alternative, non inductive, differentiation technique rather based on the isolation of the variables. Finally, we apply our results to deduce a diagram for an Ising Hamiltonian.
References in corpus (25)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- A Quantum Approximate Optimization Algorithm
- Quantum Circuit Learning
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Evaluating analytic gradients on quantum hardware
- Training variational quantum algorithms is NP-hard
- General parameter-shift rules for quantum gradients
- Estimating the gradient and higher-order derivatives on quantum hardware
- Reducing T-count with the ZX-calculus
- The ZX-calculus is complete for stabilizer quantum mechanics
- Practical optimization for hybrid quantum-classical algorithms
- Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations
- Generalized quantum circuit differentiation rules
- Quantum Analytic Descent
- Quantum picturalism for topological cluster-state computing
- Universal MBQC with generalised parity-phase interactions and Pauli measurements
- Completeness of the ZX-calculus for Pure Qubit Clifford+T Quantum Mechanics
- Graphical Fourier Theory and the Cost of Quantum Addition
- How to Sum and Exponentiate Hamiltonians in ZXW Calculus
- Algebraic complete axiomatisation of ZX-calculus with a normal form via elementary matrix operations
- A Near-Optimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics
- Diagrammatic Analysis for Parameterized Quantum Circuits
- Addition and Differentiation of ZX-diagrams
- Representing and Implementing Matrices Using Algebraic ZX-calculus