Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Basics, Quantum Monte Carlo and Statistical Mechanics

M. P. Nightingale

Published Jan 1, 1999• 7 citations
Publisher
DOI
10.1007/978-94-011-4792-7_1

Related papers

The basics of quantum Monte Carlo

Lucas K. Wagner, Jeffrey C. Grossman, Jeffrey B. Neaton

•Jun 15, 2007•0 citations

Quantum statistical mechanics : a Monte Carlo study of clusters

Fung-kiu Chow

•Jan 1, 2000•0 citations

An Introduction to Quantum Monte Carlo

Jan Tobochnik, Harvey Gould, Kenneth Mulder

Computers in Physics•Jul 1, 1990•4 citations

A Monte Carlo method for quantum Boltzmann statistical mechanics

Jimmie D. Doll, David L. Freeman

An alternate approach to quantum Boltzmann statistical mechanics in calculations on interacting many-body systems is presented in the form of the Monte-Carlo method. (AIP)

The Journal of Chemical Physics•Mar 1, 1984•78 citations

An introduction to quantum monte carlo methods

Anders W. Sandvik

Springer eBooks•Apr 6, 2008•6 citations

Statistical Analysis for Quantum Adiabatic Computations: Quantum Monte Carlo Annealing

T. Neuhaus

Quantum adiabatic computations are designed to determine the ground state configurations of an classical problem Hamiltonian H3SAT within quantum theory and at imaginary time allow statistical mechanics studies for the computational e_ciency of the ground state search. We mention a recent determination of the quantum complexity, i.e. the mass-gap _mGAP for a specific ensemble of three-satisfiability (3SAT) problems with a unique satisfiability assignment, which shows an exponential increase of the gap correlation length _GAP with _GAP = 1=_mGAP. In 3SAT we present numerical data for the behavior of quantum Monte Carlo annealing cycles in search for the ground state. The findings show, that for the specific set of realizations quantum Monte Carlo searches in 3SAT fail above a sharp cut-o_ Kcut in the complexity K, which exemplifies the intractable nature of 3SAT.

Physics Procedia•Jan 1, 2011•0 citations
Quantum adiabatic computations are designed to determine the ground state configurations of an classical problem Hamiltonian H3SAT within quantum theory and at imaginary time allow statistical mechanics studies for the computational e_ciency of the ground state search. We mention a recent determination of the quantum complexity, i.e. the mass-gap _mGAP for a specific ensemble of three-satisfiability (3SAT) problems with a unique satisfiability assignment, which shows an exponential increase of the gap correlation length _GAP with _GAP = 1=_mGAP. In 3SAT we present numerical data for the behavior of quantum Monte Carlo annealing cycles in search for the ground state. The findings show, that for the specific set of realizations quantum Monte Carlo searches in 3SAT fail above a sharp cut-o_ Kcut in the complexity K, which exemplifies the intractable nature of 3SAT.