Related papers: Breakdown of the weak coupling limit in quantum an…
In the computational model of quantum annealing, the size of the minimum gap between the ground state and the first excited state of the system is of particular importance, since it is inversely proportional to the running time of the…
This paper experimentally investigates the behavior of analog quantum computers such as commercialized by D-Wave when confronted to instances of the maximum cardinality matching problem specifically designed to be hard to solve by means of…
Recent tests performed on the D-Wave Two quantum annealer have revealed no clear evidence of speedup over conventional silicon-based technologies. Here, we present results from classical parallel-tempering Monte Carlo simulations combined…
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The…
Quantum annealing offers a novel approach to finding the optimal solutions for a variety of computational problems, where the quantum annealing controls influence the observed performance and error mechanisms by tuning the underlying…
The rotational and fine structure of open-shell molecules in a $\Sigma$ electronic state gives rise to crossings between Zeeman states of different parity. These crossings become avoided in the presence of an electric field. We propose an…
We introduce the reinforcement quantum annealing (RQA) scheme in which an intelligent agent interacts with a quantum annealer that plays the stochastic environment role of learning automata and tries to iteratively find better Ising…
We investigate the properties of quantum annealing applied to the random field Ising model in one, two and three dimensions. The decay rate of the residual energy, defined as the energy excess from the ground state, is find to be…
The presence of a bias field, encoding some information about the target state, can enhance the performance of quantum optimization methods. Here we investigate the effect of such a bias field on the outcome of quantum annealing sampling,…
Disordered magnets, martensitic mixed crystals, and glassy solids can be irreversibly deformed by subjecting them to external deformation. The deformation produces a smooth, reversible response punctuated by abrupt relaxation "glitches".…
We study a two-dimensional cylindrically-symmetric electron droplet separated from a surrounding electron ring by a tunable barrier using the exact diagonalization method. The magnetic field is assumed strong so that the electrons become…
In a recent preprint (arXiv:1305.4904) entitled "Classical signature of quantum annealing" Smolin and Smith point out that a bimodal distribution presented in (arXiv:1304.4595) for the success probability in the D-Wave device does not in…
Quantum annealing is an emerging metaheuristic used for solving combinatorial optimisation problems. However, hardware based physical quantum annealers are primarily limited to a single vendor. As an alternative, we can discretise the…
We derive a generic bound on the rate of decrease of transverse field for quantum annealing to converge to the ground state of a generic Ising model when quantum annealing is formulated as an infinite-time process. Our theorem is based on a…
Quantum annealing is a heuristic optimization algorithm that exploits quantum evolution to approximately find lowest energy states. Quantum annealers have scaled up in recent years to tackle increasingly larger and more highly connected…
Quantum annealing provides a promising route for the development of quantum optimization devices, but the usefulness of such devices will be limited in part by the range of implementable problems as dictated by hardware constraints. To…
Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of the quantum chip, from which a solution is obtained after…
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…
For quantum annealing, as opposed to circuit based quantum computing, the solution to a computational problem is encoded in the ground state of a quantum system. Therefore its susceptibility to environmental effects is a different but not…
The presence of competing interactions due to geometry leads to frustration in quantum spin models. As a consequence, the ground state of such systems often displays a large degeneracy that can be lifted due to thermal or quantum effects.…