Related papers: Quantum Annealing in a Kinetically Constrained Sys…
The success of a quantum annealing algorithm requires a polynomial scaling of the energy gap. Recently it was shown that a two-dimensional transverse-field Ising model on a square lattice with nearest-neighbor $\pm J$ random coupling has a…
Quantum annealing was originally proposed as an approach for solving combinatorial optimisation problems using quantum effects. D-Wave Systems has released a production model of quantum annealing hardware. However, the inherent noise and…
Quantum annealing is a promising heuristic method to solve combinatorial optimization problems, and efforts to quantify performance on real-world problems provide insights into how this approach may be best used in practice. We investigate…
Inhomogeneous quantum annealing (IQA), in which transverse fields are turned off one by one rather than simultaneously, has been proposed as an effective way to avoid the first-order phase transitions that impede conventional quantum…
We introduce transverse ferromagnetic interactions, in addition to a simple transverse field, to quantum annealing of the random-field Ising model to accelerate convergence toward the target ground state. The conventional approach using…
We investigate the correspondence between classical and quantum mechanics for periodically time dependent Hamiltonian systems, using the example of a periodically forced particle in a one-dimensional triangular well potential. In…
As simulations of quantum systems cross the limits of classical computability, both quantum and classical approaches become hard to verify. Scaling predictions are therefore based on local structure and asymptotic assumptions, typically…
The phenomenological Landau theory of the spin precession has been used to reproduce the out-of-equilibrium properties of many magnetic systems. However, such an approach suffers from some serious limitations. The main reason is that the…
We derive a semiclassical formula for the tunneling current of electrons trapped in a potential well which can tunnel into and across a wide quantum well. The calculations idealize an experimental situation where a strong magnetic field…
We propose an annealing scheme usable on modern Ising machines for crystal structures prediction (CSP) by taking into account the general n-body atomic interactions, and in particular three-body interactions which are necessary to simulate…
The two ways of constrained systems quantization are considered from the point of view of their self-consistency at the quantum level. With a transparent example of a particle in the external electromagnetic field we demonstrate that the…
This work establishes a firm relationship between classical nonlinear resonances and the phenomenon of dynamical tunneling. It is shown that the classical phase space with its hierarchy of resonance islands completely characterizes…
Many important challenges in science and technology can be cast as optimization problems. When viewed in a statistical physics framework, these can be tackled by simulated annealing, where a gradual cooling procedure helps search for…
Optimizing the training of a machine learning pipeline helps in reducing training costs and improving model performance. One such optimizing strategy is quantum annealing, which is an emerging computing paradigm that has shown potential in…
We study a prototypical model of two coupled two-level systems, where the competition between coherent and dissipative coupling gives rise to a rich phenomenology. In particular, we analyze the case of asymmetric coupling, as well as the…
Experiments on disordered alloys suggest that spin glasses can be brought into low-energy states faster by annealing quantum fluctuations than by conventional thermal annealing. Due to the importance of spin glasses as a paradigmatic…
Quantum annealing is a new method for finding extrema of multidimensional functions. Based on an extension of classical, simulated annealing, this approach appears robust with respect to avoiding local minima. Further, unlike some of its…
Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial…
We describe a quantum algorithm that solves combinatorial optimization problems by quantum simulation of a classical simulated annealing process. Our algorithm exploits quantum walks and the quantum Zeno effect induced by evolution…
Although the foundations of quantum and classical physics are much different, it is often difficult to pinpoint which features of a particular system are intrinsically "quantum". Perhapse, the most clear-cut distinction between "classical"…