Local Matrix Product Operators: Canonical Form, Compression, & Control Theory
Daniel E. Parker, Xiangyu Cao, Michael P. Zaletel

TL;DR
This paper introduces a novel method for compressing local matrix product operators (MPOs) that represent sums of local terms, overcoming limitations of standard methods and extending applicability to the thermodynamic limit.
Contribution
It presents an 'almost Schmidt decomposition' for MPOs, enabling efficient compression and control, especially in the thermodynamic limit, with practical algorithms for large MPOs.
Findings
Method achieves $\\varepsilon$-close accuracy to MPS methods for finite MPOs.
Extends seamlessly to the thermodynamic limit where MPS techniques fail.
Provides practical algorithms suitable for large MPOs in DMRG applications.
Abstract
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 "-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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
