Abstract. We briefly review various computational methods for the solution of optimization problems. First, several classical methods such as Metropolis algorithm and simulated annealing are discussed. We continue with a description of quantum methods, namely adiabatic quantum computation and quantum annealing. Next, the new D-Wave computer and the recent progress in the field claimed by the D-Wave group are discussed. We present a set of criteria which could help in testing the quantum features of these computers. We conclude with a list of considerations with regard to future research.
Quantum annealing is a quantum computing approach widely used for optimization and probabilistic sam...
In this article we encompass the first comprehensive work in the process of translating modern optim...
This paper describes an experimental study of a novel com-puting system (algorithm plus platform) th...
We briefly review various computational methods for the solution of optimization problems. First, se...
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which pro...
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which pro...
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which pro...
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which pro...
Quantum annealing is a heuristic quantum optimization algorithm that can be used to solve combinator...
"Quantum annealing employs quantum fluctuations in frustrated systems or networks to anneal the syst...
"Quantum annealing employs quantum fluctuations in frustrated systems or networks to anneal the syst...
The focus of this work is an implementation of the chosen quantum-inspired optimisation algorithm an...
We review here some recent work in the field of quantum annealing, alias adiabatic quantum computati...
Quantum annealing is a new-generation tool of information technology, which helps in solving combina...
Quantum annealing belongs to a family of quantum optimization algorithms designed to solve combinato...
Quantum annealing is a quantum computing approach widely used for optimization and probabilistic sam...
In this article we encompass the first comprehensive work in the process of translating modern optim...
This paper describes an experimental study of a novel com-puting system (algorithm plus platform) th...
We briefly review various computational methods for the solution of optimization problems. First, se...
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which pro...
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which pro...
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which pro...
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which pro...
Quantum annealing is a heuristic quantum optimization algorithm that can be used to solve combinator...
"Quantum annealing employs quantum fluctuations in frustrated systems or networks to anneal the syst...
"Quantum annealing employs quantum fluctuations in frustrated systems or networks to anneal the syst...
The focus of this work is an implementation of the chosen quantum-inspired optimisation algorithm an...
We review here some recent work in the field of quantum annealing, alias adiabatic quantum computati...
Quantum annealing is a new-generation tool of information technology, which helps in solving combina...
Quantum annealing belongs to a family of quantum optimization algorithms designed to solve combinato...
Quantum annealing is a quantum computing approach widely used for optimization and probabilistic sam...
In this article we encompass the first comprehensive work in the process of translating modern optim...
This paper describes an experimental study of a novel com-puting system (algorithm plus platform) th...