In this paper we consider the use of certain classical analogues to quantum tunneling behavior to improve the performance of simulated annealing on a discrete spin system of the general Ising form. Specifically, we consider the use of multiple simultaneous spin flips at each annealing step as an analogue to quantum spin coherence as well as modifications of the Boltzmann acceptance probability to mimic quantum tunneling. We find that the use of multiple spin flips can indeed be advantageous under certain annealing schedules, but only for long anneal times.
Many partitioning methods may be used to partition a network into smaller clusters while minimizing the number of cuts needed. However, other considerations must also be taken into account when a network represents a real system such as a power grid. In this paper we use a simulated annealing Monte Carlo (MC) method to optimize initial clusters on the Florida high-voltage power-grid network that were formed by associating each load with its closest generator. The clusters are optimized to maximize internal connectivity within the individual clusters and minimize the power deficiency or surplus that clusters may otherwise have.
Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Simulated annealing is a computational technique which explores the configuration space by mimicking thermal noise. By slow cooling, it freezes the system in a low-energy configuration, but the algorithm often gets stuck in local minima. In quantum annealing, the thermal noise is replaced by controllable quantum fluctuations, and the technique can be implemented in modern quantum simulators. However, quantum-adiabatic schemes become prohibitively slow in the presence of quasidegeneracies. Here we propose a strategy which combines ideas from simulated annealing and quantum annealing. In such hybrid algorithm, the outcome of a quantum simulator is processed on a classical device. While the quantum simulator explores the configuration space by repeatedly applying quantum fluctuations and performing projective measurements, the classical computer evaluates each configuration and enforces a lowering of the energy. We have simulated this algorithm for small instances of the random energy model, showing that it potentially outperforms both simulated thermal annealing and adiabatic quantum annealing. It becomes most efficient for problems involving many quasi-degenerate ground states.
We formulate an adiabatic approximation for the imaginary-time Schroedinger equation. The obtained adiabatic condition consists of two inequalities, one of which coincides with the conventional adiabatic condition for the real-time Schroedinger equation, but the other does not. We apply this adiabatic approximation to the analysis of Markovian dynamics of the classical Ising model, which can be formulated as the imaginary-time Schrodinger equation, to obtain an asymptotic formula for the probability that the system reaches the ground state in the limit of a long annealing time in simulated annealing. Using this form, we amend the theory of Somma, Batista, and Ortiz for a convergence condition for simulated annealing.
We discuss an Ising spin glass where each $S=1/2$ spin is coupled antiferromagnetically to three other spins (3-regular graphs). Inducing quantum fluctuations by a time-dependent transverse field, we use out-of-equilibrium quantum Monte Carlo simulations to study dynamic scaling at the quantum glass transition. Comparing the dynamic exponent and other critical exponents with those of the classical (temperature-driven) transition, we conclude that quantum annealing is less efficient than classical simulated annealing in bringing the system into the glass phase. Quantum computing based on the quantum annealing paradigm is therefore inferior to classical simulated annealing for this class of problems. We also comment on previous simulations where a parameter is changed with the simulation time, which is very different from the true Hamiltonian dynamics simulated here.
In the frames of classical mechanics the generalized Langevin equation is derived for an arbitrary mechanical subsystem coupled to the harmonic bath of a solid. A time-acting temperature operator is introduced for the quantum Klein-Kramers and Smoluchowski equations, accounting for the effect of the quantum thermal bath oscillators. The model of Brownian emitters is theoretically studied and the relevant evolutionary equations for the probability density are derived. The Schrodinger equation is explained via collisions of the target point particles with the quantum force carriers, transmitting the fundamental interactions between the point particles. Thus, electrons and other point particles are no waves and the wavy chapter of quantum mechanics originated for the force carriers. A stochastic Lorentz-Langevin equation is proposed to describe the underlaying Brownian-like motion of the point particles in quantum mechanics. Considering the Brownian dynamics in the frames of the Bohmian mechanics, the density functional Bohm-Langevin equation is proposed, and the relevant Smoluchowski-Bohm equation is derived. A nonlinear master equation is proposed by proper quantization of the classical Klein-Kramers equation. Its equilibrium solution in the exact canonical Gibbs density operator, while the well-known Caldeira-Leggett equation is simply a linearization at high temperature. In the case of a free quantum Brownian particles, a new law for the spreading of the wave packet it discovered, which represents the quantum generalization of the classical Einstein law of Brownian motion. A new projector operator is proposed for the collapse of the wave function of a quantum particle moving in a classical environment. Its application results in dissipative Schrodinger equations, as well as in a new form of dissipative Liouville equation in classical mechanics.