Related papers: Matrix Product Operators, Matrix Product States, a…
We study the application of the density matrix renormalization group (DMRG) to systems with one-dimensional acoustic phonons. We show how the use of a local oscillator basis circumvents the difficulties with the long-range interactions…
We present algorithms for real and complex dot product and matrix multiplication in arbitrary-precision floating-point and ball arithmetic. A low-overhead dot product is implemented on the level of GMP limb arrays; it is about twice as fast…
The numerical study of anyonic systems is known to be highly challenging due to their non-bosonic, non-fermionic particle exchange statistics, and with the exception of certain models for which analytical solutions exist, very little is…
Algebraic Multigrid (AMG) methods are often robust and effective solvers for solving the large and sparse linear systems that arise from discretized PDEs and other problems, relying on heuristic graph algorithms to achieve their…
Due to the substantial scale of Large Language Models (LLMs), the direct application of conventional compression methodologies proves impractical. The computational demands associated with even minimal gradient updates present challenges,…
The density matrix renormalization group (DMRG) is applied to some one-dimensional reaction-diffusion models in the vicinity of and at their critical point. The stochastic time evolution for these models is given in terms of a non-symmetric…
Deep Matrix Factorization (DMF) is an emerging approach to the problem of matrix completion. Recent works have established that gradient descent applied to a DMF model induces an implicit regularization on the rank of the recovered matrix.…
We generalize the recently introduced Density-Matrix Renormalization Group (DMRG-X) [Khemani et al, PRL 2016] algorithm to obtain Floquet eigenstates of one-dimensional, periodically driven many-body localized systems. This generalization…
Matrix Product States (MPS), also known as Tensor Train (TT) decomposition in mathematics, has been proposed originally for describing an (especially one-dimensional) quantum system, and recently has found applications in various…
Matrix decompositions are fundamental tools in the area of applied mathematics, statistical computing, and machine learning. In particular, low-rank matrix decompositions are vital, and widely used for data analysis, dimensionality…
We present an approach to constructing a practical coarsening algorithm and interpolation operator for the algebraic multigrid (AMG) method, tailored towards systems of partial differential equations (PDEs) with large near-kernels, such as…
Tensor network algorithms have been remarkably successful solving a variety of problems in quantum many-body physics. However, algorithms to optimize two-dimensional tensor networks known as PEPS lack many of the aspects that make the…
We introduce the density matrix renormalization group (DMRG) method as an efficient computational tool for one-exciton approximations with off-diagonal disorder. This method allows us to reduce the computational effort by targetting only a…
Random backpropagation (RBP) is a variant of the backpropagation algorithm for training neural networks, where the transpose of the forward matrices are replaced by fixed random matrices in the calculation of the weight updates. It is…
As nowadays Machine Learning (ML) techniques are generating huge data collections, the problem of how to efficiently engineer their storage and operations is becoming of paramount importance. In this article we propose a new lossless…
We introduce a new error measure for matrix-product states without requiring the relatively costly two-site density matrix renormalization group (2DMRG). This error measure is based on an approximation of the full variance $\langle \psi | (…
Algebraic Multigrid (AMG) methods are state-of-the-art algebraic solvers for partial differential equations. Still, their efficiency depends heavily on the choice of suitable parameters and/or ingredients. Paradigmatic examples include the…
Matrix product states (MPSs) and matrix product operators (MPOs) allow an alternative formulation of the density matrix renormalization group algorithm introduced by White. Here, we describe how non-abelian spin symmetry can be exploited in…
Optimizations in a traditional compiler are applied sequentially, with each optimization destructively modifying the program to produce a transformed program that is then passed to the next optimization. We present a new approach for…
An algorithm is presented which computes a translationally invariant matrix product state approximation of the ground state of an infinite 1D system; it does this by embedding sites into an approximation of the infinite ``environment'' of…