On the closedness and geometry of tensor network state sets
- URL: http://arxiv.org/abs/2108.00031v2
- Date: Tue, 2 Aug 2022 04:23:09 GMT
- Title: On the closedness and geometry of tensor network state sets
- Authors: Thomas Barthel, Jianfeng Lu, Gero Friesecke
- Abstract summary: Network states (TNS) are a powerful approach for the study of strongly correlated quantum matter.
In practical algorithms, functionals like energy expectation values or overlaps are optimized over certain sets of TNS.
We show that sets of matrix product states (MPS) with open boundary conditions, tree tensor network states (TTNS), and the multiscale entanglement renormalization ansatz (MERA) are always closed.
- Score: 5.989041429080286
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Tensor network states (TNS) are a powerful approach for the study of strongly
correlated quantum matter. The curse of dimensionality is addressed by
parametrizing the many-body state in terms of a network of partially contracted
tensors. These tensors form a substantially reduced set of effective degrees of
freedom. In practical algorithms, functionals like energy expectation values or
overlaps are optimized over certain sets of TNS. Concerning algorithmic
stability, it is important whether the considered sets are closed because,
otherwise, the algorithms may approach a boundary point that is outside the TNS
set and tensor elements diverge. We discuss the closedness and geometries of
TNS sets, and we propose regularizations for optimization problems on
non-closed TNS sets. We show that sets of matrix product states (MPS) with open
boundary conditions, tree tensor network states (TTNS), and the multiscale
entanglement renormalization ansatz (MERA) are always closed, whereas sets of
translation-invariant MPS with periodic boundary conditions (PBC),
heterogeneous MPS with PBC, and projected entangled-pair states (PEPS) are
generally not closed. The latter is done using explicit examples like the W
state, states that we call two-domain states, and fine-grained versions
thereof.
Related papers
- The product structure of MPS-under-permutations [0.4837943644708207]
We show that translationally-invariant (TI) matrix product states (MPS) with this property are trivial.
The results also apply to non-TI generic MPS, as well as further relevant examples of MPS including the W state and the Dicke states in an approximate sense.
arXiv Detail & Related papers (2024-10-25T13:13:23Z) - A Max-Flow approach to Random Tensor Networks [0.40964539027092906]
We study the entanglement entropy of a random tensor network (RTN) using tools from free probability theory.
One can think of random tensor networks are specific probabilistic models for tensors having some particular geometry dictated by a graph (or network) structure.
arXiv Detail & Related papers (2024-07-02T18:00:01Z) - Tensor cumulants for statistical inference on invariant distributions [49.80012009682584]
We show that PCA becomes computationally hard at a critical value of the signal's magnitude.
We define a new set of objects, which provide an explicit, near-orthogonal basis for invariants of a given degree.
It also lets us analyze a new problem of distinguishing between different ensembles.
arXiv Detail & Related papers (2024-04-29T14:33:24Z) - Computational complexity of isometric tensor network states [0.0]
We map 2D isoTNS to 1+1D unitary quantum circuits.
We find an efficient classical algorithm to compute local expectation values in strongly injective isoTNS.
Our results can be used to design provable algorithms to contract isoTNS.
arXiv Detail & Related papers (2024-02-12T19:00:00Z) - Isometric tensor network optimization for extensive Hamiltonians is free
of barren plateaus [0.0]
We show that there are no barren plateaus in the energy optimization of isometric tensor network states (TNS)
TNS are a promising route for an efficient quantum-computation-based investigation of strongly-correlated quantum matter.
arXiv Detail & Related papers (2023-04-27T16:45:57Z) - Holographic Codes from Hyperinvariant Tensor Networks [70.31754291849292]
We show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions.
This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states.
arXiv Detail & Related papers (2023-04-05T20:28:04Z) - Coordinate Independent Convolutional Networks -- Isometry and Gauge
Equivariant Convolutions on Riemannian Manifolds [70.32518963244466]
A major complication in comparison to flat spaces is that it is unclear in which alignment a convolution kernel should be applied on a manifold.
We argue that the particular choice of coordinatization should not affect a network's inference -- it should be coordinate independent.
A simultaneous demand for coordinate independence and weight sharing is shown to result in a requirement on the network to be equivariant.
arXiv Detail & Related papers (2021-06-10T19:54:19Z) - ADOM: Accelerated Decentralized Optimization Method for Time-Varying
Networks [124.33353902111939]
We propose ADOM - an accelerated method for smooth and strongly convex decentralized optimization over time-varying networks.
Up to a constant factor, which depends on the network structure only, its communication is the same as that of accelerated Nesterov method.
arXiv Detail & Related papers (2021-02-18T09:37:20Z) - Dimension of Tensor Network varieties [68.8204255655161]
We determine an upper bound on the dimension of the tensor network variety.
A refined upper bound is given in cases relevant for applications such as varieties of matrix product states and projected entangled pairs states.
arXiv Detail & Related papers (2021-01-08T18:24:50Z) - Optimization at the boundary of the tensor network variety [2.1839191255085995]
tensor network states form a variational ansatz class widely used in the study of quantum many-body systems.
Recent work has shown that states on the boundary of this variety can yield more efficient representations for states of physical interest.
We show how to optimize over this class in order to find ground states of local Hamiltonians.
arXiv Detail & Related papers (2020-06-30T16:58:55Z) - CSNE: Conditional Signed Network Embedding [77.54225346953069]
Signed networks encode positive and negative relations between entities such as friend/foe or trust/distrust.
Existing embedding methods for sign prediction generally enforce different notions of status or balance theories in their optimization function.
We introduce conditional signed network embedding (CSNE)
Our probabilistic approach models structural information about the signs in the network separately from fine-grained detail.
arXiv Detail & Related papers (2020-05-19T19:14:52Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.