Related papers: Simulated Annealing In $\mathbf{R}^d$ With Slowly …
We study a $(1+1)$-dimensional semi-discrete random variational problem that can be interpreted as the geometrically linearized version of the critical $2$-dimensional random field Ising model. The scaling of the correlation length of the…
We derive a generic bound on the rate of decrease of transverse field for quantum annealing to converge to the ground state of a generic Ising model when quantum annealing is formulated as an infinite-time process. Our theorem is based on a…
We consider the simple random walk on Z^d evolving in a potential of independent and identically distributed random variables taking values in [0, + \infty]. We give optimal conditions for the existence of the quenched point-to-point…
We perform exact diagonalization and time evolution of the Lechner-Hauke-Zoller (LHZ) annealing architecture [Science Advances 1(9), e1500838 (2015)] for ten physical qubits. Thereby, on a training set consisting of $2400$ problem…
We consider solutions of the time-dependent Schr\"odinger equation for a potential localised at the points of a Poisson process. We prove convergence of the phase-space distribution in the annealed Boltzmann-Grad limit to a semiclassical…
We prove a theorem for the growth of the energy of bounded, globally minimizing solutions to a class of semilinear elliptic systems of the form $\Delta u=\nabla W(u)$, $x\in \mathbb{R}^n$, $n\geq 2$, with $W:\mathbb{R}^m\to \mathbb{R}$,…
Designing an effective move-generation function for Simulated Annealing (SA) in complex models remains a significant challenge. In this work, we present a combination of theoretical analysis and numerical experiments to examine the impact…
In this review, after providing the basic physical concept behind quantum annealing (or adiabatic quantum computation), we present an overview of some recent theoretical as well as experimental developments pointing to the issues which are…
Energy-based probabilistic models learned by maximizing the likelihood of the data are limited by the intractability of the partition function. A widely used workaround is to maximize the pseudo-likelihood, which replaces the global…
We present a study of dynamical scaling and front motion in a one dimensional system that describes Rayleigh-Benard convection in a rotating cell. We use a model of three competing modes proposed by Busse and Heikes to which spatial…
It has been recently discovered that some random processes may satisfy limit theorems even though they exhibit intermittency, namely an unusual growth of moments. In this paper we provide a deeper understanding of these intricate limiting…
We perform numerical studies of a thermally driven, overdamped particle in a random quenched force field, known as the Sinai model. We compare the unbounded motion on an infinite 1-dimensional domain to the motion in bounded domains with…
We study approximation in the unit interval by rational numbers whose numerators are selected randomly with certain probabilities. Previous work showed that an analogue of Khintchine's Theorem holds in a similar random model and raised the…
Roughly half of numerical investigations of the Anderson transition are based on consideration of an associated quasi-1D system and postulation of one-parameter scaling for the minimal Lyapunov exponent. If this algorithm is taken…
Annealing algorithms such as simulated annealing and population annealing are widely used both for sampling the Gibbs distribution and solving optimization problems (i.e. finding ground states). For both statistical mechanics and…
We study the equations obtained from linearizing the compressible Navier-Stokes equations around a steady-state profile with a heavier fluid lying above a lighter fluid along a planar interface, i.e. a Rayleigh-Taylor instability. We…
We investigate the properties of quantum annealing applied to the random field Ising model in one, two and three dimensions. The decay rate of the residual energy, defined as the energy excess from the ground state, is find to be…
Quantum annealing has shown significant potential as an approach to near-term quantum computing. Despite promising progress towards obtaining a quantum speedup, quantum annealers are limited by the need to embed problem instances within the…
Simulated Annealing (SA) is a widely used stochastic optimization algorithm, yet much of its theoretical understanding is limited to asymptotic convergence guarantees or general spectral bounds. In this paper, we develop a finite-time…
We simulate a growth model with restricted surface relaxation process in d=1 and d=2, where d is the dimensionality of a flat substrate. In this model, each particle can relax on the surface to a local minimum, as the Edwards-Wilkinson…