Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1909.02206 · SIAM Journal on Scientific Computing

Low-Rank Representation of Tensor Network Operators with Long-Range Pairwise Interactions

Lin Lin, Yu Tong

Published Jan 1, 2021• 5 citations
arXivHTMLPDF

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 an 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 [E. M. Stoudenmire and S. R. White, Phys. Rev. Lett., 119 (2017), 046401]. 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 $\mathcal{H}$-matrix format. Though the preconstant 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 $\mathcal{O}(\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.

DOI
10.1137/19m1287067

Related papers

Low-Rank Tree Tensor Network Operators for Long-Range Pairwise Interactions

Gianluca Ceruti, Daniel Kreßner, Dominik Sulz

Abstract. Compactly representing and efficently applying linear operators are fundamental ingredients in tensor network methods for simulating quantum many-body problems and solving high-dimensional problems in scientific computing. In this work, we study such representations for tree tensor networks, the so-called tree tensor network operators (TTNOs), paying particular attention to Hamiltonian operators that involve long-range pairwise interactions between particles. Generalizing the work by Lin, Tong, and others on matrix product operators, we establish a direct connection between the hierarchical low-rank structure of the interaction matrix and the TTNO property. This connection allows us to arrive at very compact TTNO representations by compressing the interaction matrix into a hierarchically semiseparable matrix. Numerical experiments for different quantum spin systems validate our results and highlight the potential advantages of TTNOs over matrix product operators.

arXiv:2405.09952•SIAM Journal on Scientific Computing•Aug 1, 2025•4 citations

Simplified and improved approach to tensor network operators in two dimensions

Matthew J. O’Rourke, Garnet Kin‐Lic Chan

Matrix product states and matrix product operators (MPOs) are one-dimensional tensor networks that underlie the modern density matrix renormalization group (DMRG) algorithm. The use of MPOs accounts for the high level of generality and wide range of applicability of DMRG. However, current algorithms for two-dimensional (2D) tensor network states, known as projected entangled-pair states, rarely employ the associated 2D tensor network operators, projected entangled-pair operators (PEPOs), due to their computational cost and conceptual complexity. To lower these two barriers, we describe how to reformulate a PEPO into a set of tensor network operators that resemble MPOs by considering the different sets of local operators that are generated from sequential bipartitions of the 2D system. The expectation value of a PEPO can then be evaluated on the fly using only the action of MPOs and generalized MPOs at each step of the approximate contraction of the 2D tensor network. This technique allows for the simpler construction and more efficient energy evaluation of 2D Hamiltonians that contain finite-range interactions, and provides an improved strategy to encode long-range interactions that is orders of magnitude more accurate and efficient than existing schemes.

arXiv:1911.04592•Physical review. B./Physical review. B•May 22, 2020•9 citations

Introduction to matrix-product states and tensor networks

Grégoire Misguich

These notes provide an introduction to tensor-network methods in quantum many-body physics, with an emphasis on matrix-product states (MPS). They develop the basic tensor-network language, including graphical notation, virtual indices, bond dimensions, gauge freedom, canonical forms, QR and singular-value decompositions, and the role of entanglement in controlling the efficiency of the representation. The main MPS algorithms are then introduced, including contractions, correlation functions, matrix-product operators, DMRG, and time-evolution methods. The notes also briefly discuss projected entangled-pair states (PEPS) as a higher-dimensional generalization of MPS, together with the basic ideas behind approximate PEPS contraction. Finally, tensor-network representations of mixed states, quantum channels, and Lindblad dynamics are presented, with applications to thermal states and open quantum systems. The presentation is accompanied by short Julia code examples based on ITensor, ITensorMPS, and TensorMixedStates. These notes were written for the 9th Les Houches Summer School on Computational Physics: Open Quantum Systems, held in June 2026.

cond-mat.str-elCross-listedarXiv:2606.24803•Jun 24, 2026•0 citations

Efficient representation of long-range interactions in tensor network algorithms

Matthew J. O’Rourke, Zhendong Li, Garnet Kin‐Lic Chan

We describe a practical and efficient approach to represent physically realistic long-range interactions in two-dimensional tensor network algorithms via projected entangled-pair operators (PEPOs). We express the long-range interaction as a linear combination of correlation functions of an auxiliary system with only nearest-neighbor interactions. To obtain a smooth and radially isotropic interaction across all length scales, we map the physical lattice to an auxiliary lattice of expanded size. Our construction yields a long-range PEPO as a sum of ancillary PEPOs, each of small, constant bond dimension. This representation enables efficient numerical simulations with long-range interactions using projected entangled pair states.

arXiv:1807.08378•Physical review. B./Physical review. B•Nov 16, 2018•16 citations

Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD

Kim Batselier, Wenjian Yu, Luca Daniel +1 more

We propose a new algorithm for the computation of a singular value decomposition (SVD) low-rank approximation of a matrix in the matrix product operator (MPO) format, also called the tensor train matrix format. Our tensor network randomized SVD (TNrSVD) algorithm is an MPO implementation of the randomized SVD algorithm that is able to compute dominant singular values and their corresponding singular vectors. In contrast to the state-of-the-art tensor-based alternating least squares SVD (ALS-SVD) and modified alternating least squares SVD (MALS-SVD) matrix approximation methods, TNrSVD can be up to 13 times faster while achieving better accuracy. In addition, our TNrSVD algorithm also produces accurate approximations in particular cases where both ALS-SVD and MALS-SVD fail to converge. We also propose a new algorithm for the fast conversion of a sparse matrix into its corresponding MPO form, which is up to 509 times faster than the standard tensor train SVD method while achieving machine precision accuracy. The efficiency and accuracy of both algorithms are demonstrated in numerical experiments.

arXiv:1707.07803•SIAM Journal on Matrix Analysis and Applications•Jan 1, 2018•29 citations

Matrix Product Operators In The Age of Block Encoding

Eugene Dumitrescu

We develop a block-encoding compiler that treats matrix product operators as compressed, virtual-path linear combination of unitaries programs. The compiler constructs conditional PREP and local SELECT stages directly from a parent matrix product operator, establishing tensor networks as structured quantum intermediate representations that can be efficiently compiled to block-encoded circuits. We apply the construction to real-time evolution in the Heisenberg chain and two perturbed Heisenberg-family models. Across the regimes studied, the compressed, approximately unitary propagator MPOs retain mild bond dimension and LCU normalization. Relative to an LCU that explicitly lists the $\mathcal{O}(N^K)$ Pauli-product branches of an order-K truncated Taylor polynomial, our virtual-transition implementation replaces combinatorial branch enumeration by a circuit complexity scaling as $\mathcal{O}(α_{\rm MPO}Nχ^2)$, approaching $\mathcal{O}(Nχ^2)$ when $α_{\rm MPO}$ remains mild. We numerically characterize how truncation order, bond-dimension budget, and system size affect approximation error, normalization, and compiler cost. These results demonstrate how classically compressed tensor-network representations can serve as quantum compiler intermediate representations for block encoding and opens new avenues to accelerate quantum algorithms.

quant-pharXiv:2606.19083•Jun 18, 2026•0 citations
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 an 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 [E. M. Stoudenmire and S. R. White, Phys. Rev. Lett., 119 (2017), 046401]. 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 H\mathcal{H}H-matrix format. Though the preconstant 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 O(log⁡(N)log⁡(N/ϵ))\mathcal{O}(\log(N)\log(N/\epsilon))O(log(N)log(N/ϵ)) MPOs/PEPOs, each with a constant bond dimension, where NNN 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.
Abstract. Compactly representing and efficently applying linear operators are fundamental ingredients in tensor network methods for simulating quantum many-body problems and solving high-dimensional problems in scientific computing. In this work, we study such representations for tree tensor networks, the so-called tree tensor network operators (TTNOs), paying particular attention to Hamiltonian operators that involve long-range pairwise interactions between particles. Generalizing the work by Lin, Tong, and others on matrix product operators, we establish a direct connection between the hierarchical low-rank structure of the interaction matrix and the TTNO property. This connection allows us to arrive at very compact TTNO representations by compressing the interaction matrix into a hierarchically semiseparable matrix. Numerical experiments for different quantum spin systems validate our results and highlight the potential advantages of TTNOs over matrix product operators.
Matrix product states and matrix product operators (MPOs) are one-dimensional tensor networks that underlie the modern density matrix renormalization group (DMRG) algorithm. The use of MPOs accounts for the high level of generality and wide range of applicability of DMRG. However, current algorithms for two-dimensional (2D) tensor network states, known as projected entangled-pair states, rarely employ the associated 2D tensor network operators, projected entangled-pair operators (PEPOs), due to their computational cost and conceptual complexity. To lower these two barriers, we describe how to reformulate a PEPO into a set of tensor network operators that resemble MPOs by considering the different sets of local operators that are generated from sequential bipartitions of the 2D system. The expectation value of a PEPO can then be evaluated on the fly using only the action of MPOs and generalized MPOs at each step of the approximate contraction of the 2D tensor network. This technique allows for the simpler construction and more efficient energy evaluation of 2D Hamiltonians that contain finite-range interactions, and provides an improved strategy to encode long-range interactions that is orders of magnitude more accurate and efficient than existing schemes.
These notes provide an introduction to tensor-network methods in quantum many-body physics, with an emphasis on matrix-product states (MPS). They develop the basic tensor-network language, including graphical notation, virtual indices, bond dimensions, gauge freedom, canonical forms, QR and singular-value decompositions, and the role of entanglement in controlling the efficiency of the representation. The main MPS algorithms are then introduced, including contractions, correlation functions, matrix-product operators, DMRG, and time-evolution methods. The notes also briefly discuss projected entangled-pair states (PEPS) as a higher-dimensional generalization of MPS, together with the basic ideas behind approximate PEPS contraction. Finally, tensor-network representations of mixed states, quantum channels, and Lindblad dynamics are presented, with applications to thermal states and open quantum systems. The presentation is accompanied by short Julia code examples based on ITensor, ITensorMPS, and TensorMixedStates. These notes were written for the 9th Les Houches Summer School on Computational Physics: Open Quantum Systems, held in June 2026.
We describe a practical and efficient approach to represent physically realistic long-range interactions in two-dimensional tensor network algorithms via projected entangled-pair operators (PEPOs). We express the long-range interaction as a linear combination of correlation functions of an auxiliary system with only nearest-neighbor interactions. To obtain a smooth and radially isotropic interaction across all length scales, we map the physical lattice to an auxiliary lattice of expanded size. Our construction yields a long-range PEPO as a sum of ancillary PEPOs, each of small, constant bond dimension. This representation enables efficient numerical simulations with long-range interactions using projected entangled pair states.
We propose a new algorithm for the computation of a singular value decomposition (SVD) low-rank approximation of a matrix in the matrix product operator (MPO) format, also called the tensor train matrix format. Our tensor network randomized SVD (TNrSVD) algorithm is an MPO implementation of the randomized SVD algorithm that is able to compute dominant singular values and their corresponding singular vectors. In contrast to the state-of-the-art tensor-based alternating least squares SVD (ALS-SVD) and modified alternating least squares SVD (MALS-SVD) matrix approximation methods, TNrSVD can be up to 13 times faster while achieving better accuracy. In addition, our TNrSVD algorithm also produces accurate approximations in particular cases where both ALS-SVD and MALS-SVD fail to converge. We also propose a new algorithm for the fast conversion of a sparse matrix into its corresponding MPO form, which is up to 509 times faster than the standard tensor train SVD method while achieving machine precision accuracy. The efficiency and accuracy of both algorithms are demonstrated in numerical experiments.
We develop a block-encoding compiler that treats matrix product operators as compressed, virtual-path linear combination of unitaries programs. The compiler constructs conditional PREP and local SELECT stages directly from a parent matrix product operator, establishing tensor networks as structured quantum intermediate representations that can be efficiently compiled to block-encoded circuits. We apply the construction to real-time evolution in the Heisenberg chain and two perturbed Heisenberg-family models. Across the regimes studied, the compressed, approximately unitary propagator MPOs retain mild bond dimension and LCU normalization. Relative to an LCU that explicitly lists the O(NK)\mathcal{O}(N^K)O(NK) Pauli-product branches of an order-K truncated Taylor polynomial, our virtual-transition implementation replaces combinatorial branch enumeration by a circuit complexity scaling as O(αMPONχ2)\mathcal{O}(α_{\rm MPO}Nχ^2)O(αMPO​Nχ2), approaching O(Nχ2)\mathcal{O}(Nχ^2)O(Nχ2) when αMPOα_{\rm MPO}αMPO​ remains mild. We numerically characterize how truncation order, bond-dimension budget, and system size affect approximation error, normalization, and compiler cost. These results demonstrate how classically compressed tensor-network representations can serve as quantum compiler intermediate representations for block encoding and opens new avenues to accelerate quantum algorithms.