Beyond Penrose tensor diagrams with the ZX calculus: Applications to quantum computing, quantum machine learning, condensed matter physics, and quantum gravity

• URL: http://arxiv.org/abs/2511.06012v1
• Date: Sat, 08 Nov 2025 13:42:53 GMT
• Title: Beyond Penrose tensor diagrams with the ZX calculus: Applications to quantum computing, quantum machine learning, condensed matter physics, and quantum gravity
• Authors: Quanlong Wang, Richard D. P. East, Razin A. Shaikh, Lia Yeh, Boldizsár Poór, Bob Coecke,
• Abstract summary: We introduce the Spin-ZX calculus as an elevation of Penrose's diagrams and associated binor calculus.<n>We apply it to: permutational quantum computing, quantum machine learning, condensed matter physics, and quantum gravity.<n>Our results establish the Spin-ZX calculus as a powerful tool for representing and computing with SU(2) systems graphically.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce the Spin-ZX calculus as an elevation of Penrose's diagrams and associated binor calculus to the level of a formal diagrammatic language. The power of doing so is illustrated by the variety of scientific areas we apply it to: permutational quantum computing, quantum machine learning, condensed matter physics, and quantum gravity. Respectively, we analyse permutational computing transition amplitudes, evaluate barren plateaus for SU(2) symmetric ans\"atze, study properties of AKLT states, and derive the minimum quantised volume in loop quantum gravity. Our starting point is the mixed-dimensional ZX calculus, a purely diagrammatic language that has been proven to be complete for finite-dimensional Hilbert spaces. That is, any equation that can be derived in the Hilbert space formalism, can also be derived in the mixed-dimensional ZX calculus. We embed the Spin-ZX calculus inside the mixed-dimensional ZX calculus, rendering it a quantum information flavoured diagrammatic language for the quantum theory of angular momentum, i.e. SU(2) representation theory. We diagrammatically derive the fundamental spin coupling objects - such as Clebsch-Gordan coefficients, symmetrising mappings between qubits and spin spaces, and spin Hamiltonians - under this embedding. Our results establish the Spin-ZX calculus as a powerful tool for representing and computing with SU(2) systems graphically, offering new insights into foundational relationships and paving the way for new diagrammatic algorithms for theoretical physics.

Related papers

• Finite-Dimensional ZX-Calculus for Loop Quantum Gravity [0.0]
  We offer a more radical rephrasing of spin network calculations by translating them into the finite-dimensional ZX-calculus.<n>We derive the forms for several fundamental LQG objects in the finite-dimensional ZX-calculus for the first time.
  arXiv  Detail & Related papers  (2025-11-20T01:36:52Z)
• The Focked-up ZX Calculus: Picturing Continuous-Variable Quantum Computation [0.0]
  We formulate a graphical language for continuous-variable quantum computation. We present exciting new graphical rules capturing heftier CVQC interactions. Applying our calculus for quantum error correction, we derive graphical representations of the Gottesman-Kitaev-Preskill code encoder, syndrome measurement, and magic state distillation of Hadamard eigenstates.
  arXiv  Detail & Related papers  (2024-06-05T03:56:18Z)
• ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces [0.09831489366502298]
  The ZX-calculus is a graphical language for quantum computing and quantum information theory.<n>We prove completeness of finite-dimensional ZX-calculus, incorporating only the mixed-dimensional Z-spider and the qudit X-spider as generators.<n>Our approach builds on the completeness of another graphical language, the finite-dimensional ZW-calculus, with direct translations between these two calculi.
  arXiv  Detail & Related papers  (2024-05-17T16:35:07Z)
• 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)
• SU(d)-Symmetric Random Unitaries: Quantum Scrambling, Error Correction, and Machine Learning [13.83964654408157]
  In the presence of SU(d) symmetry, local conserved quantities would exhibit residual values even at $t rightarrow infty$.<n>We show that SU(d)-symmetric unitaries can be used to construct neuralally optimal codes that encode any constant number of logical qudits.<n>We derive an overpartameterization threshold via the quantum tangent kernel required for exponential convergence guarantee of generic ansatz for geometric quantum machine learning.
  arXiv  Detail & Related papers  (2023-09-28T16:12:31Z)
• Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory [0.11049608786515838]
  We introduce the qufinite ZXW calculus - a graphical language for reasoning about finite-dimensional quantum theory. We prove the completeness of this calculus by demonstrating that any qufinite ZXW diagram can be rewritten into its normal form. Our work paves the way for a comprehensive diagrammatic description of quantum physics, opening the doors of this area to the wider public.
  arXiv  Detail & Related papers  (2023-09-22T17:23:58Z)
• Quantum simulation of Maxwell's equations via Schr\"odingersation [27.193565893837356]
  We present quantum algorithms for electromagnetic fields governed by Maxwell's equations. The algorithms are based on the Schr"odingersation approach. Instead of qubits, the quantum algorithms can also be formulated in the continuous variable quantum framework.
  arXiv  Detail & Related papers  (2023-08-16T14:52:35Z)
• Quantum Chebyshev Transform: Mapping, Embedding, Learning and Sampling Distributions [18.124351208075062]
  We show how to encode data into quantum states with amplitudes growing exponentially in the system size. We propose an embedding circuit for generating the orthonormal Chebyshev basis of exponential capacity. This enables automatic model differentiation, and opens a route to solving differential equations.
  arXiv  Detail & Related papers  (2023-06-29T15:19:32Z)
• Classical shadow tomography for continuous variables quantum systems [13.286165491120467]
  We introduce two experimentally realisable schemes for obtaining classical shadows of CV quantum states. We are able to overcome new mathematical challenges due to the infinite-dimensionality of CV systems. We provide a scheme to learn nonlinear functionals of the state, such as entropies over any small number of modes.
  arXiv  Detail & Related papers  (2022-11-14T17:56:29Z)
• Quantum Model-Discovery [19.90246111091863]
  Quantum algorithms for solving differential equations have shown a provable advantage in the fault-tolerant quantum computing regime. We extend the applicability of near-term quantum computers to more general scientific machine learning tasks. Our results show a promising path to Quantum Model Discovery (QMoD) on the interface between classical and quantum machine learning approaches.
  arXiv  Detail & Related papers  (2021-11-11T18:45:52Z)
• Spin-networks in the ZX-calculus [0.0]
  We show that the ZX-calculus can be used to describe SU(2) representation theory. We show how we can explicitly calculate 3jm, 4jm and 6j symbols.
  arXiv  Detail & Related papers  (2021-11-04T19:25:38Z)
• 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.