Fetching the paper…
Reading the bibliography…
Monte Carlo methods use random sampling to estimate numerical quantities which are hard to compute deterministically.
Theory of monomer-dimer systems
O. Heilmann and E. Lieb · 1972
Earlier work this paper cites.
Monte Carlo estimation of the free energy by multistage sampling
J. Valleau and D. Card · 1972
Earlier work this paper cites.
Random generation of combinatorial structures from a uniform distribution
M. Jerrum, L. Valiant, and V. Vazirani · 1986
Earlier work this paper cites.
The Monte Carlo method for semiconductor device simulation
C. Jacoboni and P. Lugli · 1989
Earlier work this paper cites.
Approximating the permanent
M. Jerrum and A. Sinclair · 1989
Earlier work this paper cites.
Computing the volume of convex bodies: a case where randomness provably helps
M. Dyer and A. Frieze · 1992
Earlier work this paper cites.
Polynomial-time approximation algorithms for the Ising model
M. Jerrum and A. Sinclair · 1993
Earlier work this paper cites.
Approach to equilibrium of Glauber dynamics in the one phase region
F. Martinelli and E. Olivieri · 1994
Earlier work this paper cites.
A very simple algorithm for estimating the number of k k -colourings of a low-degree graph
M. Jerrum · 1995
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Quantum mechanics helps in searching for a needle in a haystack
L. Grover · 1997
Earlier work this paper cites.
Simulating Ising spin glasses on a quantum computer
D. Lidar and O. Biham · 1997
Earlier work this paper cites.
Lectures on Glauber dynamics for discrete spin models
F. Martinelli · 1997
Earlier work this paper cites.
Quantum computation
D. Aharonov · 1998
Earlier work this paper cites.
Quantum circuits with mixed states
D. Aharonov, A. Kitaev, and N. Nisan · 1998
Earlier work this paper cites.
A framework for fast quantum mechanical algorithms
L. Grover · 1998
Earlier work this paper cites.
Fast quantum algorithms for numerical integrals and stochastic processes, 1999
D. Abrams and C. Williams · 1999
Earlier work this paper cites.
The quantum query complexity of approximating the median and related statistics
A. Nayak and F. Wu · 1999
Earlier work this paper cites.
An optimal algorithm for Monte Carlo estimation
P. Dagum, R. Karp, M. Luby, and S. Ross · 2000
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang · 2000
Earlier work this paper cites.
Quantum walks on graphs
D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani · 2001
Cited alongside, same era.
Quantum summation with an application to integration
S. Heinrich · 2001
Cited alongside, same era.
Quantum amplitude amplification and estimation
G. Brassard, P. Høyer, M. Mosca, and A. Tapp · 2002
Cited alongside, same era.
Monte Carlo methods in financial engineering
P. Glasserman · 2003
Cited alongside, same era.
Counting, sampling and integrating: algorithms and complexity
M. Jerrum · 2003
Cited alongside, same era.
On the quantum computational complexity of the Ising spin glass partition function and of knot invariants
D. Lidar · 2004
Cited alongside, same era.
Adaptive simulated annealing: a new connection between sampling and counting
D. Štefankovič, S. Vempala, and E. Vigoda · 2009
Later among the works it cites.
R. Tucci · 2009
Later among the works it cites.
Quantum algorithm for approximating partition functions
P. Wocjan, C.-F. Chang, D. Nagaj, and A. Abeyesinghe · 2009
Later among the works it cites.
Quantum computation and the evaluation of tensor networks
I. Arad and Z. Landau · 2010
Later among the works it cites.
Efficient circuits for quantum walks
C.-F. Chiang, D. Nagaj, and P. Wocjan · 2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Szegedy · 2004
Cited alongside, same era.
Statistical Mechanics: Algorithms and Computations
W. Krauth · 2006
Cited alongside, same era.
Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane, 2007
D. Aharonov, I. Arad, E. Eban, and Z. Landau · 2007
Cited alongside, same era.
Adiabatic quantum state generation
D. Aharonov and A. Ta-Shma · 2007
Cited alongside, same era.
A survey on the use of Markov chains to randomly sample colourings
A. Frieze and E. Vigoda · 2007
Cited alongside, same era.
Optimal quantum measurements of expectation values of observables
E. Knill, G. Ortiz, and R. Somma · 2007
Cited alongside, same era.
Later among the works it cites.
Quantum algorithm for exact Monte Carlo sampling
N. Destainville, B. Georgeot, and O. Giraud · 2010
Later among the works it cites.
Classical Ising model test for quantum circuits
J. Geraci and D. Lidar · 2010
Later among the works it cites.
G. Brassard, F. Dupuis, S. Gambs, and A. Tapp · 2011
Later among the works it cites.
Quantum algorithms for testing properties of distributions
S. Bravyi, A. W. Harrow, and A. Hassidim · 2011
Later among the works it cites.
Quantum algorithms for classical lattice models
G. De las Cuevas, W. Dür, M. van den Nest, and M. Martin-Delgado · 2011
Later among the works it cites.
K. Temme, T. Osborne, K. Vollbrecht, D. Poulin, and F. Verstraete · 2011
Later among the works it cites.
Testing symmetric properties of distributions
P. Valiant · 2011
Later among the works it cites.
Approximation algorithms for the normalizing constant of Gibbs distributions, 2012
M. Huber · 2012
Later among the works it cites.
Quantum walks: a comprehensive review
S. Venegas-Andraca · 2012
Later among the works it cites.
A quantum-quantum Metropolis algorithm
M.-H. Yung and A. Aspuru-Guzik · 2012
Later among the works it cites.
Exact thresholds for Ising-Gibbs samplers on general graphs
E. Mossel and A. Sly · 2013
Later among the works it cites.
Improving Monte Carlo randomized approximation schemes, 2014
M. Huber · 2014
Later among the works it cites.
Quantum algorithm for an additive approximation of Ising partition functions
A. Matsuo, K. Fujii, and N. Imoto · 2014
Later among the works it cites.
Hamiltonian simulation with nearly optimal dependence on all parameters
D. Berry, A. Childs, and R. Kothari · 2015
Closest in time.
Sequential quantum mixing for slowly evolving sequences of Markov chains, 2015
V. Dunjko and H. Briegel · 2015
Closest in time.