arrow
Return

Automatic structural optimization of tree tensor networks

delete2023-01-23
delete13
delete
OA
AI
T
Toshiya Hikihara *
H
Hiroshi Ueda
K
Kouichi Okunishi
K
Kenji Harada
T
Tomotoshi Nishino
DOI:10.1103/PhysRevResearch.5.013031delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The tree tensor network (TTN) provides an essential theoretical framework for the practical simulation of quantum many-body systems, where the network structure defined by the connectivity of the isometry tensors plays a crucial role in improving its approximation accuracy. In this paper, we propose a TTN algorithm that enables us to automatically optimize the network structure by local reconnections of isometries to suppress the bipartite entanglement entropy on their legs. The algorithm can be seamlessly implemented to such a conventional TTN approach as the density-matrix renormalization group. We apply the algorithm to the inhomogeneous antiferromagnetic Heisenberg spin chain, having a hierarchical spatial distribution of the interactions. We then demonstrate that the entanglement structure embedded in the ground state of the system can be efficiently visualized as a perfect binary tree in the optimized TTN. Possible improvements and applications of the algorithm are also discussed.
Keywords:
MATRIX RENORMALIZATION-GROUP
ALGORITHMS
SYSTEMS

Journal

Physical Review Research cover
Physical Review Research
IF:
4.2
Papers:
7.6K
Citations:
2.7W

Organization

K
Kyoto University
Scholars:
5.1W
Papers: 4.6W
Citations: 6.1W
G
Gunma University
Scholars:
6.8K
Papers: 4.8K
Citations: 3.5K
K
kobe university
Scholars:
1.6W
Papers: 1.2W
Citations: 8
T
the university of osaka
Scholars:
2.8W
Papers: 1.8W
Citations: 6
researcher View more organizations