Related papers: Faster annealing schedules for quantum annealing
We develop a scheme of fast forward of adiabatic spin dynamics of quantum entangled states. We settle the quasi-adiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with use of a large…
We propose a novel method for reducing the number of variables in quadratic unconstrained binary optimization problems, using a quantum annealer (or any sampler) to fix the value of a large portion of the variables to values that have a…
The solution of linear systems of equations is the basis of many other quantum algorithms, and recent results provided an algorithm with optimal scaling in both the condition number $\kappa$ and the allowable error $\epsilon$ [PRX Quantum…
We consider the optimal driving of the ground state of a many-body quantum system across a quantum phase transition in finite time. In this context, excitations caused by the breakdown of adiabaticity can be minimized by adjusting the…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
Using a specially constructed set of hard 2-SAT problems with four satisfying assignments, we study the scaling and sampling performance of numerical simulation of quantum annealing as well as that of the physical quantum annealers offered…
Using Schwinger Variational Principle we solve the problem of quantum harmonic oscillator with time dependent frequency. Here, we do not take the usual approach which implicitly assumes an adiabatic behavior for the frequency. Instead, we…
We formulate and analyze a double-slit proposal for quantum annealing, which involves observing the probability of finding a two-level system (TLS) undergoing evolution from a transverse to a longitudinal field in the ground state at the…
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition…
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…
An ansatz describing in terms of formal asymptotic decompositions a leading term of asymptotics of the $n$ three-dimensional like-charged quantum particles scattering problem solution is suggested. The description of the solution in those…
The Quantum Approximate Optimization Algorithm (QAOA) is a leading approach for combinatorial optimization on near-term quantum devices, yet its scalability is limited by the difficulty of optimizing \(2p\) variational parameters for a…
Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct…
We review recent results concerning the exponential behaviour of transition probabilities across a gap in the adiabatic limit of the time-dependent Schr\"odinger equation. They range from an exponential estimate in quite general situations…
The viability of adiabatic quantum computation depends on the slow evolution of the Hamiltonian. The adiabatic switching theorem provides an asymptotic series for error estimates in $1/T$, based on the lowest non-zero derivative of the…
We introduce an adiabatic long-range quantum communication proposal based on a quantum dot array. By adiabatically varying the external gate voltage applied on the system, the quantum information encoded in the electron can be transported…
Quantum Annealing (QA) is one of the most promising frameworks for quantum optimization. Here, we focus on the problem of minimizing complex classical cost functions associated with prototypical discrete neural networks, specifically the…
We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time…
We consider a composite open quantum system consisting of a fast subsystem coupled to a slow one. Using the time-scale separation, we develop an adiabatic elimination technique to derive at any order the reduced model describing the slow…
Quantum annealing has shown significant potential as an approach to near-term quantum computing. Despite promising progress towards obtaining a quantum speedup, quantum annealers are limited by the need to embed problem instances within the…