2013
DOI: 10.1103/physreve.87.013306
|View full text |Cite
|
Sign up to set email alerts
|

Wang-Landau method for calculating Rényi entropies in finite-temperature quantum Monte Carlo simulations

Abstract: We implement a Wang-Landau sampling technique in quantum Monte Carlo (QMC) simulations for the purpose of calculating the Rényi entanglement entropies and associated mutual information. The algorithm converges an estimate for an analog to the density of states for stochastic series expansion QMC, allowing a direct calculation of Rényi entropies without explicit thermodynamic integration. We benchmark results for the mutual information on two-dimensional (2D) isotropic and anisotropic Heisenberg models, a 2D tr… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

5
39
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 39 publications
(44 citation statements)
references
References 37 publications
(71 reference statements)
5
39
0
Order By: Relevance
“…To do that, we exploit the expansion of the correlators ⟨s n s m ⟩ and ⟨p n p m ⟩ (cf. (28) and (29)). Let us first consider the negativity between site n ≡ (n x , n y , n z ) and m ≡ (m x , m y , m z ).…”
Section: Low-temperature Expansionmentioning
confidence: 94%
See 1 more Smart Citation
“…To do that, we exploit the expansion of the correlators ⟨s n s m ⟩ and ⟨p n p m ⟩ (cf. (28) and (29)). Let us first consider the negativity between site n ≡ (n x , n y , n z ) and m ≡ (m x , m y , m z ).…”
Section: Low-temperature Expansionmentioning
confidence: 94%
“…Much efforts focused on the behaviour of the mutual information. For instance, it has been suggested [25][26][27][28][29][30] that the mutual information exhibits a crossing for different sizes at a finite-temperature critical point, similar to more traditional tools in critical phenomena, such as the Binder cumulant [31].…”
Section: Introductionmentioning
confidence: 95%
“…In practice, we consider as a condition for the flatness of H(n) a maximum deviation of 20% from the mean value. Once H(n) is flat, it is reset to zero, and f is decreased by ln( f )→ln( f old )/2 [41]. This process is repeated until convergence is achieved.…”
Section: Measuring Entanglement Entropy In Numerical Simulationsmentioning
confidence: 99%
“…This process is repeated until convergence is achieved. Here we use the convergence condition proposed in [41,42].…”
Section: Measuring Entanglement Entropy In Numerical Simulationsmentioning
confidence: 99%
“…The 1/t algorithm has been successfully applied to several statistical systems [24][25][26][27][28][29][30][31][32][33].…”
Section: Introductionmentioning
confidence: 99%