The resource theory of tensor networks
arXiv:2307.07394 · doi:10.22331/q-2024-12-11-1560
Abstract
Tensor networks provide succinct representations of quantum many-body states and are an important computational tool for strongly correlated quantum systems. Their expressive and computational power is characterized by an underlying entanglement structure, on a lattice or more generally a (hyper)graph, with virtual entangled pairs or multipartite entangled states associated to (hyper)edges. Changing this underlying entanglement structure into another can lead to both theoretical and computational benefits. We study a natural resource theory which generalizes the notion of bond dimension to entanglement structures using multipartite entanglement. It is a direct extension of resource theories of tensors studied in the context of multipartite entanglement and algebraic complexity theory, allowing for the application of the sophisticated methods developed in these fields to tensor networks. The resource theory of tensor networks concerns both the local entanglement structure of a quantum many-body state and the (algebraic) complexity of tensor network contractions using this entanglement structure. We show that there are transformations between entanglement structures which go beyond edge-by-edge conversions, highlighting efficiency gains of our resource theory that mirror those obtained in the search for better matrix multiplication algorithms. We also provide obstructions to the existence of such transformations by extending a variety of methods originally developed in algebraic complexity theory for obtaining complexity lower bounds. The resource theory of tensor networks allows to compare different entanglement structures and should lead to more efficient tensor network representations and contraction algorithms.
66 pages
References in corpus (13)
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
- Accurate determination of tensor network state of quantum lattice models in two dimensions
- Entropy scaling and simulability by Matrix Product States
- Algorithms for finite Projected Entangled Pair States
- Efficient Tree Tensor Network States (TTNS) for Quantum Chemistry: Generalizations of the Density Matrix Renormalization Group Algorithm
- Resonating valence bond states in the PEPS formalism
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States
- Necessary and sufficient conditions for local manipulation of multipartite pure quantum states
- Barriers for Rank Methods in Arithmetic Complexity
- 2D Multipartite Valence Bond States in Quantum Antiferromagnets
- Generative modeling with projected entangled-pair states