Related papers: Why the Quantitative Condition Fails to Reveal Qua…
We propose analog counterdiabatic quantum computing (ACQC) to tackle combinatorial optimization problems on neutral-atom quantum processors. While these devices allow for the use of hundreds of qubits, adiabatic quantum computing struggles…
Modern adiabatic quantum computers (AQC) are already used to solve difficult combinatorial optimisation problems in various domains of science. Currently, only a few applications of AQC in computer vision have been demonstrated. We review…
Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $\epsilon$ in Heisenberg-limited time $T=\Theta(1/\epsilon)$. Standard gate-based implementations of QPE require…
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…
We analyze the validity of the adiabatic approximation, and in particular the reliability of what has been called the "standard criterion" for validity of this approximation. Recently, this criterion has been found to be insufficient. We…
A nonadiabatic-transition system which exhibits ``quantum chaotic'' behavior [Phys. Rev. E {\bf 63}, 066221 (2001)] is investigated from quasi-classical aspects. Since such a system does not have a naive classical limit, we take the mapping…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
This paper is devoted to a generalisation of the quantum adiabatic theorem to a nonlinear setting. We consider a Hamiltonian operator which depends on the time variable and on a finite number of parameters and acts on a separable Hilbert…
We prove that quantum random access code (QRAC) performs better than its classical counterpart only when incompatible quantum measurements are used in the decoding task. As a consequence, evaluating the average success probability for QRAC…
We prove a robust extension of the quantum adiabatic theorem. The theorem applies to systems that have resonances instead of bound states, and to systems for which just an approximation to a bound state is known. To demonstrate the…
Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. The association step naturally leads to discrete optimization problems. As these optimization…
Adiabatic gauge potential is the origin of nonadiabatic transitions. In counterdiabatic driving, which is a method of shortcuts to adiabaticity, adiabatic gauge potential can be used to realize identical dynamics to adiabatic time evolution…
We numerically study quantum adiabatic algorithm for the propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows…
An explicit algorithm for the travelling salesman problem is constructed in the framework of adiabatic quantum computation, AQC. The initial Hamiltonian for the AQC process admits canonical coherent states as the ground state, and the…
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…
The performance of open-system quantum annealing is adversely affected by thermal excitations out of the ground state. While the presence of energy gaps between the ground and excited states suppresses such excitations, error correction…
In this paper we show that the performance of the quantum adiabatic algorithm is determined by phase transitions in underlying problem in the presence of transverse magnetic field $\Gamma$. We show that the quantum version of random…
The adiabatic theorem and "shortcuts to adiabaticity" for the adiabatic dynamics of time-dependent decoherence-free subspaces are explored in this paper. Starting from the definition of the dynamical stable decoherence-free subspaces, we…
Quantum adiabatic evolution, an important fundamental concept inphysics, describes the dynamical evolution arbitrarily close to the instantaneous eigenstate of a slowly driven Hamiltonian. In most systems undergoing spontaneous…
We consider quantum dynamics for which the strict adiabatic approximation fails but which do not escape too far from the adiabatic limit. To treat these systems we introduce a generalisation of the time dependent wave operator theory which…