Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Universe

Computing the Graph-Changing Dynamics of Loop Quantum Gravity

Thiago L. M. Guedes, Guillermo Antonio Mena Marugán, Francesca Vidotto, Markus Müller

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.18154/rwth-2026-00187

Related papers

Computing the Graph-Changing Dynamics of Loop Quantum Gravity

Thiago L. M. Guedes, Mena Marugán, Guillermo A., Francesca Vidotto +1 more

•Jan 1, 2025•0 citations

Loop Quantum Gravity and Quantum Information

Eugenio Bianchi A, Etera R. Livine

Springer eBooks•Jan 1, 2024•0 citations

Loop Quantum Gravity and Quantum Information

Eugenio Bianchi A, Etera R. Livine

arXiv:2302.05922•Springer eBooks•Jan 1, 2023•9 citations

Finite-Dimensional ZX-Calculus for Loop Quantum Gravity

Ben Priestley

Loop quantum gravity (LQG) attempts to unify general relativity with quantum physics to offer a complete description of the universe by quantising spacetime geometry, but the numerical calculations we encounter are extraordinarily difficult. Progress has been made in the covariant formulation of LQG, but the tools do not carry over to the canonical formulation. These tools are graphical by nature, describing space with spin networks to make calculations in LQG more intuitive to the human hand. Recently, a new notation for working with spin networks has been used by arXiv:2412.20272 to offer the first accurate numerical results in canonical LQG by allowing the underlying graphs to change throughout the calculation, though they are forced to concede visual intuitiveness. In this thesis, we offer a more radical rephrasing of spin network calculations by translating them into the finite-dimensional ZX-calculus, extending previous attempts to translate into the standard (qubit) ZX-calculus (arXiv:2111.03114). Specifically, we derive the mixed-dimensional ZX-diagrams representing the generating objects of spin networks and the rules for the Penrose Spin Calculus (arXiv:2511.06012), and use these to present the ZX-form and correctness of "loop removal". We also derive the forms for several fundamental LQG objects in the finite-dimensional ZX-calculus for the first time. This gives us a high-level, intuitive graphical language that retains a flexibility to handle changing graph structures, and thus we argue positions the PSC as the new definitive language for canonical LQG. Furthermore, we investigate the possibility for a matrix-like normal form for spin networks deriving from a novel perspective of the PSC in terms of W-nodes.

gr-qcCross-listedarXiv:2511.15966•Nov 21, 2025•0 citations

Prelude to Simulations of Loop Quantum Gravity on Adiabatic Quantum Computers

Jakub Mielczarek A B

The article addresses the possibility of implementing spin network states, used in the loop quantum gravity approach to Planck scale physics on an adiabatic quantum computer. The discussion focuses on applying currently available technologies and analyzes a concrete example of a D-Wave machine. It is introduced a class of simple spin network states which can be implemented on the Chimera graph architecture of the D-Wave quantum processor. However, extension beyond the currently available quantum processor topologies is required to simulate more sophisticated spin network states. This may inspire new generations of adiabatic quantum computers. A possibility of simulating loop quantum gravity is discussed, and a method of solving a graph non-changing scalar (Hamiltonian) constraint with the use of adiabatic quantum computations is proposed. The presented results establish a basis for the future simulations of Planck scale physics, specifically quantum cosmological configurations, on quantum annealers.

Frontiers in Astronomy and Space Sciences•Jun 10, 2021•10 citations

Models for Discrete Quantum Gravity

S. Gudder

arXiv:1108.6036•Reports on Mathematical Physics•Aug 1, 2012•2 citations
Loop quantum gravity (LQG) attempts to unify general relativity with quantum physics to offer a complete description of the universe by quantising spacetime geometry, but the numerical calculations we encounter are extraordinarily difficult. Progress has been made in the covariant formulation of LQG, but the tools do not carry over to the canonical formulation. These tools are graphical by nature, describing space with spin networks to make calculations in LQG more intuitive to the human hand. Recently, a new notation for working with spin networks has been used by arXiv:2412.20272 to offer the first accurate numerical results in canonical LQG by allowing the underlying graphs to change throughout the calculation, though they are forced to concede visual intuitiveness. In this thesis, we offer a more radical rephrasing of spin network calculations by translating them into the finite-dimensional ZX-calculus, extending previous attempts to translate into the standard (qubit) ZX-calculus (arXiv:2111.03114). Specifically, we derive the mixed-dimensional ZX-diagrams representing the generating objects of spin networks and the rules for the Penrose Spin Calculus (arXiv:2511.06012), and use these to present the ZX-form and correctness of "loop removal". We also derive the forms for several fundamental LQG objects in the finite-dimensional ZX-calculus for the first time. This gives us a high-level, intuitive graphical language that retains a flexibility to handle changing graph structures, and thus we argue positions the PSC as the new definitive language for canonical LQG. Furthermore, we investigate the possibility for a matrix-like normal form for spin networks deriving from a novel perspective of the PSC in terms of W-nodes.
The article addresses the possibility of implementing spin network states, used in the loop quantum gravity approach to Planck scale physics on an adiabatic quantum computer. The discussion focuses on applying currently available technologies and analyzes a concrete example of a D-Wave machine. It is introduced a class of simple spin network states which can be implemented on the Chimera graph architecture of the D-Wave quantum processor. However, extension beyond the currently available quantum processor topologies is required to simulate more sophisticated spin network states. This may inspire new generations of adiabatic quantum computers. A possibility of simulating loop quantum gravity is discussed, and a method of solving a graph non-changing scalar (Hamiltonian) constraint with the use of adiabatic quantum computations is proposed. The presented results establish a basis for the future simulations of Planck scale physics, specifically quantum cosmological configurations, on quantum annealers.