Related papers: Quantum Adiabatic Evolution Algorithms versus Simu…
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in an NMR quantum information processor and experimentally factorize the number 21. Numerical…
We present two new continuous time quantum search algorithms similar to the adiabatic search algorithm, but now without an adiabatic evolution. We find that both algorithms work for a wide range of values of the parameters of the…
In this paper we analyze the performance of the Quantum Adiabatic Evolution algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, $\gamma=M/N$. We introduce a…
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…
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 decompose the quantum adiabatic evolution as the products of gauge invariant unitary operators and obtain the exact nonadiabatic correction in the adiabatic approximation. A necessary and sufficient condition that leads to adiabatic…
Perturbed Hamming weight problems serve as examples of optimization instances for which the adiabatic algorithm provably out performs classical simulated annealing. In this work we study the efficiency of the adiabatic algorithm for solving…
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…
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…
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…
We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, $\alpha$, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a…
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an…
Quantum adiabatic evolution is a dynamical evolution of a quantum system under slow external driving. According to the quantum adiabatic theorem, no transitions occur between non-degenerate instantaneous eigen-energy levels in such a…
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…
Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the…
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…
Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the…
A proof of the adiabatic theorem for quantum systems whose time evolution proceeds along discrete time, e.g., quantum maps and quantum circuits, is shown.
We show that, during adiabatic evolution, any changes in entanglement can be attributed to a succession of avoided energy level crossings at which eigenvalues swap their eigenvectors. These swaps mediate the generation and redistribution of…
We describe a quantum algorithm that solves combinatorial optimization problems by quantum simulation of a classical simulated annealing process. Our algorithm exploits quantum walks and the quantum Zeno effect induced by evolution…