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

arXiv:2412.04133 · Journal of High Energy Physics

Simulating matrix models with tensor networks

Enrico M. Brehm, Yibin Guo, Karl Jansen, Enrico Rinaldi

Published Sep 16, 2025• 0 citations
arXivHTMLPDF

Abstract

A bstract Matrix models, as quantum mechanical systems without explicit spatial dependence, provide valuable insights into higher-dimensional gauge and gravitational theories, especially within the framework of string theory, where they can describe quantum black holes via the holographic principle. Simulating these models allows for exploration of their kinematic and dynamic properties, particularly in parameter regimes that are analytically intractable. In this study, we examine the potential of tensor network techniques for such simulations. Specifically, we construct ground states as matrix product states and analyse features such as their entanglement structure.

DOI
10.1007/jhep09(2025)116

Related papers

Quantum Simulation of Molecular Dynamics with Tensor Networks

Jincheng Zhang

This paper explores the application of tensor network methods for simulating molecular dynamics on quantum computers. Traditional molecular dynamics simulations are computationally expensive, particularly for complex systems exhibiting strong quantum correlations. Tensor networks provide a powerful framework for representing and manipulating high-dimensional quantum states, potentially offering a pathway to efficiently simulate molecular dynamics by directly leveraging quantum computational resources. This work details the theoretical framework, outlining how tensor network techniques, specifically Matrix Product States (MPS) and Tree Tensor Networks (TTN), can be adapted for this purpose. We present a simplified model of a diatomic molecule to illustrate the core concept: the construction of a tensor network representation of the molecular wavefunction, followed by the application of time evolution operators to simulate dynamics. The focus is on demonstrating the potential of this approach rather than a fully optimized simulation, highlighting key challenges and future research directions. The efficiency gains compared to classical methods are discussed, acknowledging the significant technological hurdles involved in realizing this approach on near-term quantum devices. We investigate the scalability of the method, considering the limitations imposed by the bond dimension of the tensor network. The ultimate goal is to demonstrate how tensor networks can provide a viable strategy for tackling computationally intractable molecular dynamics problems, paving the way for a new era of quantum-enhanced molecular simulations.

•Sep 5, 2026•0 citations

Matrix-Model Simulations Using Quantum Computing, Deep Learning, and Lattice Monte Carlo

Enrico Rinaldi, Xizhi Han, Mohammad Hassan +4 more

Matrix quantum mechanics plays various important roles in theoretical physics, such as a holographic description of quantum black holes, and it underpins the only practical numerical approach to the study of complex high-dimensional supergravity theories.Understanding quantum black holes and the role of entanglement in a holographic setup is of paramount importance for the realization of a quantum theory of gravity.Moreover, a complete numerical understanding of the holographic duality and the emergence of geometric space-time features from microscopic degrees of freedom could pave the way for new discoveries in quantum information science.Euclidean lattice Monte Carlo simulations are the de facto numerical tool for understanding the spectrum of large matrix models and have been used to test the holographic duality.However, they are not tailored to extract dynamical properties or even the quantum wave function of the ground state of matrix models.Quantum computing and deep learning provide potentially useful approaches to study the dynamics of matrix quantum mechanics.If successful in the context of matrix models, these rapidly improving numerical techniques could become the new Swiss army knife of quantum gravity practitioners.In this paper, we perform the first systematic survey for quantum computing and deep-learning approaches to matrix quantum mechanics, comparing them to lattice Monte Carlo simulations.These provide baseline benchmarks before addressing more complicated problems.In particular, we test the performance of each method by calculating the low-energy spectrum.

arXiv:2108.02942•PRX Quantum•Feb 10, 2022•47 citations

Tensor network approaches: Ground states and dynamics in quantum many-body systems

Ho N. Phien

The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.

•Jan 1, 2013•0 citations

Tensor-network toolbox for probing dynamics of non-Abelian gauge theories

Emil Mathew, Navya Gupta, Saurabh V. Kadam +4 more

Tensor-network methods enable probing dynamics of strongly interacting quantum many-body systems, including gauge theories, via Hamiltonian simulation, hence bypassing sign problems. They also have the potential to inform efficient quantum-simulation algorithms of the same theories. We develop and benchmark a matrix-product-state ansatz for the SU(2) lattice gauge theory using the loop-string-hadron formulation. This formulation has been demonstrated to be advantageous in Hamiltonian simulation of non-Abelian gauge theories. It is applicable to both SU(2) and SU(3) gauge groups, to periodic and open boundary conditions, and to 1+1 and higher dimensions. In this work, we report on progress in computing static and dynamical observables in a SU(2) gauge theory in (1+1)D, pushing the boundary of existing studies.

arXiv:2501.18301•International Symposium on Lattice Field Theory (LATTICE)•Feb 15, 2025•2 citations

Quantum Gauge Networks: A New Kind of Tensor Network

Kevin Slagle

Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks : a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k -point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(Mk) . In comparison, for just k=1 , an exponentially larger bond dimension of 2M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.

arXiv:2210.12151•Quantum•Sep 14, 2023•3 citations

Tensor networks for black hole interiors: non-isometries, quantum extremal surfaces, and wormholes

Gracemarie Bueller, Oliver Dewolfe A, Kenneth Higginbotham

A bstract We use hyperbolic tensor networks to construct a holographic map for black hole interiors that adds a notion of locality to the non-isometric codes proposed by Akers, Engelhardt, Harlow, Penington, and Vardhan. We use tools provided by these networks to study the relationship between non-isometries and quantum extremal surfaces behind the horizon. Furthermore, we introduce a limited notion of dynamics for these interior tensor networks based on the qudit models introduced by Akers et al., and study the evolution of quantum extremal surfaces in an evaporating black hole. We also find a tensor network description of a wormhole connecting the black hole interior to the radiation, providing a mechanism for interior states and operators to be encoded in the radiation after the Page time. As a particular case, we construct a tensor network realization of the backwards-forwards maps recently proposed to incorporate non-trivial effective dynamics in dynamical constructions of these non-isometric black hole codes.

arXiv:2407.01666•Journal of High Energy Physics•Oct 1, 2024•5 citations
A bstract Matrix models, as quantum mechanical systems without explicit spatial dependence, provide valuable insights into higher-dimensional gauge and gravitational theories, especially within the framework of string theory, where they can describe quantum black holes via the holographic principle. Simulating these models allows for exploration of their kinematic and dynamic properties, particularly in parameter regimes that are analytically intractable. In this study, we examine the potential of tensor network techniques for such simulations. Specifically, we construct ground states as matrix product states and analyse features such as their entanglement structure.
This paper explores the application of tensor network methods for simulating molecular dynamics on quantum computers. Traditional molecular dynamics simulations are computationally expensive, particularly for complex systems exhibiting strong quantum correlations. Tensor networks provide a powerful framework for representing and manipulating high-dimensional quantum states, potentially offering a pathway to efficiently simulate molecular dynamics by directly leveraging quantum computational resources. This work details the theoretical framework, outlining how tensor network techniques, specifically Matrix Product States (MPS) and Tree Tensor Networks (TTN), can be adapted for this purpose. We present a simplified model of a diatomic molecule to illustrate the core concept: the construction of a tensor network representation of the molecular wavefunction, followed by the application of time evolution operators to simulate dynamics. The focus is on demonstrating the potential of this approach rather than a fully optimized simulation, highlighting key challenges and future research directions. The efficiency gains compared to classical methods are discussed, acknowledging the significant technological hurdles involved in realizing this approach on near-term quantum devices. We investigate the scalability of the method, considering the limitations imposed by the bond dimension of the tensor network. The ultimate goal is to demonstrate how tensor networks can provide a viable strategy for tackling computationally intractable molecular dynamics problems, paving the way for a new era of quantum-enhanced molecular simulations.
Matrix quantum mechanics plays various important roles in theoretical physics, such as a holographic description of quantum black holes, and it underpins the only practical numerical approach to the study of complex high-dimensional supergravity theories.Understanding quantum black holes and the role of entanglement in a holographic setup is of paramount importance for the realization of a quantum theory of gravity.Moreover, a complete numerical understanding of the holographic duality and the emergence of geometric space-time features from microscopic degrees of freedom could pave the way for new discoveries in quantum information science.Euclidean lattice Monte Carlo simulations are the de facto numerical tool for understanding the spectrum of large matrix models and have been used to test the holographic duality.However, they are not tailored to extract dynamical properties or even the quantum wave function of the ground state of matrix models.Quantum computing and deep learning provide potentially useful approaches to study the dynamics of matrix quantum mechanics.If successful in the context of matrix models, these rapidly improving numerical techniques could become the new Swiss army knife of quantum gravity practitioners.In this paper, we perform the first systematic survey for quantum computing and deep-learning approaches to matrix quantum mechanics, comparing them to lattice Monte Carlo simulations.These provide baseline benchmarks before addressing more complicated problems.In particular, we test the performance of each method by calculating the low-energy spectrum.
The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.
Tensor-network methods enable probing dynamics of strongly interacting quantum many-body systems, including gauge theories, via Hamiltonian simulation, hence bypassing sign problems. They also have the potential to inform efficient quantum-simulation algorithms of the same theories. We develop and benchmark a matrix-product-state ansatz for the SU(2) lattice gauge theory using the loop-string-hadron formulation. This formulation has been demonstrated to be advantageous in Hamiltonian simulation of non-Abelian gauge theories. It is applicable to both SU(2) and SU(3) gauge groups, to periodic and open boundary conditions, and to 1+1 and higher dimensions. In this work, we report on progress in computing static and dynamical observables in a SU(2) gauge theory in (1+1)D, pushing the boundary of existing studies.
Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks : a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k -point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(Mk) . In comparison, for just k=1 , an exponentially larger bond dimension of 2M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.
A bstract We use hyperbolic tensor networks to construct a holographic map for black hole interiors that adds a notion of locality to the non-isometric codes proposed by Akers, Engelhardt, Harlow, Penington, and Vardhan. We use tools provided by these networks to study the relationship between non-isometries and quantum extremal surfaces behind the horizon. Furthermore, we introduce a limited notion of dynamics for these interior tensor networks based on the qudit models introduced by Akers et al., and study the evolution of quantum extremal surfaces in an evaporating black hole. We also find a tensor network description of a wormhole connecting the black hole interior to the radiation, providing a mechanism for interior states and operators to be encoded in the radiation after the Page time. As a particular case, we construct a tensor network realization of the backwards-forwards maps recently proposed to incorporate non-trivial effective dynamics in dynamical constructions of these non-isometric black hole codes.