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

Efficient evaluation of high-order moments and cumulants in tensor network states

Abstract: We present a numerical scheme for efficiently extracting the higher-order moments and cumulants of various operators on spin systems represented as tensor product states, for both finite and infinite systems, and present several applications for such quantities. For example, the second cumulant of the energy of a state, ∆H 2 , gives a straightforward method to check the convergence of numerical ground-state approximation algorithms. Additionally, we discuss the use of moments and cumulants in the study of phas… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
9
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 73 publications
0
9
0
Order By: Relevance
“…Hence, the critical point obtained from it is much more precise than using solely the order parameter. The occurrence of a crossing point in the Binder cumulant is also observed in infinite translationally-invariant systems represented by an iMPS, where the crossing occurs between U 4 of different bond dimension m instead of L [6].…”
Section: Introductionmentioning
confidence: 75%
See 1 more Smart Citation
“…Hence, the critical point obtained from it is much more precise than using solely the order parameter. The occurrence of a crossing point in the Binder cumulant is also observed in infinite translationally-invariant systems represented by an iMPS, where the crossing occurs between U 4 of different bond dimension m instead of L [6].…”
Section: Introductionmentioning
confidence: 75%
“…The advantage this recursive method has over other tensor network methods of calculating higher-order moments and cumulants such as that in Ref. [6] is that it unifies the method of computing the expectation values of local and string operators whereby the latter ends up being treated as a second order operator (i.e. a two-point correlator).…”
Section: Higher-order Moments and Cumulants In Tensor Networkmentioning
confidence: 99%
“…Indeed, generating functions for the moments and cumulants have been introduced in Ref. [40], which took exponential forms with possible Trotter error and a finite difference method was then employed. In contrast, our approach does not have Trotter error, nor finite difference error, and the generating functions for the state and operator can be unified in a simple way.…”
mentioning
confidence: 99%
“…Hence, the critical point obtained from it is much more precise than using solely the order parameter. The occurrence of a crossing point in the Binder cumulant is also observed in infinite translationally-invariant systems represented by an iMPS, where the crossing occurs between U 4 of different bond dimension m instead of L [145].…”
Section: Introductionmentioning
confidence: 75%
“…The advantage this recursive method has over other tensor network methods of calculating higher-order moments and cumulants such as that in Ref. [145] is that it unifies the method of computing the expectation values of local and string operators whereby the latter ends up being treated as a second order operator (i.e. a two-point correlator).…”
Section: Higher-order Moments and Cumulants In Tensor Networkmentioning
confidence: 99%