On the closedness and geometry of tensor network state sets

被引:8
作者
Barthel, Thomas [1 ]
Lu, Jianfeng [2 ,3 ]
Friesecke, Gero [4 ]
机构
[1] Duke Univ, Dept Phys, Durham, NC 27708 USA
[2] Duke Univ, Dept Math, Durham, NC 27708 USA
[3] Duke Univ, Dept Chem & Phys, Durham, NC 27708 USA
[4] Tech Univ Munich, Dept Math, D-85748 Garching, Germany
基金
美国国家科学基金会;
关键词
Tensor networks; Matrix product states; Projected entangled-pair states; Multiscale entanglement renormalization ansatz; Algebraic geometry; Nonexistence of optimizers; LOW-RANK APPROXIMATION; BOND GROUND-STATES; RENORMALIZATION-GROUP; QUANTUM VERSION; LATTICE; ENTANGLEMENT; ALGORITHM; SYSTEMS;
D O I
10.1007/s11005-022-01552-z
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
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, and the multiscale entanglement renormalization ansatz are always closed, whereas sets of translation-invariant MPS with periodic boundary conditions (PBC), heterogeneous MPS with PBC, and projected entangled pair states 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.
引用
收藏
页数:33
相关论文
共 79 条
[11]   Highly correlated calculations with a polynomial cost algorithm: A study of the density matrix renormalization group [J].
Chan, GKL ;
Head-Gordon, M .
JOURNAL OF CHEMICAL PHYSICS, 2002, 116 (11) :4462-4476
[12]   Meron-cluster solution of fermion sign problems [J].
Chandrasekharan, S ;
Wiese, UJ .
PHYSICAL REVIEW LETTERS, 1999, 83 (16) :3116-3119
[13]   Optimization at the boundary of the tensor network variety [J].
Christandl, Matthias ;
Gesmundo, Fulvio ;
Franca, Daniel Stilck ;
Werner, Albert H. .
PHYSICAL REVIEW B, 2021, 103 (19)
[14]   Simulation of interacting fermions with entanglement renormalization [J].
Corboz, Philippe ;
Evenbly, Glen ;
Verstraete, Frank ;
Vidal, Guifre .
PHYSICAL REVIEW A, 2010, 81 (01)
[15]   Fermionic multiscale entanglement renormalization ansatz [J].
Corboz, Philippe ;
Vidal, Guifre .
PHYSICAL REVIEW B, 2009, 80 (16)
[16]   TENSOR RANK AND THE ILL-POSEDNESS OF THE BEST LOW-RANK APPROXIMATION PROBLEM [J].
de Silva, Vin ;
Lim, Lek-Heng .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2008, 30 (03) :1084-1127
[17]   QUANTUM FIELD-THEORIES ON A LATTICE - VARIATIONAL METHODS FOR ARBITRARY COUPLING STRENGTHS AND ISING-MODEL IN A TRANSVERSE MAGNETIC-FIELD [J].
DRELL, SD ;
WEINSTEIN, M ;
YANKIELOWICZ, S .
PHYSICAL REVIEW D, 1977, 16 (06) :1769-1781
[18]   Three qubits can be entangled in two inequivalent ways [J].
Dur, W. ;
Vidal, G. ;
Cirac, J.I. .
Physical Review A - Atomic, Molecular, and Optical Physics, 2000, 62 (06) :062314-062311
[19]   Colloquium: Area laws for the entanglement entropy [J].
Eisert, J. ;
Cramer, M. ;
Plenio, M. B. .
REVIEWS OF MODERN PHYSICS, 2010, 82 (01) :277-306
[20]   Algorithms for entanglement renormalization [J].
Evenbly, G. ;
Vidal, G. .
PHYSICAL REVIEW B, 2009, 79 (14)