Excitation Gap from Optimized Correlation Functions in Quantum Monte Carlo Simulations
arXiv:1112.2269 · doi:10.1103/PhysRevE.85.036705
Abstract
We give a prescription for finding optimized correlation functions for the extraction of the gap to the first excited state within quantum Monte Carlo simulations. We demonstrate that optimized correlation functions provide a more accurate reading of the gap when compared to other `non-optimized' correlation functions and are generally characterized by considerably larger signal-to-noise ratios. We also analyze the cost of the procedure and show that it is not computationally demanding. We illustrate the effectiveness of the proposed procedure by analyzing several exemplary many-body systems of interacting spin-1/2 particles.
arXiv comment11 pages, 5 figures
References in corpus (11)
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum Monte Carlo with Directed Loops
- Stochastic series expansion method with operator-loop update
- New Trends in Density Matrix Renormalization
- First order phase transition in the Quantum Adiabatic Algorithm
- Pion and Rho Structure Functions from Lattice QCD
- Size dependence of the minimum excitation gap in the Quantum Adiabatic Algorithm
- High-energy magnon dispersion and multi-magnon continuum in the two-dimensional Heisenberg antiferromagnet
- Exponential Complexity of the Quantum Adiabatic Algorithm for certain Satisfiability Problems
- On the path integral representation for quantum spin models and its application to the quantum cavity method and to Monte Carlo simulations
- Improving the signal-to-noise-ratio in lattice gauge theories
Cited by in corpus (17)
- Quantum annealing with more than one hundred qubits
- The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
- The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs
- Quantum Annealing for Constrained Optimization
- Driver Hamiltonians for constrained optimization in quantum annealing
- Practical engineering of hard spin-glass instances
- Analog Nature of Quantum Adiabatic Unstructured Search
- Off-Diagonal Expansion Quantum Monte Carlo
- Period Finding with Adiabatic Quantum Computation
- Advantages of Unfair Quantum Ground-State Sampling
- De-Signing Hamiltonians for Quantum Adiabatic Optimization
- Continuous-Time Quantum Algorithms for Unstructured Problems
- Adiabatic quantum optimization in presence of discrete noise: Reducing the problem dimensionality
- How Fast Can Quantum Annealers Count?
- Realizable Quantum Adiabatic Search
- How Quantum is the Speedup in Adiabatic Unstructured Search?
- Energy gap of quantum spin glasses: a projection quantum Monte Carlo study