Related papers: Dynamical replica analysis of quantum annealing
In this paper it has been described how to use the unitary dynamics of quantum mechanics to solve the prime factorization problem on a spin ensemble without any quantum entanglement. The ensemble quantum computation for the prime…
The evaluation of the performance of adiabatic annealers is hindered by lack of efficient algorithms for simulating their behaviour. We exploit the analyticity of the standard model for the adiabatic quantum process to develop an efficient…
We describe and demonstrate a method for the computation of quantum dynamics on small, noisy universal quantum computers. This method relies on the idea of `restarting' the dynamics; at least one approximate time step is taken on the…
Quantum algorithms offer the potential for significant computational advantages; however, in many cases, it remains unclear how these advantages can be practically realized. Causal Set Theory is a discrete, Lorentz-invariant approach to…
The main idea of this work is that the quantum-classical isomorphism is a suitable framework for a generalization of the notion of detailed balance. The quantum-classical isomorphism is used in order to develop a Monte Carlo simulation with…
With the increasing popularity of quantum computing and in particular quantum annealing, there has been growing research to evaluate the meta-heuristic for various problems in linear algebra: from linear least squares to matrix and tensor…
Simulated annealing solves global optimization problems by means of a random walk in a cooling energy landscape based on the objective function and a temperature parameter. However, if the temperature is decreased too quickly, this…
We propose a variant of the Simulated Annealing method for optimization in the multivariate analysis of differentiable functions. The method uses global actualizations via the Hybrid Monte Carlo algorithm in their generalized version for…
We propose a hybrid quantum-classical algorithm for the simulation of real-time dynamics in interacting quantum field theories coupled to classical fields, focusing on the self-consistent estimation of semiclassical backreaction. By…
We propose a method to interpolate dynamics of von Neumann and classical master equations with an arbitrary mixing parameter to investigate the thermal effects in quantum dynamics. The two dynamics are mixed by intervening to continuously…
We describe a new algorithm for the numerical simulation of quantum spin and boson systems. The method is based on the Trotter decomposition in imaginary time and a decoupling by auxiliary Ising spins. It can be applied, in principle, to…
The dynamical equation of quantum mechanics are rewritten in form of dynamical equations for the measurable, positive marginal distribution of the shifted, rotated and squeezed quadrature introduced in the so called "symplectic tomography".…
We propose a new quantum Monte Carlo algorithm which realizes a relaxation intrinsic to the original quantum system. The Monte Carlo dynamics satisfies the dynamic scaling relation $\tau\sim \xi^z$ and is independent of the Trotter number.…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
Many important challenges in science and technology can be cast as optimization problems. When viewed in a statistical physics framework, these can be tackled by simulated annealing, where a gradual cooling procedure helps search for…
The quantum approximate optimisation algorithm was proposed as a heuristic method for solving combinatorial optimisation problems on near-term quantum computers and may be among the first algorithms to perform useful computations in the…
Analog Quantum Computers are promising tools for improving performance on applications such as modeling behavior of quantum materials, providing fast heuristic solutions to optimization problems, and simulating quantum systems. Due to the…
We reformulate the full quantum dynamics of spin systems using a phase space representation based on SU(2) coherent states which generates an exact mapping of the dynamics of any spin system onto a set of stochastic differential equations.…
Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum annealing machines produced by D-Wave Systems,…
Simulated quantum annealing is a generic classical protocol to simulate some aspects of quantum annealing and is sometimes regarded as a classical alternative to quantum annealing in finding the ground state of a classical Ising model. We…