2014
DOI: 10.1103/physrevb.90.125154
|View full text |Cite
|
Sign up to set email alerts
|

Unconstrained tree tensor network: An adaptive gauge picture for enhanced performance

Abstract: We introduce a variational algorithm to simulate quantum many-body states based on a tree tensor network ansatz which releases the isometry constraint usually imposed by the real-space renormalization coarse-graining: This additional numerical freedom, combined with the loop-free topology of the tree network, allows one to maximally exploit the internal gauge invariance of tensor networks, ultimately leading to a computationally flexible and efficient algorithm able to treat open and periodic boundary conditio… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
85
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 62 publications
(86 citation statements)
references
References 88 publications
(106 reference statements)
1
85
0
Order By: Relevance
“…Moreover, we double-check our results via another method for the determination of the MI-SF transition, namely the value of the Luttinger parameter K obtained from the hopping correlation functions [18] In the clean case the criterion for locating the BKT transition is given by K 1 2 c = . Indeed, as critical exponents can be obtained with high numerical precision in TTN simulations [42], we expect this method to work well in the present scenario. Moreover, the PBC setting allows for an easy treatment of finite size effects in equation (4), simply by replacing the distance r with the effective distance r r crd…”
Section: Correlation Functionsmentioning
confidence: 68%
See 2 more Smart Citations
“…Moreover, we double-check our results via another method for the determination of the MI-SF transition, namely the value of the Luttinger parameter K obtained from the hopping correlation functions [18] In the clean case the criterion for locating the BKT transition is given by K 1 2 c = . Indeed, as critical exponents can be obtained with high numerical precision in TTN simulations [42], we expect this method to work well in the present scenario. Moreover, the PBC setting allows for an easy treatment of finite size effects in equation (4), simply by replacing the distance r with the effective distance r r crd…”
Section: Correlation Functionsmentioning
confidence: 68%
“…The absence of loops in the network is crucial for the applicability of efficient energy minimization techniques needed for the ground state search. For algorithm details we refer the reader to [42], however it is important to emphasize that with our TTN approach we will be able to compute the superfluid density for large system sizes (up to N s =256 in the absence of disorder) and therefore perform a reliable finite-size scaling analysis. As we will show, at equilibrium in 1D this approach provides matching results to Monte Carlo calculations.…”
Section: The Disordered Bose-hubbard Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…We emphasize that these distances therefore correspond to quite different measures than those studied in the various sciences mentioned before. We also note that in tensor networks the leaf-to-leaf "a.goldsborough@warwick.ac.uk; www.warwick.ac.uk/andrewgoIdsborough ' s.a.rautu@warwick.ac.uk *r.roemer@ Warwick.ac.uk; www.warwick.ac.uk/rudoroemer distance is referred to as the path length [13], but in graph theory this term usually refers to the sum of the levels of each of the vertices in the tree [1], In the present work, we shall concentrate on full and complete trees that have the same structure as regular tree tensor networks [14,15], We derive the average leaf-to-leaf distances for varying leaf separation with leaves ordered in a one-dimensional line as shown, e.g., in Fig. 1(a) for a binary tree [16], The method is then generalized to m-ary trees and the moments of the leaf-to-leaf distances.…”
Section: Introductionmentioning
confidence: 99%
“…The density-matrix renormalisation method [16] can indeed be viewed as a variational principle over matrix-product states [11,13,[17][18][19]. Generalising these ideas, a number of exciting methods have been proposed [20][21][22][23][24][25][26], some of which also allow to study open quantum systems. In most cases matrixproduct operators (MPO) are at the heart of these methods.…”
mentioning
confidence: 99%