Graphical Symplectic Algebra
- URL: http://arxiv.org/abs/2401.07914v3
- Date: Mon, 18 Mar 2024 17:38:32 GMT
- Title: Graphical Symplectic Algebra
- Authors: Robert I. Booth, Titouan Carette, Cole Comfort,
- Abstract summary: We give complete presentations for the dagger-compact props of affine Lagrangian and coisotropic relations over an arbitrary field.
This provides a unified family of graphical languages for both affinely constrained classical mechanical systems, as well as odd-prime-dimensional stabiliser quantum circuits.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: We give complete presentations for the dagger-compact props of affine Lagrangian and coisotropic relations over an arbitrary field. This provides a unified family of graphical languages for both affinely constrained classical mechanical systems, as well as odd-prime-dimensional stabiliser quantum circuits. To this end, we present affine Lagrangian relations by a particular class of undirected coloured graphs. In order to reason about composite systems, we introduce a powerful scalable notation where the vertices of these graphs are themselves coloured by graphs. In the setting of stabiliser quantum mechanics, this scalable notation gives an extremely concise description of graph states, which can be composed via ``phased spider fusion.'' Likewise, in the classical mechanical setting of electrical circuits, we show that impedance matrices for reciprocal networks are presented in essentially the same way.
Related papers
- Complete equational theories for classical and quantum Gaussian relations [0.0]
We give generators and relations for the hypergraph props of Gaussian relations and positive affine Lagrangian relations.
We also interpret the LOv-calculus for reasoning about passive linear-optical quantum circuits.
arXiv Detail & Related papers (2024-03-15T17:09:24Z) - Curve Your Attention: Mixed-Curvature Transformers for Graph
Representation Learning [77.1421343649344]
We propose a generalization of Transformers towards operating entirely on the product of constant curvature spaces.
We also provide a kernelized approach to non-Euclidean attention, which enables our model to run in time and memory cost linear to the number of nodes and edges.
arXiv Detail & Related papers (2023-09-08T02:44:37Z) - Graph Embeddings via Tensor Products and Approximately Orthonormal Codes [0.0]
We show that our representation falls under the bind-and-sum approach in hyperdimensional computing.
We establish some precise results characterizing the behavior of our method.
We briefly discuss its applications toward a dynamic compressed representation of large sparse graphs.
arXiv Detail & Related papers (2022-08-18T10:56:37Z) - Graph Kernel Neural Networks [53.91024360329517]
We propose to use graph kernels, i.e. kernel functions that compute an inner product on graphs, to extend the standard convolution operator to the graph domain.
This allows us to define an entirely structural model that does not require computing the embedding of the input graph.
Our architecture allows to plug-in any type of graph kernels and has the added benefit of providing some interpretability.
arXiv Detail & Related papers (2021-12-14T14:48:08Z) - Equivariant Quantum Graph Circuits [10.312968200748116]
We propose equivariant quantum graph circuits (EQGCs) as a class of parameterized quantum circuits with strong inductive bias for learning over graph-structured data.
Our theoretical perspective on quantum graph machine learning methods opens many directions for further work, and could lead to models with capabilities beyond those of classical approaches.
arXiv Detail & Related papers (2021-12-10T00:14:12Z) - Non-separable Spatio-temporal Graph Kernels via SPDEs [90.62347738138594]
We provide graph kernels for principled-temporal modelling on graphs.
By providing novel tools for modelling on graphs, we outperform pre-existing graph kernels in real-world applications.
arXiv Detail & Related papers (2021-11-16T14:53:19Z) - Quantum walks on regular graphs with realizations in a system of anyons [0.0]
We build interacting Fock spaces from association schemes and set up quantum walks on regular graphs.
In the dual perspective interacting Fock spaces gather a new meaning in terms of anyon systems.
arXiv Detail & Related papers (2021-09-22T18:01:20Z) - Directed Graph Embeddings in Pseudo-Riemannian Manifolds [0.0]
We show that general directed graphs can be effectively represented by an embedding model that combines three components.
We demonstrate the representational capabilities of this method by applying it to the task of link prediction.
arXiv Detail & Related papers (2021-06-16T10:31:37Z) - 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) - GraphOpt: Learning Optimization Models of Graph Formation [72.75384705298303]
We propose an end-to-end framework that learns an implicit model of graph structure formation and discovers an underlying optimization mechanism.
The learned objective can serve as an explanation for the observed graph properties, thereby lending itself to transfer across different graphs within a domain.
GraphOpt poses link formation in graphs as a sequential decision-making process and solves it using maximum entropy inverse reinforcement learning algorithm.
arXiv Detail & Related papers (2020-07-07T16:51:39Z) - Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer.
The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
arXiv Detail & Related papers (2020-03-25T02:46:14Z)
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.