Many-body correlations in strongly coupled liquids and plasmas are critical for many applications in nanofluids, biology, and fusion-related plasma physics, but their description in fully heterogeneous environments remains challenging due to the high-dimensional equations involved. Recently, tensor network decompositions have emerged as powerful tools for tackling such equations by reducing memory usage and computational complexity. In this paper, we solve for equilibrium density and density-density correlation functions of liquids in confined heterogeneous environments using tensor network methods. We demonstrate that these functions admit high compression when their lengthscale dependence is encoded via quantized tensor trains or when their spatial-coordinate dependence is represented in standard tensor-train format, but not with respect to their dependence on distinct particle coordinates.
Many-body correlations in strongly coupled liquids and plasmas are critical for many applications in nanofluids, biology, and fusion-related plasma physics, but their description in fully heterogeneous environments remains challenging due to the high-dimensional equations involved. Recently, tensor network decompositions have emerged as powerful tools for tackling such equations by reducing memory usage and computational complexity. In this paper, we solve for equilibrium density and density-density correlation functions of liquids in confined heterogeneous environments using tensor network methods. We demonstrate that these functions admit high compression when their lengthscale dependence is encoded via quantized tensor trains or when their spatial-coordinate dependence is represented in standard tensor-train format, but not with respect to their dependence on distinct particle coordinates.
Solving the high-dimensional, nonlinear partial differential equations that govern the rich physics of plasmas remains a major computational challenge. In fluid dynamics, quantum-inspired methods based on tensor-network techniques have recently emerged as a promising new paradigm, offering large degrees of data compression on conventional hardware and a natural pathway towards solving exponentially large problems on quantum computers. Early studies suggest that tensor-network methods may also help overcome key bottlenecks in computational plasma dynamics, particularly for industry-relevant scenarios where conventional simulations remain costly. In this work, we present recent progress in developing tensor-network methods compared to standard particle-in-cell codes and discuss their capability to overcome the bottlenecks of conventional approaches. We further extend the tensor-network formulation to support the insertion of electromagnetic fields at arbitrary spatial locations. This capability is demonstrated through the injection of a laser field to accelerate a plasma, providing a key step towards tensor-network-based simulation of externally driven plasma systems.
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.
The dynamics of plasmas are governed by a set of non-linear differential equations which remain challenging to solve directly for large 2D and 3D problems. Here we investigate how tensor networks could be applied to plasmas described by the Vlasov-Maxwell system of equations and investigate parameter regimes which show promise for efficient simulations. We show for low-dimensional problems that the simplest form of tensor networks known as a Matrix Product State performs sufficiently well, however in regimes with a strong permanent magnetic field or high-dimensional problems one may need to consider alternative tensor network geometries. We conclude the study of the Vlasov-Maxwell system with the application of tensor networks to an industrially relevant test case and validate our results against state of the art plasma solvers based on Particle-In-Cell codes. We also extend the application of tensor networks to the alternative plasma description of Magnetohydrodynamics and outline how this can be encoded using Matrix Product States.
Tensor networks are a very powerful data structure tool originating from simulations of quantum systems. In recent years, they have seen increased use in machine learning, mostly in trainings with gradient-based techniques, due to their flexibility and performance achieved by exploiting hardware acceleration. As ansatzes, tensor networks can be used with flexible geometries, and it is known that for highly regular ones, their dimensionality has a large impact on performance and representation power. For heterogeneous structures, however, these effects are not completely characterized. In this article, we train tensor networks with different geometries to encode a random quantum state, and see that densely connected structures achieve better infidelities than more sparse structures, with higher success rates and less time. Additionally, we give some general insight on how to improve the memory requirements of these sparse structures and the impact of such improvement on the trainings. Finally, as we use HPC resources for the calculations, we discuss the requirements for this approach and showcase performance improvements with GPU acceleration on a last-generation supercomputer.
Tensor networks were developed in the context of many-body physics as compressed representations of multiparticle quantum states. These representations mitigate the exponential complexity of many-body systems by capturing only the most relevant dependencies. Due to the formal similarity between quantum entanglement and statistical correlations, tensor networks have recently been integrated in machine learning, operating both as alternative learning architectures and as decompositions of components of neural networks. The expectation is that the theoretical understanding of tensor networks developed within quantum many-body physics leads to novel methods that offer advantages in terms of computational efficiency, explainability, or privacy. Here we review the use of tensor networks in the context of machine learning, providing a critical assessment of the state of the art, the potential advantages, and the challenges that must be overcome.
This work systematically investigates the tensor train (TT) compressibility of grid-represented Hartree-Fock (HF) and Density Functional Theory (DFT) orbitals across a range of molecular systems and TT formats (standard, quantized, and z-permuted quantized). To overcome limitations of current TT solvers, we employ a novel orthogonal tensor train cross approximation (TT-Cross-Orth) to decompose Hartree-Fock and DFT orbitals into TTs, enabling the study of large molecules. We find that the approximation error decreases exponentially with TT-rank for all systems studied and identify quantized tensor train as the most efficient TT format. Furthermore, we identify quasi-periodic and symmetric structures-including graphene, graphite layers, and polyalanine helices-as particularly favorable candidates exhibiting sublinear rank growth with system size. The tensor train approach automatically compresses quasi-symmetries and systems with symmetry defects, which makes it an attractive approach for materials science applications. TT-Cross-Orth enforces orthogonality during the decomposition, thereby improving stability and reducing the number of function evaluations compared to standard TT-Cross. These findings establish an empirical foundation for the development of scalable tensor network methods for HF and DFT.