Related papers: Accuracy vs run time in adiabatic quantum search
Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discrete-time model of quantum computation, it also holds for continuous-time (or…
This paper researches how the systematic errors in phase inversions affect the success rate and the number of iterations in optimized quantum random-walk search algorithm. Through geometric description of this algorithm, the model of the…
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…
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…
Designing quantum algorithms with a speedup over their classical analogs is a central challenge in quantum information science. Motivated by recent experimental observations of a superlinear quantum speedup in solving the Maximum…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
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 prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The…
We analyze the complexity of the quantum optimization algorithm based on adiabatic evolution for the set partition problem. We introduce a cost function defined on a logarithmic scale of the partition residues so that the total number of…
Results are presented of a large-scale simulation of the quantum adiabatic search (QuAdS) algorithm in the presence of noise. The algorithm is applied to the NP-Complete problem Exact Cover 3 (EC3). The noise is assumed to Zeeman-couple to…
An explicit proof is developed to reinforce the accuracy of the quantum adiabatic theorem in its original form without any inconsistency and/or violation. Based on this proof, we discuss physical implications that give rise to the violation…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
We provide rigorous bounds for the error of the adiabatic approximation of quantum mechanics under four sources of experimental error: perturbations in the initial condition, systematic time-dependent perturbations in the Hamiltonian,…
We discuss the energetic cost of superadiabatic models of quantum computation. Specifically, we investigate the energy-time complementarity in general transitionless controlled evolutions and in shortcuts to the adiabatic quantum search…
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is…
We introduce the idea of using adiabatic rotation to generate superpositions of a large class of quantum states. For quantum computing this is an interesting alternative to the well-studied "straight line" adiabatic evolution. In ways that…
Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance continuous-time quantum walk algorithms as…
The evaluation of the performance of adiabatic annealers is hindered by lack of efficient algorithms for simulating their behaviour. We exploit the analyticity of the standard model for the adiabatic quantum process to develop an efficient…
Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [Phys. Rev. A 65, 062310 (2002)]. This adiabatic algorithm gives rise to a quadratic speed up over classical algorithms. We show that a modified…
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native…