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

When Does Monte Carlo Depend Polynomially on the Number of Variables?

Ian H. Sloan, Henryk Woźniakowski

Published Jan 1, 2004• 14 citations
Publisher
DOI
10.1007/978-3-642-18743-8_26

Related papers

Benchmark of the Polynomial Expansion Monte Carlo Method

Hiroaki Ishizuka

Springer theses•Jan 1, 2015•0 citations

What Monte Carlo models can do and cannot do efficiently?

Emanouil I. Atanassov, Ivan Dimov

Applied Mathematical Modelling•Jul 5, 2007•35 citations

Fast-update in self-learning algorithm for continuous-time quantum Monte Carlo

Ruixiao Cao, Synge Todo

We propose a novel technique for speeding up the self-learning Monte Carlo method applied to the single-site impurity model. For the case where the effective Hamiltonian is expressed by polynomial functions of differences of imaginary-time coordinate between vertices, we can remove the dependence of CPU time on the number of vertices, $n$, by saving and updating some coefficients for each insertion and deletion process. As a result, the total cost for a single-step update is drastically reduced from $O(nm)$ to $O(m^2)$ with $m$ being the order of polynomials in the effective Hamiltonian. Even for the existing algorithms, in which the absolute value is used instead of the difference as the variable of polynomial functions, we can limit the CPU time for a single step of Monte Carlo update to $O(m^2 + m \log n)$ with the help of balanced binary search trees. We demonstrate that our proposed algorithm with only logarithmic $n$-dependence achieves an exponential speedup from the existing methods, which suffer from severe performance issues at low temperatures.

arXiv:2106.11645•Jun 22, 2021•0 citations

Quantum Adversarial Learning in Emulation of Monte-Carlo Methods for Max-cut Approximation: QAOA is not optimal

Cem M. Unsal, Lucas T. Brady

One of the leading candidates for near-term quantum advantage is the class of Variational Quantum Algorithms, but these algorithms suffer from classical difficulty in optimizing the variational parameters as the number of parameters increases. Therefore, it is important to understand the expressibility and power of various ansätze to produce target states and distributions. To this end, we apply notions of emulation to Variational Quantum Annealing and the Quantum Approximate Optimization Algorithm (QAOA) to show that QAOA is outperformed by variational annealing schedules with equivalent numbers of parameters. Our Variational Quantum Annealing schedule is based on a novel polynomial parameterization that can be optimized in a similar gradient-free way as QAOA, using the same physical ingredients. In order to compare the performance of ansätze types, we have developed statistical notions of Monte-Carlo methods. Monte-Carlo methods are computer programs that generate random variables that approximate a target number that is computationally hard to calculate exactly. While the most well-known Monte-Carlo method is Monte-Carlo integration (e.g. Diffusion Monte-Carlo or path-integral quantum Monte-Carlo), QAOA is itself a Monte-Carlo method that finds good solutions to NP-complete problems such as Max-cut. We apply these statistical Monte-Carlo notions to further elucidate the theoretical framework around these quantum algorithms.

arXiv:2211.13767•Nov 24, 2022•4 citations

On the Power of Restricted Monte Carlo Algorithms

Stefan Heinrich

MATRIX book series•Jan 1, 2020•3 citations

Bernstein Numbers and Lower Bounds for the Monte Carlo Error

Robert J. Kunsch

Springer proceedings in mathematics & statistics•Jan 1, 2016•6 citations
We propose a novel technique for speeding up the self-learning Monte Carlo method applied to the single-site impurity model. For the case where the effective Hamiltonian is expressed by polynomial functions of differences of imaginary-time coordinate between vertices, we can remove the dependence of CPU time on the number of vertices, nnn, by saving and updating some coefficients for each insertion and deletion process. As a result, the total cost for a single-step update is drastically reduced from O(nm)O(nm)O(nm) to O(m2)O(m^2)O(m2) with mmm being the order of polynomials in the effective Hamiltonian. Even for the existing algorithms, in which the absolute value is used instead of the difference as the variable of polynomial functions, we can limit the CPU time for a single step of Monte Carlo update to O(m2+mlog⁡n)O(m^2 + m \log n)O(m2+mlogn) with the help of balanced binary search trees. We demonstrate that our proposed algorithm with only logarithmic nnn-dependence achieves an exponential speedup from the existing methods, which suffer from severe performance issues at low temperatures.
One of the leading candidates for near-term quantum advantage is the class of Variational Quantum Algorithms, but these algorithms suffer from classical difficulty in optimizing the variational parameters as the number of parameters increases. Therefore, it is important to understand the expressibility and power of various ansätze to produce target states and distributions. To this end, we apply notions of emulation to Variational Quantum Annealing and the Quantum Approximate Optimization Algorithm (QAOA) to show that QAOA is outperformed by variational annealing schedules with equivalent numbers of parameters. Our Variational Quantum Annealing schedule is based on a novel polynomial parameterization that can be optimized in a similar gradient-free way as QAOA, using the same physical ingredients. In order to compare the performance of ansätze types, we have developed statistical notions of Monte-Carlo methods. Monte-Carlo methods are computer programs that generate random variables that approximate a target number that is computationally hard to calculate exactly. While the most well-known Monte-Carlo method is Monte-Carlo integration (e.g. Diffusion Monte-Carlo or path-integral quantum Monte-Carlo), QAOA is itself a Monte-Carlo method that finds good solutions to NP-complete problems such as Max-cut. We apply these statistical Monte-Carlo notions to further elucidate the theoretical framework around these quantum algorithms.