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:2504.06475 · Quantum

Successive randomized compression: A randomized algorithm for the compressed MPO-MPS product

Chris Camaño, Ethan N. Epperly, Joel A. Tropp

Published Mar 10, 2026• 2 citations
arXivHTMLPDF

Abstract

Tensor networks like matrix product states (MPSs) and matrix product operators (MPOs) are powerful tools for representing exponentially large states and operators, with applications in quantum many-body physics, machine learning, numerical analysis, and other areas. In these applications, computing a compressed representation of the MPO-MPS product is a fundamental computational primitive. For this operation, this paper introduces a new single-pass, randomized algorithm, called successive randomized compression (SRC), that improves on existing approaches in speed or in accuracy. The performance of the new algorithm is evaluated on synthetic problems and unitary time evolution problems for quantum spin systems.

DOI
10.22331/q-2026-03-10-2022

Related papers

Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques

Xavier Waintal, Chen-How Huang, Christoph W. Groth

This is a set of lectures on tensor networks with a strong emphasis on the core algorithms involving Matrix Product States (MPS) and Matrix Product Operators (MPO). Compared to other presentations, particular care has been given to disentangle aspects of tensor networks from the quantum many-body problem: MPO/MPS algorithms are presented as a way to deal with linear algebra on extremely (exponentially) large matrices and vectors, regardless of any particular application. The lectures include well-known algorithms to find eigenvectors of MPOs (the celebrated DMRG), solve linear problems, and recent learning algorithms that allow one to map a known function into an MPS (the Tensor Cross Interpolation, or TCI, algorithm). The lectures end with a discussion of how to represent functions and perform calculus with tensor networks using the "quantics" representation. They include the detailed analytical construction of important MPOs such as those for differentiation, indefinite integration, convolution, and the quantum Fourier transform. Three concrete applications are discussed in detail: the simulation of a quantum computer (either exactly or with compression), the simulation of a quantum annealer, and techniques to solve partial differential equations (e.g. Poisson, diffusion, or Gross-Pitaevskii) within the "quantics" representation. The lectures have been designed to be accessible to a first-year PhD student and include detailed proofs of all statements.

quant-pharXiv:2601.03035•SciPost Physics Lecture Notes•Jan 7, 2026•0 citations

Efficient Application of Tensor Network Operators to Tensor Network States Through Successive Deterministic Compression

Richard M. Milbradt, Shuo Sun, Christian B. Mendl +2 more

We introduce an algorithm to apply tree tensor network operators to tree tensor network states followed by compression. Especially when applying a matrix product operator to matrix product states, this serves as a key subroutine in tensor network algorithms. We name the method successive deterministic compression (SDC). We compare SDC to existing operator application and compression algorithms in benchmarks involving random tensor network operators and states, as well as circuit simulation with standard entangling gates. We find that successive deterministic compression is consistently among the best-performing techniques when the tensor network state (after the operator application) is not highly compressible. Our results also highlight the flexibility of general tree tensor network structures for simulating circuits with long-range entanglement.

quant-pharXiv:2601.19650•Jan 28, 2026•0 citations

Numerically efficient unitary evolution for Hamiltonians beyond nearest neighbors

Alberto Giuseppe Catalano

Matrix product states (MPSs) and matrix product operators (MPOs) are fundamental tools in the study of quantum many-body systems, particularly in the context of tensor network methods such as time-evolving block decimation (TEBD). However, constructing compact MPO representations for Hamiltonians with interactions beyond nearest neighbors, such as those arising in atomic, molecular, and optical (AMO) systems or in systems with ring geometry, remains a challenge. In this paper, we propose an approach for the direct construction of compact MPOs tailored specifically for the exponential of spin Hamiltonians. This approach allows for a more efficient time evolution, using TEBD, of spin systems with interactions beyond nearest neighbors, such as long-range spin chains, periodic systems, and more complex cluster models, with interactions involving more than two spins.

arXiv:2402.05198•Physical review. B./Physical review. B•Nov 13, 2025•1 citation

Local matrix product operators: Canonical form, compression, and control theory

Daniel E. Parker, Xiangyu Cao, Michael P. Zaletel

We present a new method for compressing matrix product operators (MPOs) which represent sums of local terms, such as Hamiltonians. Just as with area law states, such local operators may be fully specified with a small amount of information per site. Standard matrix product state (MPS) tools are ill-suited to this case, due to extensive Schmidt values that coexist with intensive ones, and Jordan blocks in the transfer matrix. We ameliorate these issues by introducing an ``almost Schmidt decomposition'' that respects locality. Our method is ``$\ensuremath{\varepsilon}$-close'' to the accuracy of MPS-based methods for finite MPOs, and extends seamlessly to the thermodynamic limit, where MPS techniques are inapplicable. In the framework of control theory, our method generalizes Kung's algorithm for model order reduction. Several examples are provided, including an all-MPO version of the operator recursion method (Lanczos algorithm) directly in the thermodynamic limit. All results are accompanied by practical algorithms, well-suited for the large MPOs that arise in DMRG for long-range or quasi-2D models.

arXiv:1909.06341•Physical review. B./Physical review. B•Jul 23, 2020•43 citations

Efficient tensor network representation for Gutzwiller projected states of paired fermions

Hui-Ke Jin, Hong-Hao Tu, Yi Zhou

Recent work by Wu et al. [arXiv:1910.11011] proposed a numerical method, so-called matrix product operator--matrix product state (MPO-MPS) method, by which several types of quantum many-body wave functions, in particular, the projected Fermi sea state, can be efficiently represented as a tensor network. In this paper, we generalize the MPO-MPS method to study Gutzwiller projected paired states of fermions, where the maximally localized Wannier orbitals for Bogoliubov quasiparticles/quasiholes have been adapted to improve the computational performance. The study of $SO(3)$-symmetric spin-1 chains reveals that this new method has better performance than variational Monte Carlo for gapped states and similar performance for gapless states. Moreover, we demonstrate that dynamic correlation functions can be easily evaluated by this method cooperating with other MPS-based accurate approaches, such as the Chebyshev MPS method.

arXiv:2001.04611•Physical review. B./Physical review. B•Apr 24, 2020•29 citations

Generic construction of efficient matrix product operators

Claudius Hubig, Ian P. McCulloch, Ulrich Schollwöck

Matrix product operators (MPOs) are at the heart of the second-generation density matrix renormalization group (DMRG) algorithm formulated in matrix product state language. We first summarize the widely known facts on MPO arithmetic and representations of single-site operators. Second, we introduce three compression methods (rescaled SVD, deparallelization, and delinearization) for MPOs and show that it is possible to construct efficient representations of arbitrary operators using MPO arithmetic and compression. As examples, we construct powers of a short-ranged spin-chain Hamiltonian, a complicated Hamiltonian of a two-dimensional system and, as proof of principle, the long-range four-body Hamiltonian from quantum chemistry.

arXiv:1611.02498•Physical review. B./Physical review. B•Jan 18, 2017•135 citations
Tensor networks like matrix product states (MPSs) and matrix product operators (MPOs) are powerful tools for representing exponentially large states and operators, with applications in quantum many-body physics, machine learning, numerical analysis, and other areas. In these applications, computing a compressed representation of the MPO-MPS product is a fundamental computational primitive. For this operation, this paper introduces a new single-pass, randomized algorithm, called successive randomized compression (SRC), that improves on existing approaches in speed or in accuracy. The performance of the new algorithm is evaluated on synthetic problems and unitary time evolution problems for quantum spin systems.
This is a set of lectures on tensor networks with a strong emphasis on the core algorithms involving Matrix Product States (MPS) and Matrix Product Operators (MPO). Compared to other presentations, particular care has been given to disentangle aspects of tensor networks from the quantum many-body problem: MPO/MPS algorithms are presented as a way to deal with linear algebra on extremely (exponentially) large matrices and vectors, regardless of any particular application. The lectures include well-known algorithms to find eigenvectors of MPOs (the celebrated DMRG), solve linear problems, and recent learning algorithms that allow one to map a known function into an MPS (the Tensor Cross Interpolation, or TCI, algorithm). The lectures end with a discussion of how to represent functions and perform calculus with tensor networks using the "quantics" representation. They include the detailed analytical construction of important MPOs such as those for differentiation, indefinite integration, convolution, and the quantum Fourier transform. Three concrete applications are discussed in detail: the simulation of a quantum computer (either exactly or with compression), the simulation of a quantum annealer, and techniques to solve partial differential equations (e.g. Poisson, diffusion, or Gross-Pitaevskii) within the "quantics" representation. The lectures have been designed to be accessible to a first-year PhD student and include detailed proofs of all statements.
We introduce an algorithm to apply tree tensor network operators to tree tensor network states followed by compression. Especially when applying a matrix product operator to matrix product states, this serves as a key subroutine in tensor network algorithms. We name the method successive deterministic compression (SDC). We compare SDC to existing operator application and compression algorithms in benchmarks involving random tensor network operators and states, as well as circuit simulation with standard entangling gates. We find that successive deterministic compression is consistently among the best-performing techniques when the tensor network state (after the operator application) is not highly compressible. Our results also highlight the flexibility of general tree tensor network structures for simulating circuits with long-range entanglement.
Matrix product states (MPSs) and matrix product operators (MPOs) are fundamental tools in the study of quantum many-body systems, particularly in the context of tensor network methods such as time-evolving block decimation (TEBD). However, constructing compact MPO representations for Hamiltonians with interactions beyond nearest neighbors, such as those arising in atomic, molecular, and optical (AMO) systems or in systems with ring geometry, remains a challenge. In this paper, we propose an approach for the direct construction of compact MPOs tailored specifically for the exponential of spin Hamiltonians. This approach allows for a more efficient time evolution, using TEBD, of spin systems with interactions beyond nearest neighbors, such as long-range spin chains, periodic systems, and more complex cluster models, with interactions involving more than two spins.
We present a new method for compressing matrix product operators (MPOs) which represent sums of local terms, such as Hamiltonians. Just as with area law states, such local operators may be fully specified with a small amount of information per site. Standard matrix product state (MPS) tools are ill-suited to this case, due to extensive Schmidt values that coexist with intensive ones, and Jordan blocks in the transfer matrix. We ameliorate these issues by introducing an ``almost Schmidt decomposition'' that respects locality. Our method is ``$\ensuremath{\varepsilon}$-close'' to the accuracy of MPS-based methods for finite MPOs, and extends seamlessly to the thermodynamic limit, where MPS techniques are inapplicable. In the framework of control theory, our method generalizes Kung's algorithm for model order reduction. Several examples are provided, including an all-MPO version of the operator recursion method (Lanczos algorithm) directly in the thermodynamic limit. All results are accompanied by practical algorithms, well-suited for the large MPOs that arise in DMRG for long-range or quasi-2D models.
Recent work by Wu et al. [arXiv:1910.11011] proposed a numerical method, so-called matrix product operator--matrix product state (MPO-MPS) method, by which several types of quantum many-body wave functions, in particular, the projected Fermi sea state, can be efficiently represented as a tensor network. In this paper, we generalize the MPO-MPS method to study Gutzwiller projected paired states of fermions, where the maximally localized Wannier orbitals for Bogoliubov quasiparticles/quasiholes have been adapted to improve the computational performance. The study of SO(3)SO(3)SO(3)-symmetric spin-1 chains reveals that this new method has better performance than variational Monte Carlo for gapped states and similar performance for gapless states. Moreover, we demonstrate that dynamic correlation functions can be easily evaluated by this method cooperating with other MPS-based accurate approaches, such as the Chebyshev MPS method.
Matrix product operators (MPOs) are at the heart of the second-generation density matrix renormalization group (DMRG) algorithm formulated in matrix product state language. We first summarize the widely known facts on MPO arithmetic and representations of single-site operators. Second, we introduce three compression methods (rescaled SVD, deparallelization, and delinearization) for MPOs and show that it is possible to construct efficient representations of arbitrary operators using MPO arithmetic and compression. As examples, we construct powers of a short-ranged spin-chain Hamiltonian, a complicated Hamiltonian of a two-dimensional system and, as proof of principle, the long-range four-body Hamiltonian from quantum chemistry.