Related papers: Ground-state statistics from annealing algorithms:…
Quantum annealing leverages the properties of interacting quantum spin systems to solve computational problems, typically optimisation problems. Current hardware now has capabilities that can be used to solve condensed matter physics…
Quantum technology is maturing to the point where quantum devices, such as quantum communication systems, quantum random number generators and quantum simulators, may be built with capabilities exceeding classical computers. A quantum…
Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical…
In this paper, we review some features of quantum annealing and related topics from viewpoints of statistical physics, condensed matter physics, and computational physics. We can obtain a better solution of optimization problems in many…
We study the problem to infer the original ground state of a spin-glass Hamiltonian out of the information from the Hamiltonian with interactions deviated from the original ones. Our motivation comes from quantum annealing on a real device…
I describe how real quantum annealers may be used to perform local (in state space) searches around specified states, rather than the global searches traditionally implemented in the quantum annealing algorithm. Such protocols will have…
We study a bifurcation mechanism of quantum annealing. Using spins with quantum number S=1, we construct a simple model to make a bifurcation. The qutrit can be composed by nesting two qubits. We numerically solve the Schroedinger equation…
Simulated quantum annealing based on the path-integral Monte Carlo is one of the most common tools to simulate quantum annealing on classical hardware. Nevertheless, it is in principle highly non-trivial whether or not this classical…
Quantum computing allows for the manipulation of highly correlated states whose properties quickly go beyond the capacity of any classical method to calculate. Thus one natural problem which could lend itself to quantum advantage is the…
Ice states, in which frustrated interactions lead to a macroscopic ground-state degeneracy, occur in water ice, in problems of frustrated charge order on the pyrochlore lattice, and in the family of rare-earth magnets collectively known as…
Quantum annealing, which involves quantum tunnelling among possible solutions, has state-of-the-art applications not only in quickly finding the lowest-energy configuration of a complex system, but also in quantum computing. Here we report…
Recent developments in quantum annealing techniques have been indicating potential advantage of quantum annealing for solving NP-hard optimization problems. In this article we briefly indicate and discuss the beneficial features of quantum…
The Hubbard model has occupied the minds of condensed matter physicists for most part of the last century. This model provides insight into a range of phenomena in correlated electron systems. We wish to examine the paradigm of quantum…
We explore the method of old quantization as applied to states with nonzero angular momentum, and show that it leads to qualitatively and quantitatively useful information about systems with spherically symmetric potentials. We begin by…
We investigate obtaining intermediate quantum states during the quantum annealing process to address the limitation of the linear weighted sum method in multi-objective optimization, which inherently fails to reach non-convex regions of the…
We suggest using the method of quantum annealing for computing the ground state of the Heisenberg spin chains. Our initial Hamiltonian describes a spin system in a highly non-uniform magnetic field. The initial Hamiltonian gradually…
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,…
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…
The debate around the potential superiority of quantum annealers over their classical counterparts has been ongoing since the inception of the field by Kadowaki and Nishimori close to two decades ago. Recent technological breakthroughs in…
We investigate global logarithmic asymptotics of ground states for a family of quantum mean field models. Our approach is based on a stochastic representation and a combination of large deviation and weak KAM techniques. The spin- 1/2 case…