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:2610.32754

Tensor Networks for Materials Simulation and Quantum Chemistry

Saeed S. Jahromi, Augustine Kshetrimayum, Roman Rausch, Sukhbinder Singh, Román Orús

Published Oct 23, 2026• 0 citations
arXivHTMLPDF

Abstract

Predicting the properties of correlated materials and molecules often requires a many-body description that goes beyond single-particle and mean-field approximations. Tensor networks address this challenge by exploiting the entanglement structure of quantum states to construct compact, systematically improvable representations. Although developed largely for idealized model Hamiltonians, these methods are increasingly being integrated into material-specific calculations. This Perspective introduces their underlying principles and examines how network geometry, bond-dimension truncation, and approximate contraction determine the accuracy and computational reach of these approaches. We survey applications across regimes of increasing complexity, ranging from ground-state properties of quantum magnets and itinerant-fermion systems to excitation spectra, nonequilibrium dynamics, finite-temperature and open systems, and molecular electronic structure. We then examine four routes connecting these methods to real materials, including experimentally constrained models, downfolded Hamiltonians, dynamical mean-field theory with tensor network impurity solvers, and quantum embedding. Throughout, we evaluate the maturity of existing capabilities and their principal limitations, synthesizing this assessment into a practical method-selection guide. We argue that reliable materials predictions require quantifying uncertainties introduced at each stage, from constructing material-specific Hamiltonians to extracting experimentally accessible observables. Finally, we identify the algorithmic advances and reproducible computational practices needed to establish tensor networks as a routine tool for predictive materials science and quantum chemistry.

DOI
10.48550/arxiv.2610.32754

Related papers

Quantitative Description of Strongly Correlated Materials by Combining Downfolding Techniques and Tensor Networks

Daan Vrancken, Simon Ganne, Daan Verraes +5 more

High Resolution Image Download MS PowerPoint Slide We present a high-accuracy procedure for electronic structure calculations of strongly correlated materials. To address limitations in current electronic structure methods, we employ density functional theory in combination with the constrained random phase approximation to construct an effective multiband Hubbard model, which is subsequently solved using tensor networks. Our work focuses on one-dimensional and quasi-one-dimensional materials, for which we employ the machinery of matrix product states. We apply this framework to the conjugated polymers trans -polyacetylene and polythiophene, as well as the quasi-one-dimensional charge-transfer insulator Sr 2 CuO 3 . The predicted band gaps show quantitative agreement with state-of-the-art computational techniques and experimental measurements. Beyond band gaps, tensor networks provide access to a wide range of physically relevant properties, including spin magnetization and various excitation energies. Their flexibility supports the implementation of complex Hamiltonians with longer-range interactions, while the bond dimension enables systematic control over accuracy. Furthermore, the computational cost scales efficiently with system size, demonstrating the framework’s scalability.

arXiv:2502.19588•Journal of Chemical Theory and Computation•Aug 10, 2025•0 citations

Tensor network solvers for ultra-large tight-binding Hamiltonians: algorithms and applications

T. V. C. Antão, Anouar Moustaj, Yitao Sun +1 more

Understanding quantum materials at meso and even macroscopic scales requires tight-binding calculations on system sizes where explicit matrix representations become prohibitively costly. This represents a major bottleneck to rationalize phenomena in moiré and super-moiré heterostructures and quasicrystals. Here, we present a unified tensor-network methodology to solve tight-binding problems at exceptionally large scales, by mapping a system of $N = 2^L$ sites onto a many-body problem of $L$ pseudospin sites, which is subsequently solved with tensor network algorithms. For Hamiltonians with compressible real-space structure, the tensor network bond dimension remains modest, typically of order a few tens, independent of $N$. Tensor network representations of arbitrary hopping functions including long-range, spatially modulated, and twisted-layer couplings are built with quantics tensor cross interpolation, and all physical observables are evaluated entirely with tensor network algebra without explicit matrix storage or diagonalization. We demonstrate applications to spectral functions, momentum-space spectra via the tensor-network quantum Fourier transform, real-space topological invariants, real-time dynamics, correlation induced symmetry breaking with self-consistent mean-field calculations, non-Hermitian phenomena, and excitonic many-body physics. Our methodology enables routinely solving systems with billions of sites, by leveraging the tensor network compressibility of real-space structures, and establishing a flexible framework to study quantum matter at ultra-large length scales. The methodology is implemented in the open-source Julia package TensorBinding.

arXiv:2607.00991•Jul 1, 2026•0 citations

Quantum-Inspired Simulation of Complex Systems using Tensor Networks

Jincheng Zhang

The accurate simulation of complex systems, encompassing fields like materials science, quantum chemistry, and finance, often presents a formidable computational challenge. Traditional methods frequently struggle to scale effectively, particularly when dealing with high-dimensionality or intricate correlations. This paper introduces a novel simulation approach leveraging tensor networks (TN) in conjunction with quantum-inspired sampling techniques. The core idea is to approximate the dynamics of these complex systems by exploiting the inherent structure of tensor networks and employing sampling strategies inspired by quantum measurement processes. We demonstrate that this hybrid approach offers a pathway towards scalable simulations, achieving high accuracy while mitigating the computational bottlenecks associated with conventional methods. The key innovations lie in the adaptive construction of TNs based on the system's correlation structure and the utilization of quantum-inspired sampling methods to efficiently capture the relevant dynamics. This work presents a theoretical framework and outlines a methodology for implementing such simulations, paving the way for advancements in the modeling and understanding of complex systems.

•Sep 6, 2026•0 citations

Solving Intractable Chemical Problems by Tensor Decomposition

Nina Glaser, Markus Reiher

Many complex chemical problems encoded in terms of physics-based models become computationally intractable for traditional numerical approaches due to their unfavorable scaling with increasing molecular size. Tensor decomposition techniques can overcome such challenges by decomposing unattainably large numerical representations of chemical problems into smaller, tractable ones. In the first two decades of this century, algorithms based on such tensor factorizations have become state-of-the-art methods in various branches of computational chemistry, ranging from molecular quantum dynamics to electronic structure theory and machine learning. Here, we consider the role that tensor decomposition schemes have played in expanding the scope of computational chemistry. We relate some of the most prominent methods to their common underlying tensor network formalisms, providing a unified perspective on leading tensor-based approaches in chemistry and materials science.

arXiv:2401.16246•CHIMIA International Journal for Chemistry•Apr 24, 2024•0 citations

On the out-of-equilibrium dynamics with tensor networks

Ramos Marimón, Carlos

[eng] Quantum many-body dynamics is a vast field of physics at the intersection of statistical mechanics, condensed matter, quantum information, and computational physics. Understanding the time evolution of observable correlations—such as those involved in material responses—is both a milestone for technological advancement and a corner-stone for generating fundamental knowledge. At the intersection of emergent collective behavior in many-body systems, quantum physics, and information theory lies the classical simulation of out-of-equilibrium phenomena. Without numerical tools, progress in disciplines that require heavy computations with high-dimensional vectors and matrices would be limited to purely analytical predictions and constrained by the available expertise and resources needed to build benchmarking experiments. The goal of this thesis is to advance the classical simulation of quantum many-body systems using Tensor Networks. This technique has proven fruitful for predicting equilibrium ground states and thermal properties of one-dimensional systems, yet it still faces challenges when applied to out-of-equilibrium scenarios. In brief, the dynamics of experimentally accessible expectation values can be represented as a 2D Tensor Network, which must be contracted using iterative methods such as Time-Evolving Block Decimation. However, the memory and computational time required for these calculations—which reflect the methods’ complexity—are known to grow exponentially with the simulated physical time in generic systems. This limitation is often referred to in the literature as the entanglement barrier. This manuscript tackles the problem through the three inequivalent ways in which the 2D Tensor Network can be contracted. In Chapter 3, we study how Schrödinger-picture contraction from the state edge of the network can be modified to improve the convergence of iterative contraction and reduce truncation errors in small systems. To this end, we explore physical decoherence in optimized bases and artificial generalized decoherence, finding that both alternatives show promise for new protocols that overcome the entanglement barrier. In Chapter 4, we explore Heisenberg-picture contraction from the observable edge, combining the concept of generalized decoherence with Pauli Weight truncation. By thoroughly characterizing the Pauli weight requirements to accurately describe the time evolution of local expectation values from initial product states, we conclude that truncating off-diagonal Pauli Weights is an effective scheme for simulating long-time dynamics—and we successfully implement it. We conclude with a spatial characterization of Pauli Weight spreading, bridging Tensor Network simulations and the field of operator hydrodynamics. Finally, in Chapter 5, we focus on the transverse contraction of the 2D Tensor Net-work using the light-cone algorithm, analyzing its variants in terms of truncation strategies and convergence across different models. This leads to a systematic characterization of the method based on the integrability of the underlying Hamiltonians and single-spin noise models.

•Sep 10, 2025•0 citations

Solving Intractable Chemical Problems by Tensor Decomposition

Nina Glaser, Markus Reiher

Many complex chemical problems encoded in terms of physics-based models become computationally intractable for traditional numerical approaches due to their unfavorable scaling with increasing molecular size. Tensor decomposition techniques can overcome such challenges by decomposing unattainably large numerical representations of chemical problems into smaller, tractable ones. In the first two decades of this century, algorithms based on such tensor factorizations have become state-of-the-art methods in various branches of computational chemistry, ranging from molecular quantum dynamics to electronic structure theory and machine learning. Here, we consider the role that tensor decomposition schemes have played in expanding the scope of computational chemistry. We relate some of the most prominent methods to their common underlying tensor network formalisms, providing a unified perspective on leading tensor-based approaches in chemistry and materials science.

•Jan 1, 2024•0 citations
Predicting the properties of correlated materials and molecules often requires a many-body description that goes beyond single-particle and mean-field approximations. Tensor networks address this challenge by exploiting the entanglement structure of quantum states to construct compact, systematically improvable representations. Although developed largely for idealized model Hamiltonians, these methods are increasingly being integrated into material-specific calculations. This Perspective introduces their underlying principles and examines how network geometry, bond-dimension truncation, and approximate contraction determine the accuracy and computational reach of these approaches. We survey applications across regimes of increasing complexity, ranging from ground-state properties of quantum magnets and itinerant-fermion systems to excitation spectra, nonequilibrium dynamics, finite-temperature and open systems, and molecular electronic structure. We then examine four routes connecting these methods to real materials, including experimentally constrained models, downfolded Hamiltonians, dynamical mean-field theory with tensor network impurity solvers, and quantum embedding. Throughout, we evaluate the maturity of existing capabilities and their principal limitations, synthesizing this assessment into a practical method-selection guide. We argue that reliable materials predictions require quantifying uncertainties introduced at each stage, from constructing material-specific Hamiltonians to extracting experimentally accessible observables. Finally, we identify the algorithmic advances and reproducible computational practices needed to establish tensor networks as a routine tool for predictive materials science and quantum chemistry.
High Resolution Image Download MS PowerPoint Slide We present a high-accuracy procedure for electronic structure calculations of strongly correlated materials. To address limitations in current electronic structure methods, we employ density functional theory in combination with the constrained random phase approximation to construct an effective multiband Hubbard model, which is subsequently solved using tensor networks. Our work focuses on one-dimensional and quasi-one-dimensional materials, for which we employ the machinery of matrix product states. We apply this framework to the conjugated polymers trans -polyacetylene and polythiophene, as well as the quasi-one-dimensional charge-transfer insulator Sr 2 CuO 3 . The predicted band gaps show quantitative agreement with state-of-the-art computational techniques and experimental measurements. Beyond band gaps, tensor networks provide access to a wide range of physically relevant properties, including spin magnetization and various excitation energies. Their flexibility supports the implementation of complex Hamiltonians with longer-range interactions, while the bond dimension enables systematic control over accuracy. Furthermore, the computational cost scales efficiently with system size, demonstrating the framework’s scalability.
Understanding quantum materials at meso and even macroscopic scales requires tight-binding calculations on system sizes where explicit matrix representations become prohibitively costly. This represents a major bottleneck to rationalize phenomena in moiré and super-moiré heterostructures and quasicrystals. Here, we present a unified tensor-network methodology to solve tight-binding problems at exceptionally large scales, by mapping a system of N=2LN = 2^LN=2L sites onto a many-body problem of LLL pseudospin sites, which is subsequently solved with tensor network algorithms. For Hamiltonians with compressible real-space structure, the tensor network bond dimension remains modest, typically of order a few tens, independent of NNN. Tensor network representations of arbitrary hopping functions including long-range, spatially modulated, and twisted-layer couplings are built with quantics tensor cross interpolation, and all physical observables are evaluated entirely with tensor network algebra without explicit matrix storage or diagonalization. We demonstrate applications to spectral functions, momentum-space spectra via the tensor-network quantum Fourier transform, real-space topological invariants, real-time dynamics, correlation induced symmetry breaking with self-consistent mean-field calculations, non-Hermitian phenomena, and excitonic many-body physics. Our methodology enables routinely solving systems with billions of sites, by leveraging the tensor network compressibility of real-space structures, and establishing a flexible framework to study quantum matter at ultra-large length scales. The methodology is implemented in the open-source Julia package TensorBinding.
The accurate simulation of complex systems, encompassing fields like materials science, quantum chemistry, and finance, often presents a formidable computational challenge. Traditional methods frequently struggle to scale effectively, particularly when dealing with high-dimensionality or intricate correlations. This paper introduces a novel simulation approach leveraging tensor networks (TN) in conjunction with quantum-inspired sampling techniques. The core idea is to approximate the dynamics of these complex systems by exploiting the inherent structure of tensor networks and employing sampling strategies inspired by quantum measurement processes. We demonstrate that this hybrid approach offers a pathway towards scalable simulations, achieving high accuracy while mitigating the computational bottlenecks associated with conventional methods. The key innovations lie in the adaptive construction of TNs based on the system's correlation structure and the utilization of quantum-inspired sampling methods to efficiently capture the relevant dynamics. This work presents a theoretical framework and outlines a methodology for implementing such simulations, paving the way for advancements in the modeling and understanding of complex systems.
Many complex chemical problems encoded in terms of physics-based models become computationally intractable for traditional numerical approaches due to their unfavorable scaling with increasing molecular size. Tensor decomposition techniques can overcome such challenges by decomposing unattainably large numerical representations of chemical problems into smaller, tractable ones. In the first two decades of this century, algorithms based on such tensor factorizations have become state-of-the-art methods in various branches of computational chemistry, ranging from molecular quantum dynamics to electronic structure theory and machine learning. Here, we consider the role that tensor decomposition schemes have played in expanding the scope of computational chemistry. We relate some of the most prominent methods to their common underlying tensor network formalisms, providing a unified perspective on leading tensor-based approaches in chemistry and materials science.
[eng] Quantum many-body dynamics is a vast field of physics at the intersection of statistical mechanics, condensed matter, quantum information, and computational physics. Understanding the time evolution of observable correlations—such as those involved in material responses—is both a milestone for technological advancement and a corner-stone for generating fundamental knowledge. At the intersection of emergent collective behavior in many-body systems, quantum physics, and information theory lies the classical simulation of out-of-equilibrium phenomena. Without numerical tools, progress in disciplines that require heavy computations with high-dimensional vectors and matrices would be limited to purely analytical predictions and constrained by the available expertise and resources needed to build benchmarking experiments. The goal of this thesis is to advance the classical simulation of quantum many-body systems using Tensor Networks. This technique has proven fruitful for predicting equilibrium ground states and thermal properties of one-dimensional systems, yet it still faces challenges when applied to out-of-equilibrium scenarios. In brief, the dynamics of experimentally accessible expectation values can be represented as a 2D Tensor Network, which must be contracted using iterative methods such as Time-Evolving Block Decimation. However, the memory and computational time required for these calculations—which reflect the methods’ complexity—are known to grow exponentially with the simulated physical time in generic systems. This limitation is often referred to in the literature as the entanglement barrier. This manuscript tackles the problem through the three inequivalent ways in which the 2D Tensor Network can be contracted. In Chapter 3, we study how Schrödinger-picture contraction from the state edge of the network can be modified to improve the convergence of iterative contraction and reduce truncation errors in small systems. To this end, we explore physical decoherence in optimized bases and artificial generalized decoherence, finding that both alternatives show promise for new protocols that overcome the entanglement barrier. In Chapter 4, we explore Heisenberg-picture contraction from the observable edge, combining the concept of generalized decoherence with Pauli Weight truncation. By thoroughly characterizing the Pauli weight requirements to accurately describe the time evolution of local expectation values from initial product states, we conclude that truncating off-diagonal Pauli Weights is an effective scheme for simulating long-time dynamics—and we successfully implement it. We conclude with a spatial characterization of Pauli Weight spreading, bridging Tensor Network simulations and the field of operator hydrodynamics. Finally, in Chapter 5, we focus on the transverse contraction of the 2D Tensor Net-work using the light-cone algorithm, analyzing its variants in terms of truncation strategies and convergence across different models. This leads to a systematic characterization of the method based on the integrability of the underlying Hamiltonians and single-spin noise models.
Many complex chemical problems encoded in terms of physics-based models become computationally intractable for traditional numerical approaches due to their unfavorable scaling with increasing molecular size. Tensor decomposition techniques can overcome such challenges by decomposing unattainably large numerical representations of chemical problems into smaller, tractable ones. In the first two decades of this century, algorithms based on such tensor factorizations have become state-of-the-art methods in various branches of computational chemistry, ranging from molecular quantum dynamics to electronic structure theory and machine learning. Here, we consider the role that tensor decomposition schemes have played in expanding the scope of computational chemistry. We relate some of the most prominent methods to their common underlying tensor network formalisms, providing a unified perspective on leading tensor-based approaches in chemistry and materials science.