Low-rank representation of tensor network operators with long-range pairwise interactions

DOI10.1137/19M1287067MaRDI QIDQ5147990zbMATH OpenOpenAlexFDO

Authors Lin Lin, Yu Tong

Publication date 29 January 2021

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.02206

zbMATH Keywords

\(\mathcal{H}\)-matrixfast multipole methodhierarchical off-diagonal low-rankmatrix product operatorprojected entangled-pair operatorupper-triangular low-rank matrix

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Abstract: Tensor network operators, such as the matrix product operator (MPO) and the projected entangled-pair operator (PEPO), can provide efficient representation of certain linear operators in high dimensional spaces. This paper focuses on the efficient representation of tensor network operators with long-range pairwise interactions such as the Coulomb interaction. For MPOs, we find that all existing efficient methods exploit a peculiar "upper-triangular low-rank" (UTLR) property, i.e. the upper-triangular part of the matrix can be well approximated by a low-rank matrix, while the matrix itself can be full-rank. This allows us to convert the problem of finding the efficient MPO representation into a matrix completion problem. We develop a modified incremental singular value decomposition method (ISVD) to solve this ill-conditioned matrix completion problem. This algorithm yields equivalent MPO representation to that developed in [Stoudenmire and White, Phys. Rev. Lett. 2017]. In order to efficiently treat more general tensor network operators, we develop another strategy for compressing tensor network operators based on hierarchical low-rank matrix formats, such as the hierarchical off-diagonal low-rank (HODLR) format, and the $mathcalH$-matrix format. Though the pre-constant in the complexity is larger, the advantage of using the hierarchical low-rank matrix format is that it is applicable to both MPOs and PEPOs. For the Coulomb interaction, the operator can be represented by a linear combination of $mathcalO(log(N)log(N/epsilon))$ MPOs/PEPOs, each with a constant bond dimension, where $N$ is the system size and $epsilon$ is the accuracy of the low-rank truncation. Neither the modified ISVD nor the hierarchical low-rank algorithm assumes that the long-range interaction takes a translation-invariant form.

Recommendations

• Matrix product operator representation of polynomial interactions
• Matrix product operator representations
• On the approximation of functionals of very large Hermitian matrices represented as matrix product operators
• Tensor Network Skeletonization
• Nearest-neighbor interaction systems in the tensor-train format

Cites work

• A bibliography on semiseparable matrices
• A practical introduction to tensor networks: Matrix product states and projected entangled pair states
• A Singular Value Thresholding Algorithm for Matrix Completion
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
• Approximation of 1/x by exponential sums in [1, ∞)
• Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
• Construction and arithmetics of \(\mathcal H\)-matrices
• Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States
• Dynamical approximation by hierarchical Tucker and tensor-train tensors
• Exact matrix completion via convex optimization
• Hierarchical matrices based on a weak admissibility criterion
• scientific article; zbMATH DE number 1069612 (Why is no real title available?)
• scientific article; zbMATH DE number 2045498 (Why is no real title available?)
• Low-rank tensor structure of linear diffusion operators in the TT and QTT formats
• Matrix completion from noisy entries
• Matrix product operator representations
• Numerical operator calculus in higher dimensions
• On approximation of functions by exponential sums
• On the efficient computation of high-dimensional integrals and the approximation by exponential sums
• Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
• Solving rank-structured Sylvester and Lyapunov equations
• Tensor-train decomposition
• The density-matrix renormalization group in the age of matrix product states
• Two-level QTT-Tucker format for optimized tensor calculus

Cited in

(3)

• Nearest-neighbor interaction systems in the tensor-train format
• An incremental singular value decomposition approach for large-scale spatially parallel \& distributed but temporally serial data -- applied to technical flows
• Low-rank tree tensor network operators for long-range pairwise interactions

This page was built for publication: Low-rank representation of tensor network operators with long-range pairwise interactions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147990)