D-Wave and predecessors: From simulated to quantum annealing
From MaRDI portal
Publication:2925838
DOI10.1142/S0219749914300022zbMath1301.81044WikidataQ62568725 ScholiaQ62568725MaRDI QIDQ2925838
Publication date: 29 October 2014
Published in: International Journal of Quantum Information (Search for Journal in Brave)
Computing methodologies for image processing (68U10) Quantum computation (81P68) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Adaptive umbrella sampling: Self-consistent determination of the non- Boltzmann bias
- Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines
- Simulated annealing: Practice versus theory
- Genetic algorithms: Foundations and applications
- Very fast simulated re-annealing
- Quantum stochastic optimization
- Quantum Ising phases and transitions in transverse Ising models
- Possible generalization of Boltzmann-Gibbs statistics.
- Quantum computational networks
- Colloquium: Quantum annealing and analog quantum computation
- Universal Quantum Simulators
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Some aspects of the sequential design of experiments
