The correlation functions of quantum systems-central objects in quantum field theories-are defined in high-dimensional space-time domains.Their numerical treatment thus suffers from the curse of dimensionality, which hinders the application of sophisticated many-body theories to interesting problems.Here, we propose a multiscale space-time ansatz for correlation functions of quantum systems based on quantics tensor trains (QTTs), "qubits" describing exponentially different length scales.The ansatz then assumes a separation of length scales by decomposing the resulting high-dimensional tensors into tensor trains (also known as matrix product states).We numerically verify the ansatz for various equilibrium and nonequilibrium systems and demonstrate compression ratios of several orders of magnitude for challenging cases.Essential building blocks of diagrammatic equations, such as convolutions or Fourier transforms, are formulated in the compressed form.We numerically demonstrate the stability and efficiency of the proposed methods for the Dyson and Bethe-Salpeter equations.The QTT representation provides a unified framework for implementing efficient computations of quantum field theories.
Understanding entanglement remains one of the most intriguing problems in physics. While particle and site entanglement have been studied extensively, the investigation of length- or energy-scale entanglement—quantifying the information exchange between different length scales—has received far less attention. Here, we identify the quantics tensor train (QTT) technique, a matrix product state-inspired approach for overcoming computational bottlenecks in resource-intensive numerical calculations, as a renormalization group method by analytically expressing an exact cyclic reduction-based real-space renormalization scheme in QTT language, which serves as a natural formalism for the method. In doing so, we precisely match the QTT bond dimension—a measure of length-scale entanglement—to the number of rescaled couplings generated in each coarse-graining renormalization step. While QTTs have so far been applied almost exclusively to numerical problems in physics, our analytical calculations demonstrate that they are also powerful tools for mitigating computational costs in semianalytical treatments. We present our results for the one-dimensional tight-binding model with n th -nearest-neighbor hopping, where the 2 n rescaled couplings generated in the renormalization procedure precisely match the QTT bond dimension of the one-particle Green's function.
We present an application of quantics tensor trains (QTTs) and tensor cross interpolation (TCI) to the solution of a full set of self-consistent equations for multivariate functions, the so-called parquet equations. We show that the steps needed to evaluate the equations (Bethe-Salpeter equations, parquet equation, and Schwinger-Dyson equation) can be decomposed into basic operations on the QTT-TCI compressed objects. The repeated application of these operations does not lead to a loss of accuracy beyond a specified tolerance and the iterative scheme converges even for numerically demanding parameters. As examples, we take the Hubbard model in the atomic limit and the single impurity Anderson model, where the basic objects in parquet equations, the two-particle vertices, depend on three frequencies, but not on momenta. The results show that this approach is able to overcome major computational bottlenecks of standard numerical methods. The applied methods allow for an exponential increase of the number of grid points included in the calculations, and a corresponding exponential reduction of the computational error, for a linear increase in computational cost.
One of the challenges in diagrammatic simulations of nonequilibrium phenomena in lattice models is the large memory demand for storing momentum-dependent two-time correlation functions. This problem can be overcome with the recently introduced quantics tensor train (QTT) representation of multivariable functions. Here, we demonstrate nonequilibrium Green's function simulations within the GW and Migdal approximations with high momentum resolution, up to times which exceed the capabilities of standard implementations and are long enough to study, e.g., transient Floquet physics during multicycle electric field pulses and thermalization dynamics. The self-consistent calculation on the three-leg Kadanoff-Baym contour is fully self-contained, employing only QTT-compressed functions and input functions which are either generated directly in QTT form or obtained via quantics tensor cross interpolation.
Solving partial differential equations across multiple length scales represents a formidable challenge where reaching high precision can require a prohibitive amount of computer memory or computing time. However, the solutions to physics problems typically have structures operating on different length scales, and as a result exhibit a high degree of compressibility. Here, we use the quantics tensor train representation to build a tensor network solver for the time-dependent Gross-Pitaevskii equation. We demonstrate that the quantics approach generalizes well to the presence of the nonlinear term in the equation. We show that we can resolve phenomena across length scales separated by seven orders of magnitude in one dimension within one hour on a single core in a laptop, greatly surpassing the capabilities of more naive methods. We illustrate our methodology with various modulated optical trap potentials presenting features at vastly different length scales, including solutions to the Gross-Pitaevskii equation on two-dimensional grids above a trillion points ( 2 20 × 2 20 ). This quantum-inspired methodology can be readily extended to other partial differential equations combining spatial and temporal evolutions, providing a powerful method to solve highly featured differential equations at unprecedented length scales.
Quantification of stochastic or quantum systems by a joint probability density or wave function is a notoriously difficult computational problem, since the solution depends on all possible states (or realizations) of the system. Due to this combinatorial flavor, even a system containing as few as ten particles may yield as many as
1010 discretized states. None of even modern supercomputers are capable to cope with this curse of dimensionality straightforwardly, when the amount of quantum particles, for example, grows up to more or less interesting order of hundreds. A traditional approach for a long time was to avoid models formulated in terms of probabilistic functions, and simulate particular system realizations in a randomized process. Since different times in different communities, data-sparse methods came into play. Generally, they aim to define all data points indirectly, by a map from a low amount of representers, and recast all operations (e.g. linear system solution) from the initial data to the effective parameters. The most advanced techniques can be applied (at least, tried) to any given array, and do not rely explicitly on its origin. The current work contributes further progress to this area in the particular direction: tensor product methods for separation of variables. The separation of variables has a long history, and is based on the following elementary concept: a function of many variables may be expanded as a product of univariate functions. On the discrete level, a function is encoded by an array of its values, or a tensor. Therefore, instead of a huge initial array, the separation of variables allows to work with univariate factors with much less efforts. The dissertation contains a short overview of existing tensor representations: canonical PARAFAC, Hierarchical Tucker, Tensor Train (TT) formats, as well as the artificial tensorisation, resulting in the Quantized Tensor Train (QTT) approximation method. The contribution of the dissertation consists in both theoretical constructions and practical numerical algorithms for high-dimensional models, illustrated on the examples of the Fokker-Planck and the chemical master equations. Both arise from stochastic dynamical processes in multiconfigurational systems, and govern the evolution of the probability function in time. A special focus is put on time propagation schemes and their properties related to tensor product methods. We show that these applications yield large-scale systems of linear equations, and prove analytical separable representations of the involved functions and operators. We propose a new combined tensor format (QTT-Tucker), which descends from the TT format (hence TT algorithms may be generalized smoothly), but provides complexity reduction by an order of magnitude. We develop a robust iterative solution algorithm, constituting most advantageous properties of the classical iterative methods from numerical analysis and alternating density matrix renormalization group (DMRG) techniques from quantum physics. Numerical experiments confirm that the new method is preferable to DMRG algorithms. It is as fast as the simplest alternating schemes, but as reliable and accurate as the Krylov methods in linear algebra.
The nonequilibrium Green's function formalism provides a versatile and powerful framework for numerical studies of nonequilibrium phenomena in correlated many-body systems. For calculations starting from an equilibrium initial state, a standard approach consists of discretizing the Kadanoff-Baym contour and implementing a causal time-stepping scheme in which the self-energy of the system plays the role of a memory kernel. This approach becomes computationally expensive at long times, because of the convolution integrals and the large amount of computer memory needed to store the Green's functions. A recent idea for the compression of nonequilibrium Green's functions is the quantics tensor train representation. Here, we explore this approach by implementing equilibrium and nonequilibrium simulations of the two-dimensional Hubbard model with a second-order weak-coupling approximation to the self-energy. We show that calculations with compressed two-time functions are possible without any loss of accuracy, and that the quantics tensor train implementation shows a much improved scaling of the computational effort and memory demand with the length of the time contour.