Related papers: Vertical Density Matrix Algorithm: A Higher-Dimens…
We show how to simulate numerically both the evolution of 1D quantum systems under dissipation as well as in thermal equilibrium. The method applies to both finite and inhomogeneous systems and it is based on two ideas: (a) a representation…
We present a new computational approach to approximating a large, noisy data table by a low-rank matrix with sparse singular vectors. The approximation is obtained from thresholded subspace iterations that produce the singular vectors…
Tensor networks provide a useful tool to describe low-dimensional complex many-body systems. Finding efficient algorithms to use these methods for finite-temperature simulations in two dimensions is a continuing challenge. Here, we use the…
We present an algorithm based on maximum likelihood for the estimation and renormalization (marginalization) of exponential densities. The moment-matching problem resulting from the maximization of the likelihood is solved as an…
Constructing reduced representations of high-dimensional systems is a fundamental problem in physical chemistry. Many unsupervised machine learning methods can automatically find such low-dimensional representations. However, an often…
We provide a complete thermodynamic solution of a 1D hopping model in the presence of a random potential by obtaining the density of states. Since the partition function is related to the density of states by a Laplace transform, the…
The Singular Value Decomposition (SVD) of matrices is a widely used tool in scientific computing. In many applications of machine learning, data analysis, signal and image processing, the large datasets are structured into tensors, for…
Dynamic mode decomposition (DMD) is a data-driven method for estimating the dynamics of a discrete dynamical system. This paper proposes a tensor-based approach to DMD for applications in which the states can be viewed as tensors.…
Given in the title are two algorithms to compute the extreme eigenstate of a high-dimensional Hermitian matrix using the tensor train (TT) / matrix product states (MPS) representation. Both methods empower the traditional alternating…
Aiming to provide a faster and convenient truncated SVD algorithm for large sparse matrices from real applications (i.e. for computing a few of largest singular values and the corresponding singular vectors), a dynamically shifted power…
We propose a scheme to perform tensor network based finite-size scaling analysis for two-dimensional classical models. In the tensor network representation of the partition function, we use higher-order tensor renormalization group (HOTRG)…
Vertex direction algorithms have been around for a few decades in the experimental design and mixture models literature. We briefly review this type of algorithm and describe a new member of the family: the support reduction algorithm. The…
We propose new algorithms for singular value decomposition (SVD) of very large-scale matrices based on a low-rank tensor approximation technique called the tensor train (TT) format. The proposed algorithms can compute several dominant…
We propose a new fast numerical renormalization group method,the corner transfer matrix renormalization group (CTMRG) method, which is based on a unified scheme of Baxter's corner transfer matrix method and White's density matrix…
A linearized tensor renormalization group (LTRG) algorithm is proposed to calculate the thermodynamic properties of one-dimensional quantum lattice models, that is incorporated with the infinite time-evolving block decimation technique, and…
In this paper, we define a semi-tensor product for third-order tensors. Based on this definition, we present a new type of tensor decomposition strategy and give the specific algorithm. This decomposition strategy actually generalizes the…
We propose a hybrid stochastic method for the tensor renormalization group (TRG) approach. TRG is known as a powerful tool to study the many-body systems and quantum field theory on the lattice. It is based on a low-rank approximation of…
A stationary value based algorithm (SVA) is provided to solve the nearest Kronecker product decomposition (KPD) problem of vector form hypermatrices. Using the algorithm successively, the finite sum KPD is also solved. Then the permutation…
Multidimensional scaling (MDS) is a popular dimensionality reduction techniques that has been widely used for network visualization and cooperative localization. However, the traditional stress minimization formulation of MDS necessitates…
In this work, we introduce an original self-consistent scheme based on the one-body reduced density matrix ($\gamma$) formalism. A significant feature of this methodology is the utilization of an optimal unitary transformation of the…