Ranks of Tensor Networks for Eigenspace Projections and the Curse of Dimensionality
arXiv:2012.12953
Abstract
The hierarchical (multi-linear) rank of an order- tensor is key in determining the cost of representing a tensor as a (tree) Tensor Network (TN). In general, it is known that, for a fixed accuracy, a tensor with random entries cannot be expected to be efficiently approximable without the curse of dimensionality, i.e., a complexity growing exponentially with . In this work, we show that the ground state projection (GSP) of a class of unbounded Hamiltonians can be approximately represented as an operator of low effective dimensionality that is independent of the (high) dimension of the GSP. This allows to approximate the GSP without the curse of dimensionality.
arXiv comment19 pages, 1 figure. A more detailed exposition can be found in arXiv:1904.03507. Erratum: Example 3.3 does not satisfy Assumption 3.1 (4)
References in corpus (12)
- Entanglement Entropy and Quantum Field Theory
- Area laws for the entanglement entropy - a review
- Entanglement in quantum critical phenomena
- An Area Law for One Dimensional Quantum Systems
- Quasi-adiabatic Continuation of Quantum States: The Stability of Topological Ground State Degeneracy and Emergent Gauge Invariance
- Matrix-product-groundstates for one-dimensional spin-1 quantum antiferromagnets
- Lieb-Robinson Bounds for Harmonic and Anharmonic Lattice Systems
- Stochastic Error Cancellation in Analog Quantum Simulation
- An improved 1D area law for frustration-free systems
- Supersonic quantum communication
- Lieb-Robinson bounds for commutator-bounded operators
- Low-Rank Approximability and Entropy Area Laws for Ground States of Unbounded Hamiltonians