Related papers: Quantum computation in continuous time using dynam…
Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided…
We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is…
Cavity magnomechanics provides a readily-controllable hybrid system, that consisted of cavity mode, magnon mode, and phonon mode, for quantum state manipulation. To implement a fast-and-robust state transfer between the hybrid photon-magnon…
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…
Time evolution of quantum systems is accelerated by the fast-forward scaling. We reformulate the method to study systems in a finite-dimensional Hilbert space. For several simple systems, we explicitly construct the acceleration potential.…
We propose a new variational quantum algorithm, which we refer to as TIMES-ADAPT, that prepares time-evolved states in a low-energy or symmetric subspace of a time-independent Hamiltonian on a quantum computer. Using a specially trained…
We provide model reduction formulas for open quantum systems consisting of a target component which weakly interacts with a strongly dissipative environment. The time-scale separation between the uncoupled dynamics and the interaction…
Many claims of computational advantages have been made for quantum computing over classical, but they have not been demonstrated for practical problems. Here, we present algorithms for solving time-dependent PDEs, with particular reference…
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 give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian,…
The capacity for solving eigenstates with a quantum computer is key for ultimately simulating physical systems. Here we propose inverse iteration quantum eigensolvers, which exploit the power of quantum computing for the classical inverse…
Applying time-dependent driving is a basic way of quantum control. Driven systems show various dynamics as its time scale is changed due to the different amount of nonadiabatic transitions. The fast-forward scaling theory enables us to…
The state of an open quantum system undergoing an adiabatic process evolves by following the instantaneous stationary state of its time-dependent generator. This observation allows one to characterize, for a generic adiabatic evolution, the…
Properly designed control has been shown to be particularly advantageous for improving AQC accuracy and time complexity scaling. Here, an \emph{in situ} quantum control optimization protocol is developed to indirectly optimize state…
Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of…
We present a 2-local quantum algorithm for graph isomorphism GI based on an adiabatic protocol. By exploiting continuous-time quantum-walks, we are able to avoid a mere diffusion over all possible configurations and to significantly reduce…
Recent experiments show the existence of collective decoherence in quantum systems. We study the possibility of quantum computation in decoherence free subspace which is robust against such kind of decoherence processes. This passive…
The "fast-forward" approach by Masuda and Nakamura generates driving potentials to accelerate slow quantum adiabatic dynamics. First we present a streamlined version of the formalism that produces the main results in a few steps. Then we…
We consider a classical and superadiabatic version of an iterative quantum adiabatic algorithm to solve combinatorial optimization problems. This algorithm is deterministic because it is based on purely classical dynamics, that is, it does…
Adiabatic quantum gate implementation generally takes longer time, which is disadvantageous in view of decoherence. In this report we implement several essential one-qubit quantum gates nonadiabatically by making use of a dynamical…