Related papers: Hamiltonian engineering for adiabatic quantum comp…
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand…
We illustrate the adiabatic quantum computing solution of the knapsack problem with both integer profits and weights. For problems with $n$ objects (or items) and integer capacity $c$, we give specific examples using both an Ising class…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
A computation in adiabatic quantum computing is implemented by traversing a path of nondegenerate eigenstates of a continuous family of Hamiltonians. We introduce a method that traverses a discretized form of the path: At each step we apply…
Achieving fast, excitation-free quantum control is a vital challenge in modern quantum technologies. In many cases, shortcuts to adiabaticity enable fast adiabatic-like protocols, yet determining control parameters that satisfy practical…
Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are…
Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic…
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present…
In this paper we discuss how we can design Hamiltonians to implement quantum algorithms, in particular we focus in Deutsch and Grover algorithms. As main result of this paper, we show how Hamiltonian inverse quantum engineering method allow…
Adiabatic state preparation provides an analytical solution for generating the ground state of a target Hamiltonian, starting from an easily prepared ground state of the initial Hamiltonian. While effective for time-dependent Hamiltonians…
In this paper, we study the role and relevance of the cost for an invariant-based shortcut to adiabaticity enabled qubit heat engine operates in a quantum Otto cycle. We consider a qubit heat engine with Landau-Zener Hamiltonian and improve…
Shortcuts to adiabaticity (STA) make the fast preparation of many-body states possible, circumventing the limitations of adiabatic strategies. We propose a fast STA protocol for generating interacting states in the Tomonaga-Luttinger liquid…
We study the assisted adiabatic passage, and equivalently the transitionless quantum driving, as a quantum brachistochrone trajectory. The optimal Hamiltonian for given constraints is constructed from the quantum brachistochrone equation.…
High control in the preparation and manipulation of states is an experimental and theoretical important task in many quantum protocols. Shortcuts to adiabaticity methods allow to obtain desirable states of a adiabatic dynamics but in short…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to…
We consider a finite-time quantum Otto cycle with single and two-spin-$1/2$ systems as its working medium. In order to mimic adiabatic dynamics at a finite-time, we employ a shortcut-to-adiabaticity technique and evaluate the performance of…
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…
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…
We present the formulation of the problem of the coherent dynamics of quantum mechanical two-level systems in the adiabatic region in terms of the differential geometry of plane curves. We show that there is a natural plane curve…