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

Insights into physical states of loop quantum gravity using techniques from machine learning

Waleed Sherif

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Loop quantum gravity offers a rich non-perturbative framework for quantum gravity, yet its dynamics remain extremely difficult to implement in practice. In the canonical formulation, physical states are defined by quantum constraints acting on spin-network states, whose graph, representation, and intertwiner data lead to a highly complex kinematical state space. In the covariant formulation, transition amplitudes are built from spin foam vertex amplitudes whose exact evaluation is computationally demanding. This dissertation develops a computational programme for the dynamics of loop quantum gravity in both its canonical and covariant formulations. The programme combines structure-preserving numerical methods with machine learning techniques, with the aim of preserving the native graph, gauge, and operator structure of the theory while making its dynamical problems accessible to controlled computation at large scale. In the canonical theory, this means using variational Monte Carlo methods and neural quantum states to approximate solutions of quantum constraints. In the covariant theory, it means using neural network surrogates to approximate spin foam vertex amplitudes. In this way, part of the dynamical problem of loop quantum gravity is brought from the purely formal domain into a regime of explicit and controlled numerical study. On the canonical side, a fixed-graph framework is developed in which graph non-enlarging Hamiltonian constraints are recast as variational problems for positive quadratic forms whose minima encode weak constraint equations. This reformulation turns the search for physical states into a ground state problem on truncated Hilbert spaces. To realise this programme in practice, neuraLQX, an open-source high-performance toolkit for variational canonical loop quantum gravity built around graph-aware Hilbert spaces, observables, and constraint operators, was developed as part of this dissertation. It uses Markov chain Monte Carlo methods, and in particular gauge-invariant sampling, stochastic reconfiguration, and quantum states parametrized by neural networks adapted to the locality of the dynamics. To demonstrate the viability of this framework, high-fidelity near-physical states are obtained for Abelian BF theory and for a weak coupling limit of LQG with structure group \(\mathrm{U}(1)^3\) in three and four dimensions. In the four-dimensional model on the complete graph \(K_5\), the analysis shows that the ordering of the vertex Hamiltonian constraint has a strong influence on which solution sectors are found variationally. The relevant operator is the vertex Hamiltonian \(\hat{H}_v\), quantized in the spirit of Thiemann's construction and with the corresponding ordering. Numerically, the weak equations associated with \(\hat{H}_v\) and \(\hat{H}_v^\dagger\) are probed through positive quadratic objectives built from \(\hat{H}_v^\dagger \hat{H}_v\) and \(\hat{H}_v \hat{H}_v^\dagger\). The analysis shows that these two searches do not merely produce different approximations to the same variational state. Instead, they select distinct solution sectors. One sector is peaked on flat connections and appears to describe a non-degenerate spatial quantum geometry. Numerical analysis shows this sector to be consistent with a discrete approximation to a Dittrich-Geiller-type vacuum. The other sector consists of states in the kernel of the volume operator. These states are non-flat and exhibit correlations across the graph, consistent with volume-zero excitations over an Ashtekar-Lewandowski-type vacuum. The relation between the two sectors is asymmetric in the sense that while the Ashtekar-Lewandowski-like states are often solutions for both orderings of the quadratic constraints, the Dittrich-Geiller-like states are not. Thus, one can conclude that the ordering of the Hamiltonian constraint affects which sectors are accessible or selected in the variational search, and it suggests that different orderings may exclude some classes of solutions. On the covariant side, this dissertation develops neural network surrogates for spin foam vertex amplitudes, with the aim of approximating the local building blocks of the path-integral dynamics. Starting with the Euclidean Barrett-Crane amplitude, the numerical problem is shown to separate naturally into two physically distinct tasks. The first is to determine which boundary spin configurations are admissible and therefore lie in the support of the amplitude. The second is to approximate the numerical value assigned to each admissible configuration by the vertex amplitude itself. The support is learned with near-perfect accuracy and generalises across cutoffs, showing that the network can infer and extrapolate the known, algorithmically verifiable \(\mathrm{SU}(2)\) recoupling conditions that determine admissibility in the Barrett-Crane case. By contrast, the amplitude values can be reproduced with high precision at fixed cutoff, but do not extrapolate reliably to larger cutoffs. This shows that the dependence of the vertex amplitude on the boundary quantum geometry is considerably more intricate than the structure of its support. The analysis also demonstrates that the representation of discrete spin data is not a merely technical modelling choice but directly affects how well the relevant quantum-geometric information is exposed to the surrogate model. This observation motivates graph-based surrogate architectures in which the spin foam boundary data and their adjacency structure are built into the model more explicitly. These architectures are then applied to the Lorentzian EPRL amplitude whereby in this case, the thesis first addresses the computational bottleneck of exact evaluation by reducing the runtime of the `sl2cfoam-next` exact evaluator sufficiently to generate large training datasets. Preliminary surrogate results show that the support, as well as the sign, of the EPRL amplitude can also be learned effectively, giving first evidence that graph-based learning can capture part of the admissibility structure of the Lorentzian theory.

DOI
10.25593/open-fau-3596

Related papers

Towards quantum gravity with neural networks: solving quantum Hamilton constraints of 3d Euclidean gravity in the weak coupling limit

Hanno Sahlmann, Waleed Sherif

Abstract The aim of the present work is to demonstrate the applicability of machine learning techniques and in particular neural network quantum states in the context of loop quantum gravity, albeit for a simplified theory. We consider 3-dimensional Euclidean gravity in a gauge theoretical formulation in a certain weak coupling limit due to Smolin, and show that the gauge group becomes Abelian, resulting in U(1)3 BF-theory. The theory is quantised using loop quantum gravity methods. The kinematical degrees of freedom are truncated, on account of computational feasibility, by fixing a graph and deforming the algebra of the holonomies to impose a cutoff on the charge vectors. This leads to a quantum theory related to Uq(1)3 BF-theory. The effect of imposing the cutoff on the charges is examined. We also implement the quantum volume operator of 3d loop quantum gravity. Most importantly we compare two constraints for the quantum model obtained: a master constraint enforcing curvature and Gauß constraint, as well as a combination of a quantum Hamilton constraint constructed using Thiemann’s strategy and the Gauß master constraint. The two constraints are solved using the neural network quantum state ansatz, demonstrating its ability to explore models which are out of reach for exact numerical methods. The solutions spaces are quantitatively compared and although the forms of the constraints are radically different, the solutions turn out to have a surprisingly large overlap. We also investigate the behavior of the quantum volume in solutions to the constraints.

arXiv:2405.00661•Classical and Quantum Gravity•Sep 17, 2024•10 citations

Towards quantum gravity with neural networks: solving the quantum Hamilton constraint of U(1) BF theory

Hanno Sahlmann, Waleed Sherif

Abstract In the canonical approach of loop quantum gravity, arguably the most important outstanding problem is finding and interpreting solutions to the Hamiltonian constraint. In this work, we demonstrate that methods of machine learning are in principle applicable to this problem. We consider U(1) BF theory in three dimensions, quantised with loop quantum gravity methods. In particular, we formulate a master constraint corresponding to Hamilton and Gauß constraints using loop quantum gravity methods. To make the problem amenable for numerical simulation we fix a graph and introduce a cutoff on the kinematical degrees of freedom, effectively considering U q ( 1 ) BF theory at a root of unity. We show that the neural network quantum state ansatz can be used to numerically solve the constraints efficiently and accurately. We compute expectation values and fluctuations of certain observables and compare them with exact results or exact numerical methods where possible. We also study the dependence on the cutoff.

arXiv:2402.10622•Classical and Quantum Gravity•Oct 8, 2024•14 citations

Exploring the near-kernel sector of quantum reduced loop gravity

Ilkka Mäkinen, Hanno Sahlmann, Waleed Sherif

Abstract We study the near-kernel sector of the Hamiltonian constraint operator in the one-vertex model of quantum reduced loop gravity using exact diagonalisation methods and variational Monte Carlo methods with neural quantum states. The analysis is based on the symmetric Hamiltonian containing both Euclidean and Lorentzian contributions, and on the variational minimization of the positive quadratic operator $\hat{Q}=\hat{C}^2$, where $\hat{C}$ is the symmetric Hamilton constraint, in truncated Hilbert spaces with spin cutoff up to $j_{\mathrm{max}}=1001$. In the cases where exact diagonalization is possible, the eigenspace of lowest eigenvalue is one- or two-dimensional, and the eigenvalue, as well as the structure of the eigenstates depends on the cutoff. These ground states are entangled across the three edges. The variational method does not find the lowest eigenspace, but near kernel states, i.e., states with components in a number of low lying eigenspaces. For low cutoffs, they also do not factorize across the three edge degrees of freedom. At larger cutoffs, it increasingly finds near kernel states that factorize over the edges, matched with near-unit fidelity by reduced Thiemann coherent states. We discuss some indication that these states are the optimal near-kernel states if factorization is assumed.

arXiv:2605.18625•Classical and Quantum Gravity•Nov 5, 2026•2 citations

Hyperinvariant spin network states — an AdS/CFT model from first principles

Fynn Otto, Refik Mansuroglu, Norbert Schuch +2 more

A bstract We study the existence and limitations of hyperinvariant tensor networks incorporating a local SU(2) symmetry. As discrete implementations of the anti de-Sitter/conformal field theory (AdS/CFT) correspondence, such networks have created bridges between the fields of quantum information theory and quantum gravity. Adding SU(2) symmetry to the tensor network allows a direct connection to spin network states, a basis of the kinematic Hilbert space of loop quantum gravity (LQG). We consider a particular situation where the states can be interpreted as kinematic quantum states for three-dimensional quantum gravity. We demonstrate an entanglement-geometry correspondence realized in certain quantum states of the gravitational field in LQG, showing that models similar to the ones introduced by [F. Pastawski et al., JHEP 06, 149 (2015)] can be obtained as quantum gravitational models from first principles. We provide examples of hyperinvariant tensor networks, but also prove constraints on their existence in the form of no-go theorems that exclude absolutely maximally entangled states as well as general holographic codes from local SU(2)-invariance, as long as the logical index also transforms covariantly under the gauge group. We calculate surface areas as expectation values of the LQG area operator and discuss further possible constraints as a consequence of a decay of correlations on the boundary.

arXiv:2510.06602•Journal of High Energy Physics•Jun 12, 2026•1 citation

Quantum Machine Learning: Diverse Perspectives on Application Scenarios

XU, Yangjie

In recent years, quantum computing, as a potential way to break the bottleneck of Moore's Law, has gradually shown its unique advantages in the field of machine learning. Not only can it bring exponential or polynomial acceleration in some specific tasks, it also provides entirely new ways of representing and processing information. Focusing on the core theme of application and method innovation of quantum machine learning in structured data, this thesis systematically studies the theoretical models and practical applications of quantum computing in many sub-fields such as agricultural remote sensing, graph neural networks, and hyperdimensional computing, and explores the adaptability, scalability, and effectiveness of quantum models in real-world tasks. Firstly, in the cropland classification and yield prediction task, this study identifies that traditional neural networks tend to underperform when facing imbalanced and small-sample remote sensing data, often misclassifying minority crop types. To address this, we propose a quantum-classical hybrid recognition framework that integrates quantum feature mapping with classical neural networks. After incorporating quantum feature encoding, we observe a significant improvement in classification performance, especially in cases involving subtle field boundaries and heterogeneous textures. The quantum-enhanced model demonstrates superior accuracy, robustness, and generalization compared to its classical counterpart, validating the advantage of leveraging quantum representations in real-world agricultural datasets. The second part focuses on the learning of graph structure data and proposes to embed the Continuous Time Quantum Walk (CTQW) into the Graph Neural Network (GNN) architecture. This method not only preserves the global interference characteristic of quantum states but also realizes the efficient modeling of graph topology through the spectral graph methods. Experiments show that the proposed method is superior to many classical graph learning models in tasks such as node classification and graph structure inference. The third and fourth components of this thesis collectively explore quantum approaches to hyperdimensional computing (HDC), establishing a progressive transition from native quantum-state-based implementation to quantum-enhanced HDC strategies. Initially, we investigate the intrinsic mathematical correspondence between quantum states and high-dimensional hypervectors, and propose a novel quantum-state-based high-dimensional encoding method. This method is realized through quantum circuits capable of generating hypervectors with controllable entropy, thereby implementing essential HDC operations, such as classification and memory reconstruction, on real quantum hardware. This marks the first successful migration of core HDC mechanisms into a fully quantum-native framework. Building upon this foundation, we further propose the first quantum-enhanced HDC strategy, which does not rely solely on quantum-native implementations but rather utilizes key quantum features to boost the efficiency and expressivity of conventional HDC systems. Specifically, we introduce mechanisms such as quantum-reference-state-based binding, using density matrices to represent superclass states, and quantum state tomography for robust feature extraction. These innovations significantly enhance the resilience and performance of HDC under high-noise and high-dimensional sensing environments. The resulting models achieve superior accuracy and robustness across a variety of multi-class classification tasks, demonstrating the practical benefits of integrating quantum computation into the broader HDC paradigm. In this thesis, experimental validation is carried out in multiple real and simulation environments, including Qiskit and Paddle Quantum platforms, and a complete closed loop was achieved from theoretical derivation, quantum circuit design to end-to-end experimental evaluation. The results show that quantum methods can expand the expressive power of classical models and become an important tool to deal with large-scale, structured data problems in the future. The work in this thesis provides methodological support for quantum machine learning from theory to application, and also expands the research boundaries of high-dimensional computation and graph learning in the quantum background.

•Jul 8, 2025•0 citations

Machine learning and high-performance computing in numerical simulation of quantum many-body systems

Hongwei Chen

This thesis focuses on the development, application, and high-performance implementation of numerical methods for simulating quantum many-body systems. In the first chapter, I provide an overview of several most successful conventional approaches for simulating quantum many-body systems, along with their current limitations. Then, the basic properties of the quantum spin model, which will be the subject of study in the following chapters, and its ground state are briefly summarized. Additionally, I discuss the background and the motivations of the research projects carried out during my PhD research. Chapter 2 introduces two numerical algorithms that are extensively used in this thesis, which are exact diagonalization (ED) and variational Monte Carlo. I outline the process of constructing a Hamiltonian matrix and employing iterative methods for exact diagonalization. Subsequently, I introduce the mechanism of the four important components in the ``standard" variational Monte Carlo that are widely used in the most recent research. In Chapter 3, we propose a symmetry-projected variational ansatz in the form of linear combinations of simple restricted Boltzmann machines. This construction allows one to explore states outside of the original variational manifold and increase the representation power with moderate computational effort. Besides allowing one to restore spatial symmetries, an expansion in terms of Krylov states using a Lanczos recursion offers a solution that can further improve the quantum state accuracy. We illustrate these ideas with an application to the Heisenberg $J_1-J_2$ model on the square lattice, a paradigmatic problem under debate in condensed matter physics,and achieve state-of-the-art accuracy in the representation of the ground state. In Chapter 4, we present a variational approach based on a Chebyshev expansion of the spectral function, and each Chebyshev polynomial is represented by a neural network quantum state. The Chebyshev moments are obtained by recursively applying the Hamiltonian and projecting on the space of variational states using a modified natural gradient descent method. We compare this approach with a modified approximation of the spectral function which uses a Krylov subspace constructed from the "Chebyshev wave functions." We present results for the one-dimensional and two-dimensional Heisenberg models on the square lattice and compare them with those obtained by other methods in the literature. In Chapter 5, we describe a method to carry out thermodynamic simulations of quantum many-body models using typicality and variational representations of quantum states. Minimally entangled typical thermal states (METTS) are a construction that allows one to solve for the imaginary time evolution of quantum many-body systems. By using wave functions that are weakly entangled, one can take advantage of efficient representations in the form of matrixproduct states. We generalize these ideas to arbitrary variational wave functions and we focus, as an illustration, on the particular case of restricted Boltzmann machines. We demonstrate the application of the method to quantum spin systems in one and two spatial dimensions. In Chapter 6, we study the properties of the impurity band in heavily doped nonmagnetic semiconductors using the Jacobi-Davidson algorithm and the supervised deep learning method. The disorder averaged inverse participation ratio and Thouless number calculation show us the rich structure inside the impurity band. A convolutional neural network model, which is trained to distinguish the extended/localized phase of the Anderson model with high accuracy, shows us the results in good agreement with the conventional approach. Together, we find that there are three mobility edges in the impurity band for a specific on-site impurity potential, which means the presence of the extended states while filling the impurity band. In the final chapter, Chapter 7, we discuss the implementation of architecture-aware optimizations for spin dynamics simulations on x86 CPUs and Nvidia GPUs. The time cost of evaluating the spin-spin correlation functions in real space increases quadratically as the number of spins N, leading to significant computational effort, making the simulation of large spin systems very challenging. We propose to use a highly optimized general matrix multiply (GEMM) subroutine to calculate the dynamical spin-spin correlation function that can achieve near-optimal hardware utilization. Furthermore, we fuse the element-wise operations in the calculation of S(q,t) into the in-house GEMM kernel to reduce memory latency. On Nvidia GPU, we perform the on-the-fly calculation in the epilogue of the GEMM subroutine to avoid saving intermediate results on global memory, which significantly reduces memory usage and achieves better performance than $\mathtt{cuBLAS}$.--Author's abstract

•Jan 1, 2024•0 citations
Loop quantum gravity offers a rich non-perturbative framework for quantum gravity, yet its dynamics remain extremely difficult to implement in practice. In the canonical formulation, physical states are defined by quantum constraints acting on spin-network states, whose graph, representation, and intertwiner data lead to a highly complex kinematical state space. In the covariant formulation, transition amplitudes are built from spin foam vertex amplitudes whose exact evaluation is computationally demanding. This dissertation develops a computational programme for the dynamics of loop quantum gravity in both its canonical and covariant formulations. The programme combines structure-preserving numerical methods with machine learning techniques, with the aim of preserving the native graph, gauge, and operator structure of the theory while making its dynamical problems accessible to controlled computation at large scale. In the canonical theory, this means using variational Monte Carlo methods and neural quantum states to approximate solutions of quantum constraints. In the covariant theory, it means using neural network surrogates to approximate spin foam vertex amplitudes. In this way, part of the dynamical problem of loop quantum gravity is brought from the purely formal domain into a regime of explicit and controlled numerical study. On the canonical side, a fixed-graph framework is developed in which graph non-enlarging Hamiltonian constraints are recast as variational problems for positive quadratic forms whose minima encode weak constraint equations. This reformulation turns the search for physical states into a ground state problem on truncated Hilbert spaces. To realise this programme in practice, neuraLQX, an open-source high-performance toolkit for variational canonical loop quantum gravity built around graph-aware Hilbert spaces, observables, and constraint operators, was developed as part of this dissertation. It uses Markov chain Monte Carlo methods, and in particular gauge-invariant sampling, stochastic reconfiguration, and quantum states parametrized by neural networks adapted to the locality of the dynamics. To demonstrate the viability of this framework, high-fidelity near-physical states are obtained for Abelian BF theory and for a weak coupling limit of LQG with structure group (\mathrm{U}(1)^3) in three and four dimensions. In the four-dimensional model on the complete graph (K_5), the analysis shows that the ordering of the vertex Hamiltonian constraint has a strong influence on which solution sectors are found variationally. The relevant operator is the vertex Hamiltonian (\hat{H}_v), quantized in the spirit of Thiemann's construction and with the corresponding ordering. Numerically, the weak equations associated with (\hat{H}_v) and (\hat{H}_v^\dagger) are probed through positive quadratic objectives built from (\hat{H}_v^\dagger \hat{H}_v) and (\hat{H}_v \hat{H}_v^\dagger). The analysis shows that these two searches do not merely produce different approximations to the same variational state. Instead, they select distinct solution sectors. One sector is peaked on flat connections and appears to describe a non-degenerate spatial quantum geometry. Numerical analysis shows this sector to be consistent with a discrete approximation to a Dittrich-Geiller-type vacuum. The other sector consists of states in the kernel of the volume operator. These states are non-flat and exhibit correlations across the graph, consistent with volume-zero excitations over an Ashtekar-Lewandowski-type vacuum. The relation between the two sectors is asymmetric in the sense that while the Ashtekar-Lewandowski-like states are often solutions for both orderings of the quadratic constraints, the Dittrich-Geiller-like states are not. Thus, one can conclude that the ordering of the Hamiltonian constraint affects which sectors are accessible or selected in the variational search, and it suggests that different orderings may exclude some classes of solutions. On the covariant side, this dissertation develops neural network surrogates for spin foam vertex amplitudes, with the aim of approximating the local building blocks of the path-integral dynamics. Starting with the Euclidean Barrett-Crane amplitude, the numerical problem is shown to separate naturally into two physically distinct tasks. The first is to determine which boundary spin configurations are admissible and therefore lie in the support of the amplitude. The second is to approximate the numerical value assigned to each admissible configuration by the vertex amplitude itself. The support is learned with near-perfect accuracy and generalises across cutoffs, showing that the network can infer and extrapolate the known, algorithmically verifiable (\mathrm{SU}(2)) recoupling conditions that determine admissibility in the Barrett-Crane case. By contrast, the amplitude values can be reproduced with high precision at fixed cutoff, but do not extrapolate reliably to larger cutoffs. This shows that the dependence of the vertex amplitude on the boundary quantum geometry is considerably more intricate than the structure of its support. The analysis also demonstrates that the representation of discrete spin data is not a merely technical modelling choice but directly affects how well the relevant quantum-geometric information is exposed to the surrogate model. This observation motivates graph-based surrogate architectures in which the spin foam boundary data and their adjacency structure are built into the model more explicitly. These architectures are then applied to the Lorentzian EPRL amplitude whereby in this case, the thesis first addresses the computational bottleneck of exact evaluation by reducing the runtime of the sl2cfoam-next exact evaluator sufficiently to generate large training datasets. Preliminary surrogate results show that the support, as well as the sign, of the EPRL amplitude can also be learned effectively, giving first evidence that graph-based learning can capture part of the admissibility structure of the Lorentzian theory.
Abstract The aim of the present work is to demonstrate the applicability of machine learning techniques and in particular neural network quantum states in the context of loop quantum gravity, albeit for a simplified theory. We consider 3-dimensional Euclidean gravity in a gauge theoretical formulation in a certain weak coupling limit due to Smolin, and show that the gauge group becomes Abelian, resulting in U(1)3 BF-theory. The theory is quantised using loop quantum gravity methods. The kinematical degrees of freedom are truncated, on account of computational feasibility, by fixing a graph and deforming the algebra of the holonomies to impose a cutoff on the charge vectors. This leads to a quantum theory related to Uq(1)3 BF-theory. The effect of imposing the cutoff on the charges is examined. We also implement the quantum volume operator of 3d loop quantum gravity. Most importantly we compare two constraints for the quantum model obtained: a master constraint enforcing curvature and Gauß constraint, as well as a combination of a quantum Hamilton constraint constructed using Thiemann’s strategy and the Gauß master constraint. The two constraints are solved using the neural network quantum state ansatz, demonstrating its ability to explore models which are out of reach for exact numerical methods. The solutions spaces are quantitatively compared and although the forms of the constraints are radically different, the solutions turn out to have a surprisingly large overlap. We also investigate the behavior of the quantum volume in solutions to the constraints.
Abstract In the canonical approach of loop quantum gravity, arguably the most important outstanding problem is finding and interpreting solutions to the Hamiltonian constraint. In this work, we demonstrate that methods of machine learning are in principle applicable to this problem. We consider U(1) BF theory in three dimensions, quantised with loop quantum gravity methods. In particular, we formulate a master constraint corresponding to Hamilton and Gauß constraints using loop quantum gravity methods. To make the problem amenable for numerical simulation we fix a graph and introduce a cutoff on the kinematical degrees of freedom, effectively considering U q ( 1 ) BF theory at a root of unity. We show that the neural network quantum state ansatz can be used to numerically solve the constraints efficiently and accurately. We compute expectation values and fluctuations of certain observables and compare them with exact results or exact numerical methods where possible. We also study the dependence on the cutoff.
Abstract We study the near-kernel sector of the Hamiltonian constraint operator in the one-vertex model of quantum reduced loop gravity using exact diagonalisation methods and variational Monte Carlo methods with neural quantum states. The analysis is based on the symmetric Hamiltonian containing both Euclidean and Lorentzian contributions, and on the variational minimization of the positive quadratic operator Q^=C^2\hat{Q}=\hat{C}^2Q^​=C^2, where C^\hat{C}C^ is the symmetric Hamilton constraint, in truncated Hilbert spaces with spin cutoff up to jmax=1001j_{\mathrm{max}}=1001jmax​=1001. In the cases where exact diagonalization is possible, the eigenspace of lowest eigenvalue is one- or two-dimensional, and the eigenvalue, as well as the structure of the eigenstates depends on the cutoff. These ground states are entangled across the three edges. The variational method does not find the lowest eigenspace, but near kernel states, i.e., states with components in a number of low lying eigenspaces. For low cutoffs, they also do not factorize across the three edge degrees of freedom. At larger cutoffs, it increasingly finds near kernel states that factorize over the edges, matched with near-unit fidelity by reduced Thiemann coherent states. We discuss some indication that these states are the optimal near-kernel states if factorization is assumed.
A bstract We study the existence and limitations of hyperinvariant tensor networks incorporating a local SU(2) symmetry. As discrete implementations of the anti de-Sitter/conformal field theory (AdS/CFT) correspondence, such networks have created bridges between the fields of quantum information theory and quantum gravity. Adding SU(2) symmetry to the tensor network allows a direct connection to spin network states, a basis of the kinematic Hilbert space of loop quantum gravity (LQG). We consider a particular situation where the states can be interpreted as kinematic quantum states for three-dimensional quantum gravity. We demonstrate an entanglement-geometry correspondence realized in certain quantum states of the gravitational field in LQG, showing that models similar to the ones introduced by [F. Pastawski et al., JHEP 06, 149 (2015)] can be obtained as quantum gravitational models from first principles. We provide examples of hyperinvariant tensor networks, but also prove constraints on their existence in the form of no-go theorems that exclude absolutely maximally entangled states as well as general holographic codes from local SU(2)-invariance, as long as the logical index also transforms covariantly under the gauge group. We calculate surface areas as expectation values of the LQG area operator and discuss further possible constraints as a consequence of a decay of correlations on the boundary.
In recent years, quantum computing, as a potential way to break the bottleneck of Moore's Law, has gradually shown its unique advantages in the field of machine learning. Not only can it bring exponential or polynomial acceleration in some specific tasks, it also provides entirely new ways of representing and processing information. Focusing on the core theme of application and method innovation of quantum machine learning in structured data, this thesis systematically studies the theoretical models and practical applications of quantum computing in many sub-fields such as agricultural remote sensing, graph neural networks, and hyperdimensional computing, and explores the adaptability, scalability, and effectiveness of quantum models in real-world tasks. Firstly, in the cropland classification and yield prediction task, this study identifies that traditional neural networks tend to underperform when facing imbalanced and small-sample remote sensing data, often misclassifying minority crop types. To address this, we propose a quantum-classical hybrid recognition framework that integrates quantum feature mapping with classical neural networks. After incorporating quantum feature encoding, we observe a significant improvement in classification performance, especially in cases involving subtle field boundaries and heterogeneous textures. The quantum-enhanced model demonstrates superior accuracy, robustness, and generalization compared to its classical counterpart, validating the advantage of leveraging quantum representations in real-world agricultural datasets. The second part focuses on the learning of graph structure data and proposes to embed the Continuous Time Quantum Walk (CTQW) into the Graph Neural Network (GNN) architecture. This method not only preserves the global interference characteristic of quantum states but also realizes the efficient modeling of graph topology through the spectral graph methods. Experiments show that the proposed method is superior to many classical graph learning models in tasks such as node classification and graph structure inference. The third and fourth components of this thesis collectively explore quantum approaches to hyperdimensional computing (HDC), establishing a progressive transition from native quantum-state-based implementation to quantum-enhanced HDC strategies. Initially, we investigate the intrinsic mathematical correspondence between quantum states and high-dimensional hypervectors, and propose a novel quantum-state-based high-dimensional encoding method. This method is realized through quantum circuits capable of generating hypervectors with controllable entropy, thereby implementing essential HDC operations, such as classification and memory reconstruction, on real quantum hardware. This marks the first successful migration of core HDC mechanisms into a fully quantum-native framework. Building upon this foundation, we further propose the first quantum-enhanced HDC strategy, which does not rely solely on quantum-native implementations but rather utilizes key quantum features to boost the efficiency and expressivity of conventional HDC systems. Specifically, we introduce mechanisms such as quantum-reference-state-based binding, using density matrices to represent superclass states, and quantum state tomography for robust feature extraction. These innovations significantly enhance the resilience and performance of HDC under high-noise and high-dimensional sensing environments. The resulting models achieve superior accuracy and robustness across a variety of multi-class classification tasks, demonstrating the practical benefits of integrating quantum computation into the broader HDC paradigm. In this thesis, experimental validation is carried out in multiple real and simulation environments, including Qiskit and Paddle Quantum platforms, and a complete closed loop was achieved from theoretical derivation, quantum circuit design to end-to-end experimental evaluation. The results show that quantum methods can expand the expressive power of classical models and become an important tool to deal with large-scale, structured data problems in the future. The work in this thesis provides methodological support for quantum machine learning from theory to application, and also expands the research boundaries of high-dimensional computation and graph learning in the quantum background.
This thesis focuses on the development, application, and high-performance implementation of numerical methods for simulating quantum many-body systems. In the first chapter, I provide an overview of several most successful conventional approaches for simulating quantum many-body systems, along with their current limitations. Then, the basic properties of the quantum spin model, which will be the subject of study in the following chapters, and its ground state are briefly summarized. Additionally, I discuss the background and the motivations of the research projects carried out during my PhD research. Chapter 2 introduces two numerical algorithms that are extensively used in this thesis, which are exact diagonalization (ED) and variational Monte Carlo. I outline the process of constructing a Hamiltonian matrix and employing iterative methods for exact diagonalization. Subsequently, I introduce the mechanism of the four important components in the ``standard" variational Monte Carlo that are widely used in the most recent research. In Chapter 3, we propose a symmetry-projected variational ansatz in the form of linear combinations of simple restricted Boltzmann machines. This construction allows one to explore states outside of the original variational manifold and increase the representation power with moderate computational effort. Besides allowing one to restore spatial symmetries, an expansion in terms of Krylov states using a Lanczos recursion offers a solution that can further improve the quantum state accuracy. We illustrate these ideas with an application to the Heisenberg J1−J2J_1-J_2J1​−J2​ model on the square lattice, a paradigmatic problem under debate in condensed matter physics,and achieve state-of-the-art accuracy in the representation of the ground state. In Chapter 4, we present a variational approach based on a Chebyshev expansion of the spectral function, and each Chebyshev polynomial is represented by a neural network quantum state. The Chebyshev moments are obtained by recursively applying the Hamiltonian and projecting on the space of variational states using a modified natural gradient descent method. We compare this approach with a modified approximation of the spectral function which uses a Krylov subspace constructed from the "Chebyshev wave functions." We present results for the one-dimensional and two-dimensional Heisenberg models on the square lattice and compare them with those obtained by other methods in the literature. In Chapter 5, we describe a method to carry out thermodynamic simulations of quantum many-body models using typicality and variational representations of quantum states. Minimally entangled typical thermal states (METTS) are a construction that allows one to solve for the imaginary time evolution of quantum many-body systems. By using wave functions that are weakly entangled, one can take advantage of efficient representations in the form of matrixproduct states. We generalize these ideas to arbitrary variational wave functions and we focus, as an illustration, on the particular case of restricted Boltzmann machines. We demonstrate the application of the method to quantum spin systems in one and two spatial dimensions. In Chapter 6, we study the properties of the impurity band in heavily doped nonmagnetic semiconductors using the Jacobi-Davidson algorithm and the supervised deep learning method. The disorder averaged inverse participation ratio and Thouless number calculation show us the rich structure inside the impurity band. A convolutional neural network model, which is trained to distinguish the extended/localized phase of the Anderson model with high accuracy, shows us the results in good agreement with the conventional approach. Together, we find that there are three mobility edges in the impurity band for a specific on-site impurity potential, which means the presence of the extended states while filling the impurity band. In the final chapter, Chapter 7, we discuss the implementation of architecture-aware optimizations for spin dynamics simulations on x86 CPUs and Nvidia GPUs. The time cost of evaluating the spin-spin correlation functions in real space increases quadratically as the number of spins N, leading to significant computational effort, making the simulation of large spin systems very challenging. We propose to use a highly optimized general matrix multiply (GEMM) subroutine to calculate the dynamical spin-spin correlation function that can achieve near-optimal hardware utilization. Furthermore, we fuse the element-wise operations in the calculation of S(q,t) into the in-house GEMM kernel to reduce memory latency. On Nvidia GPU, we perform the on-the-fly calculation in the epilogue of the GEMM subroutine to avoid saving intermediate results on global memory, which significantly reduces memory usage and achieves better performance than cuBLAS\mathtt{cuBLAS}cuBLAS.--Author's abstract