Mathematical foundation of quantum annealing
Publication:3624670
DOI10.1063/1.2995837zbMath1159.81332arXiv0806.1859OpenAlexW2019013791WikidataQ60546683 ScholiaQ60546683MaRDI QIDQ3624670
Satoshi Morita, Hidetoshi Nishimori
Publication date: 30 April 2009
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.1859
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Quantum computation (81P68) Quantum dynamics and nonequilibrium statistical mechanics (general) (82C10) Dynamics of disordered systems (random Ising systems, etc.) in time-dependent statistical mechanics (82C44)
Related Items (16)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Quantum stochastic optimization
- Non-negative matrices and Markov chains.
- Relationship among Exactly Soluble Models of Critical Phenomena. I
- Convergence of Quantum Annealing with Real-Time Schrödinger Dynamics
- Quantum Approach to Classical Statistical Mechanics
- On the Product of Semi-Groups of Operators
- Convergence theorems for quantum annealing
- The influence of hydrodynamic instability on the structure of cellular flames
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Convergence of simulated annealing using the generalized transition probability
- Non-adiabatic crossing of energy levels
- Quantum Effects in Neural Networks
- Phase Transitions in Combinatorial Optimization Problems
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
This page was built for publication: Mathematical foundation of quantum annealing