Optimization at the boundary of the tensor network variety

Tensor network states form a variational ansatz class widely used, both analytically and numerically, in the study of quantum many-body systems. It is known that if the underlying graph contains a cycle, e.g. as in projected entangled pair states (PEPS), then the set of tensor network states of given bond dimension is not closed. Its closure is the tensor network variety. Recent work has shown that states on the boundary of this variety can yield more efficient representations for states of physical interest, but it remained unclear how to systematically find and optimize over such representations. We address this issue by defining a new ansatz class of states that includes states at the boundary of the tensor network variety of given bond dimension. We show how to optimize over this class in order to find ground states of local Hamiltonians by only slightly modifying standard algorithms and code for tensor networks. We apply this new method to a different of models and observe favorable energies and runtimes when compared with standard tensor network methods.

[1]  N. Schuch,et al.  Projected Entangled Pair States: Fundamental Analytical and Numerical Limitations. , 2020, Physical review letters.

[2]  Jens Eisert,et al.  Contracting projected entangled pair states is average-case hard , 2018, Physical Review Research.

[3]  A. H. Werner,et al.  Tensor network representations from the geometry of entangled states , 2018, SciPost Physics.

[4]  Mizanur Rahaman,et al.  A New Bound on Quantum Wielandt Inequality , 2018, IEEE Transactions on Information Theory.

[5]  W. Hackbusch.  A Note on Nonclosed Tensor Formats , 2019, Vietnam Journal of Mathematics.

[6]  Paulette Singley.  Criticality , 2019, How to Read Architecture.

[7]  Yaroslav Shitov,et al.  Quantum Version of Wielandt’s Inequality Revisited , 2018, IEEE Transactions on Information Theory.

[8]  Matthias Christandl,et al.  On the partially symmetric rank of tensor products of $W$-states and other symmetric tensors , 2018, Rendiconti Lincei - Matematica e Applicazioni.

[9]  Matthias Christandl,et al.  Border Rank Is Not Multiplicative under the Tensor Product , 2018, SIAM J. Appl. Algebra Geom..

[10]  W. Hager,et al.  and s , 2019, Shallow Water Hydraulics.

[11]  R. Sarpong,et al.  Bio-inspired synthesis of xishacorenes A, B, and C, and a new congener from fuscol† †Electronic supplementary information (ESI) available. See DOI: 10.1039/c9sc02572c , 2019, Chemical science.

[12]  Frank Pollmann,et al.  Efficient numerical simulations with Tensor Networks: Tensor Network Python (TeNPy) , 2018, SciPost Physics Lecture Notes.

[13]  Glen Evenbly,et al.  Gauge fixing, canonical forms, and optimal truncations in tensor networks with closed loops , 2018, Physical Review B.

[14]  Avi Wigderson,et al.  Barriers for Rank Methods in Arithmetic Complexity , 2017, Electron. Colloquium Comput. Complex..

[15]  J. M. Landsberg,et al.  Geometry and Complexity Theory , 2017 .

[16]  Matthias Christandl,et al.  Tensor rank is not multiplicative under the tensor product , 2017, ArXiv.

[17]  Umesh Vazirani,et al.  Rigorous RG Algorithms and Area Laws for Low Energy Eigenstates in 1D , 2016, Communications in Mathematical Physics.

[18]  U. Vazirani,et al.  A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians , 2015, Nature Physics.

[19]  Guoming Wang,et al.  Tensor network non-zero testing , 2014, Quantum Inf. Comput..

[20]  B. Normand,et al.  Tensor renormalization of quantum many-body systems using projected entangled simplex states , 2013, 1307.5696.

[21]  Roman Orus,et al.  A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States , 2013, 1306.2164.

[22]  Yang Qi,et al.  On the geometry of tensor network states , 2011, Quantum Inf. Comput..

[23]  W. Marsden.  I and J , 2012 .

[24]  J. Landsberg.  Tensors: Geometry and Applications , 2011 .

[25]  U. Schollwoeck.  The density-matrix renormalization group in the age of matrix product states , 2010, 1008.3477.

[26]  Axel Maas,et al.  On gauge fixing , 2010, 1010.5718.

[27]  F. Verstraete,et al.  Exploiting translational invariance in matrix product state simulations of spin chains with periodic boundary conditions , 2010, 1005.5195.

[28]  D. Pérez-García,et al.  PEPS as ground states: Degeneracy and topology , 2010, 1001.3807.

[29]  Mikel Sanz,et al.  A Quantum Version of Wielandt's Inequality , 2009, IEEE Transactions on Information Theory.

[30]  T. Xiang,et al.  Accurate determination of tensor network state of quantum lattice models in two dimensions. , 2008, Physical review letters.

[31]  G. Vidal.  Class of quantum many-body states that can be efficiently simulated. , 2006, Physical review letters.

[32]  A. Hoorfar,et al.  INEQUALITIES ON THE LAMBERTW FUNCTION AND HYPERPOWER FUNCTION , 2008 .

[33]  F. Verstraete,et al.  Computational complexity of projected entangled pair states. , 2007, Physical review letters.

[34]  Frank Verstraete,et al.  Matrix product state representations , 2006, Quantum Inf. Comput..

[35]  G. Vidal.  Entanglement renormalization. , 2005, Physical review letters.

[36]  F. Verstraete,et al.  Criticality, the area law, and the computational power of projected entangled pair states. , 2006, Physical review letters.

[37]  G. Vidal,et al.  Classical simulation of quantum many-body systems with a tree tensor network , 2005, quant-ph/0511070.

[38]  Kamal Khuri-Makdisi.  Representations of SL ( 2 ) × , 2006 .

[39]  F. Verstraete,et al.  Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions , 2004, cond-mat/0407066.

[40]  J. Landsberg,et al.  Cartan for beginners , 2003 .

[41]  White,et al.  Density matrix formulation for quantum renormalization groups. , 1992, Physical review letters.

[42]  M. Fannes,et al.  Finitely correlated states on quantum spin chains , 1992 .

[43]  Physical Review Letters 63 , 1989 .

[44]  V. Strassen.  Relative bilinear complexity and matrix multiplication. , 1987 .

[45]  Robert A. Proctor.  Representations of $\mathfrak{sl}( 2,\mathbb{C} )$ on Posets and the Sperner Property , 1982 .

[46]  Grazia Lotti,et al.  Approximate Solutions for the Bilinear Form Computational Problem , 1980, SIAM J. Comput..

[47]  Dario Bini.  Relations between exact and approximate bilinear algorithms. Applications , 1980 .

[48]  高等学校計算数学学報編輯委員会編,et al.  高等学校計算数学学報 = Numerical mathematics , 1979 .