Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi

• URL: http://arxiv.org/abs/2605.13993v1
• Date: Wed, 13 May 2026 18:05:02 GMT
• Title: Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi
• Abstract summary: We introduce Graphical Algebraic Geometry (GAG), a family of diagrammatic languages extending the Graphical Linear Algebra programme.<n>We showcase two practical viewpoints on GAG.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce Graphical Algebraic Geometry (GAG), a family of diagrammatic languages extending the Graphical Linear Algebra programme. We construct several languages within this family and prove that they are universal and complete for the corresponding (co)span semantics of commutative algebras and affine varieties. This framework provides clear graphical representations of algebraic structures -- such as polynomials, ideals, and varieties -- enabling intuitive yet rigorous diagrammatic reasoning. We showcase two practical viewpoints on GAG. First, we show that instances of counting constraint satisfaction problem (#CSP) are recast as rewrite problems of closed diagrams in GAG. This means that deciding rewritability in GAG is #P-hard, and GAG can be viewed as a complete and compositional rewrite system for networks of polynomial constraints. Second, we characterize the qudit ZH calculus, a diagrammatic language for quantum computation, as an extension of Graphical Algebraic Geometry. This establishes the correspondence that Graphical Algebraic Geometry is to the ZH calculus what Graphical Linear Algebra is to the ZX calculus. Using this construction, we show that computing amplitudes in qudit ZH requires only a constant number of queries to a GAG oracle.

Related papers

• Riemannian Geometry Speaks Louder Than Words: From Graph Foundation Model to Next-Generation Graph Intelligence [51.30336200738606]
  There is strong agreement that Graph Foundation Models (GFMs) are essential for advancing graph learning.<n> considerable disagreement persists on how to build a powerful, general-purpose GFM analogous to Large Language Models (LLMs)
  arXiv  Detail & Related papers  (2026-03-23T05:49:19Z)
• On the structural properties of Lie algebras via associated labeled directed graphs [0.0]
  We present a method for associating labeled directed graphs to finite-dimensional Lie algebras.<n>We analyze properties of valid graphs given the antisymmetry property of the Lie bracket as well as the Jacobi identity.<n>We develop graph-theoretic criteria for solvability, nilpotency, presence of ideals, simplicity, semisimplicity, and reductiveness of an algebra.
  arXiv  Detail & Related papers  (2026-01-22T18:09:16Z)
• Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras [0.0]
  We study the underlying algebraic properties of three QAOA ans"atze for the maximum-cut (maxcut) problem on connected graphs.<n>We analyze the standard QAOAsatz as well as the orbit and the multi-angle ansatz.
  arXiv  Detail & Related papers  (2024-10-07T16:46:20Z)
• A Survey of Geometric Graph Neural Networks: Data Structures, Models and Applications [71.809127869349]
  This paper formalizes geometric graph as the data structure, on top of which we provide a unified view of existing models from the geometric message passing perspective.<n>We also summarize the applications as well as the related datasets to facilitate later research for methodology development and experimental evaluation.
  arXiv  Detail & Related papers  (2024-03-01T12:13:04Z)
• 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)
• A Hitchhiker's Guide to Geometric GNNs for 3D Atomic Systems [87.30652640973317]
  Recent advances in computational modelling of atomic systems represent them as geometric graphs with atoms embedded as nodes in 3D Euclidean space. Geometric Graph Neural Networks have emerged as the preferred machine learning architecture powering applications ranging from protein structure prediction to molecular simulations and material generation. This paper provides a comprehensive and self-contained overview of the field of Geometric GNNs for 3D atomic systems.
  arXiv  Detail & Related papers  (2023-12-12T18:44:19Z)
• On the Expressive Power of Geometric Graph Neural Networks [18.569063436109044]
  We propose a geometric version of the WL test (GWL) for discriminating geometric graphs while respecting the underlying physical symmetries. We unpack how key design choices influence geometric GNN expressivity.
  arXiv  Detail & Related papers  (2023-01-23T08:08:10Z)
• Distance Measures for Geometric Graphs [0.0]
  We study two notions of distance measures for geometric graphs, called the geometric edit distance (GED) and geometric graph distance (GGD) GED is based on the idea of editing one graph to transform it into the other graph, while GGD is inspired by inexact matching of the graphs. We show that GGD is $mathcalNP$-hard to compute, even if the distance is $mathcalNP$-hard to compute.
  arXiv  Detail & Related papers  (2022-09-26T17:35:29Z)
• Geometry Interaction Knowledge Graph Embeddings [153.69745042757066]
  We propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities.
  arXiv  Detail & Related papers  (2022-06-24T08:33:43Z)
• Graphical Calculi and their Conjecture Synthesis [0.0]
  This thesis introduces such inference and verification frameworks, in doing so forging novel links between graphical calculi and fields such as Algebraic Geometry and Galois Theory. The calculus RING is initial among ring-based qubit graphical calculi, and in turn inspired the introduction and classification of phase homomorphism pairs also presented here. The second is the calculus ZQ, an edge-decorated calculus which naturally expresses arbitrary qubit rotations, eliminating the need for non-linear rules such as (EU) of ZX.
  arXiv  Detail & Related papers  (2020-10-08T11:54:44Z)
• 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)

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.