Related papers: Continuous-time quantum optimisation without the a…
Recent advances bring within reach the viability of solving combinatorial problems using a quantum annealing algorithm implemented on a purpose-built platform that exploits quantum properties. However, the question of how to tune the…
We study algorithms inspired by quantum annealing that are suited for the NISQ era. First, we analyze approximate quantum annealing (AQA), which employs a discretized annealing ansatz in which the time step and the number of layers are…
Optimization is a major part of human effort. While being mathematical, optimization is also built into physics. For example, physics has the principle of Least Action, the principle of Minimum Entropy Generation, and the Variational…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
We study the adiabatic quantum dynamics of an anisotropic spin-1 XY chain across a second order quantum phase transition. The system is driven out of equilibrium by performing a quench on the uniaxial single-spin anisotropy, that is…
Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for…
We propose and compare Constraint Programming (CP) and Quantum Annealing (QA) approaches for rolling stock assignment optimisation considering necessary maintenance tasks. In the CP approach, we model the problem with an Alldifferent…
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…
I propose a "quantum annealing" heuristic for the problem of combinatorial search among a frustrated set of states characterized by a cost function to be minimized. The algorithm is probabilistic, with postselection of the measurement…
Quantum annealing aims to provide a faster method for finding the minima of complicated functions, compared to classical computing, so there is an increasing interest in the relaxation dynamics of quantum spin systems. Moreover, it is known…
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…
Many physically interesting models show a quantum phase transition when a single parameter is varied through a critical point, where the ground state and the first excited state become degenerate. When this parameter appears as a coupling…
It has been recently reported that classical systems have speed limit for state evolution, although such a concept of speed limit had been considered to be unique to quantum systems. Owing to the speed limit for classical system, the lower…
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…
We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that for problems that have exponentially large number of…
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…
We propose a strategy for modeling the behavior of an adiabatic quantum computer described by an Ising Hamiltonian with $N$ sites and the coordination number $Z$. The method is based on the $1/Z$ expansion for the density matrix of the…
The adiabatic theorem is a fundamental result established in the early days of quantum mechanics, which states that a system can be kept arbitrarily close to the instantaneous ground state of its Hamiltonian if the latter varies in time…
We consider quantum field theoretic systems subject to a time-dependent perturbation, and discuss the question of defining a time dependent particle number not just at asymptotic early and late times, but also during the perturbation.…