Related papers: A modified quantum adiabatic evolution for the Deu…

Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schr\"odinger's equation. In the former, the…

Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation…

We develop an approach to machine learning and anomaly detection via quantum adiabatic evolution. In the training phase we identify an optimal set of weak classifiers, to form a single strong classifier. In the testing phase we…

The adiabatic theorem in quantum mechanics implies that if a system is in a discrete eigenstate of a Hamiltonian and the Hamiltonian evolves in time arbitrarily slowly, the system will remain in the corresponding eigenstate of the evolved…

Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…

In quantum information processing, the development of fast and robust control schemes remains a central challenge. Although quantum adiabatic evolution is inherently robust against control errors, it typically demands long evolution times.…

Shortcuts to adiabaticity provide a general approach to mimic adiabatic quantum processes via arbitrarily fast evolutions in Hilbert space. For these counter-diabatic evolutions, higher speed comes at higher energy cost. Here, the…

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size $n$. We use as an example the…

A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough.…

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…

Quantum state preparation by adiabatic evolution is currently rendered ineffective by the long implementation times of the underlying quantum circuits, comparable to the decoherence time of present and near-term quantum devices. These…

We consider digitized-counterdiabatic quantum computing as an advanced paradigm to approach quantum advantage for industrial applications in the NISQ era. We apply this concept to investigate a discrete mean-variance portfolio optimization…

We present a general method for studying coupled qubits driven by adiabatically changing external parameters. Extended calculations are provided for a two-bit Hamiltonian whose eigenstates can be used as logical states for a quantum CNOT…

We present a new adiabatic quantum algorithm for searching over structured databases. The new algorithm is optimized using a simplified complexity analysis.

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,…

Transitions out of the ground space limit the performance of quantum adiabatic algorithms, while hardware imperfections impose stringent limitations on the circuit depth. We propose an adiabatic echo verification protocol which mitigates…

This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and…

We describe a general methodology for enhancing the efficiency of adiabatic quantum computations (AQC). It consists of homotopically deforming the original "Hamiltonian surface" in a way that the redistribution of the Gaussian curvature…

We propose a new variant of the controlled-NOT quantum logic gate based on adiabatic level-crossing dynamics of the q-bits. The gate has a natural implementation in terms of the Cooper pair transport in arrays of small Josephson tunnel…

In this paper, we present a generalisation of the Phase Kick-Back technique, which is central to some of the classical algorithms in quantum computing, such as the Deutsch--Jozsa algorithm, Simon's algorithm or Grover's algorithm. We will…