Towards a better understanding of the matrix product function approximation algorithm in application to quantum physics
arXiv:1709.06847
Abstract
We recently introduced a method to approximate functions of Hermitian Matrix Product Operators or Tensor Trains that are of the form . Functions of this type occur in several applications, most notably in quantum physics. In this work we aim at extending the theoretical understanding of our method by showing several properties of our algorithm that can be used to detect and correct errors in its results. Most importantly, we show that there exists a more computationally efficient version of our algorithm for certain inputs. To illustrate the usefulness of our finding, we prove that several classes of spin Hamiltonians in quantum physics fall into this input category. We finally support our findings with numerical results obtained for an example from quantum physics.
arXiv comment17 pages, comments very welcome
References in corpus (13)
- Efficient classical simulation of slightly entangled quantum computations
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Efficient simulation of one-dimensional quantum many-body systems
- An Area Law for One Dimensional Quantum Systems
- Matrix product states represent ground states faithfully
- Mixed-state dynamics in one-dimensional quantum lattice systems: a time-dependent superoperator renormalization algorithm
- DMRG and periodic boundary conditions: a quantum information perspective
- Matrix product operator representations
- Time evolution algorithms for Matrix Product States and DMRG
- Computations in Quantum Tensor Networks
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1: Tucker case
- Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
- A structure preserving Lanczos algorithm for computing the optical absorption spectrum