Addition and Differentiation of ZX-diagrams

• URL: http://arxiv.org/abs/2202.11386v5
• Date: Fri, 17 May 2024 10:18:37 GMT
• Title: Addition and Differentiation of ZX-diagrams
• Authors: Emmanuel Jeandel, Simon Perdrix, Margarita Veshchezerova,
• Abstract summary: We introduce a general, inductive definition of the addition of ZX-diagrams. We provide an inductive differentiation of ZX-diagrams. We also apply our results to deduce a diagram for an Ising Hamiltonian.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
  Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
  arXiv  Detail & Related papers  (2024-06-17T20:48:43Z)
• Graph Generation via Spectral Diffusion [51.60814773299899]
  We present GRASP, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and eigenvalues from which we can reconstruct the graph Laplacian and adjacency matrix. Our permutation invariant model can also handle node features by concatenating them to the eigenvectors of each node.
  arXiv  Detail & Related papers  (2024-02-29T09:26:46Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Simple qudit ZX and ZH calculi, via integrals [0.0]
  ZX calculus and ZH calculus use diagrams to denote quantum operations, using rewrite rules' to transform between diagrams which denote the same operator through a functorial semantic map. We describe semantic maps for ZX and ZH diagrams, well-suited to analyse unitary circuits and measurements on qudits of any fixed dimension D>1 as a single ZXH-calculus' We demonstrate rewrite rules for the stabiliser fragment' of the ZX calculus and a multicharacter fragment' of the ZH calculus.
  arXiv  Detail & Related papers  (2023-04-06T18:00:31Z)
• Correspondence between open bosonic systems and stochastic differential equations [77.34726150561087]
  We show that there can also be an exact correspondence at finite $n$ when the bosonic system is generalized to include interactions with the environment. A particular system with the form of a discrete nonlinear Schr"odinger equation is analyzed in more detail.
  arXiv  Detail & Related papers  (2023-02-03T19:17:37Z)
• Geometry of Interaction for ZX-Diagrams [0.0]
  ZX-Calculus is a versatile graphical language for quantum computation equipped with an equational theory. We propose a token-machine-based asynchronous model of both pure ZX-Calculus and its extension to mixed processes.
  arXiv  Detail & Related papers  (2022-06-22T08:52:58Z)
• Circuit Extraction for ZX-diagrams can be #P-hard [0.0]
  Some applications for the ZX-calculus rely on being able to efficiently translate a ZX-diagram back into a quantum circuit of comparable size. In this paper we show that the circuit extraction problem is #P-hard, and so is itself at least as hard as strong simulation of quantum circuits.
  arXiv  Detail & Related papers  (2022-02-18T13:50:24Z)
• Simplification Strategies for the Qutrit ZX-Calculus [0.0]
  The ZX-calculus is a graphical language for suitably represented tensor networks, called ZX-diagrams. The ZX-calculus has found applications in reasoning about quantum circuits, condensed matter systems, quantum algorithms, quantum error codes, and counting problems.
  arXiv  Detail & Related papers  (2021-03-11T19:17:28Z)
• AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states [1.1470070927586016]
  We introduce the ZXH-calculus, a graphical language that we use to represent and reason about many-body states entirely graphically. We show how we recover the AKLT matrix-product state representation, the existence of topologically protected edge states, and the non-vanishing of a string order parameter. We also provide an alternative proof that the 2D AKLT state on a hexagonal lattice can be reduced to a graph state, demonstrating that it is a universal quantum computing resource.
  arXiv  Detail & Related papers  (2020-12-02T14:03:27Z)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)
• PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations [77.34726150561087]
  We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations. We equip the language with an equational theory, which is proved to be sound and complete. We consider applications like the implementation of controlled permutations and the unrolling of loops.
  arXiv  Detail & Related papers  (2020-02-21T16:15:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.