Automated construction of -invariant matrix-product operators from graph representations
arXiv:1706.05338 · doi:10.21468/SciPostPhys.3.5.035
Abstract
We present an algorithmic construction scheme for matrix-product-operator (MPO) representations of arbitrary -invariant operators whenever there is an expression of the local structure in terms of a finite-states machine (FSM). Given a set of local operators as building blocks, the method automatizes two major steps when constructing a -invariant MPO representation: (i) the bookkeeping of auxiliary bond-index shifts arising from the application of operators changing the local quantum numbers and (ii) the appearance of phase factors due to particular commutation rules. The automatization is achieved by post-processing the operator strings generated by the FSM. Consequently, MPO representations of various types of -invariant operators can be constructed generically in MPS algorithms reducing the necessity of expensive MPO arithmetics. This is demonstrated by generating arbitrary products of operators in terms of FSM, from which we obtain exact MPO representations for the variance of the Hamiltonian of a Heisenberg chain.
resubmitted version with minor corrections
References in corpus (10)
- The density-matrix renormalization group in the age of matrix product states
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Matrix Product Density Operators: Simulation of finite-T and dissipative systems
- DMRG and periodic boundary conditions: a quantum information perspective
- From density-matrix renormalization group to matrix product states
- Time-evolving a matrix product state with long-ranged interactions
- Tensor network states and algorithms in the presence of a global U(1) symmetry
- Applying matrix product operators to model systems with long-range interactions
- Generic Construction of Efficient Matrix Product Operators
- Finite automata for caching in matrix product algorithms