• Corpus ID: 16467419

Quantum Computation by Adiabatic Evolution

  title={Quantum Computation by Adiabatic Evolution},
  author={Edward Farhi and Jeffrey Goldstone and Sam Gutmann and Michael Sipser},
  journal={arXiv: Quantum Physics},
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, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on… 
A ug 2 00 2 Quantum Adiabatic Evolution Algorithms with Different Paths
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground
Learning adiabatic quantum algorithms for solving optimization problems
A technique to learn the encoding of a given optimization problem into a problem Hamiltonian and the convergence of the algorithm is presented and the output of the proposed algorithm can be used to learn efficient adiabatic algorithms from examples.
Adiabatic Quantum Computing : An Overview
Quantum computations can be implemented not only by the action of quantum circuits, but by the adiabatic evolution of a system’s Hamiltonian. This can be done by initializing the system into the
A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability
Numerical results on randomly generated instances of an NP-complete problem and of a problem that can be solved classically in polynomial time are presented.
Approximability of Optimization Problems through Adiabatic Quantum Computation
This book investigates the computational simulation of AQC algorithms applied to the MAX-SAT problem and shows that every monadic second-order logic (MSOL) expression has associated pseudo-Boolean maps that can be obtained by expanding the given expression, and also can be reduced to quadratic forms.
Path Independence in Adiabatic Quantum Computing for Hadamard Gate
The variational method is used to find an optimized path for the simplest case involving a single qubit and for the most general path involving one or more independent interpolating functions, which shows that in these two scenarios the authors can choose an arbitrary path provided that it satisfies the boundary conditions.
From quantum circuits to adiabatic algorithms
  • M. Siu
  • Physics, Computer Science
  • 2005
This paper shows a way that directly maps any arbitrary circuit in the standard quantum-computing model to an adiabatic algorithm of the same depth and looks for a smooth time-dependent Hamiltonian whose unique ground state slowly changes from the initial state of the circuit to its final state.
Entangling problem Hamiltonian for adiabatic quantum computation
Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian, $H_{\rm p}$, is
The quantum adiabatic optimization algorithm and local minima
It is proved that for a constant range of values for the transverse field, the spectral gap is exponentially small in the sector length, and there are exponentially many eigenvalues all exponentially close to the ground state energy.
Quantum Adiabatic Evolution with a Special Kind of Interpolating Paths
We study a special kind of interpolating paths in quantum adiabatic search algorithms. With this special kind of adiabatic paths, notably we find that even when the parameter n within it tends to


Analog analogue of a digital quantum computation
We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system with a Hamiltonian of the form $E|w〉〈w|$ where $|w〉$
Strengths and Weaknesses of Quantum Computing
It is proved that relative to an oracle chosen uniformly at random with probability 1 the class $\NP$ cannot be solved on a quantum Turing machine (QTM) in time $o(2^{n/2})$.
A fast quantum mechanical algorithm for database search
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
Universal Quantum Simulators
Feynman's 1982 conjecture, that quantum computers can be programmed to simulate any local quantum system, is shown to be correct.
Quantum mechanics
Quantum Mechanics for Organic Chemists.By Howard E. Zimmerman. Pp. x + 215. (Academic: New York and London, May 1975.) $16.50; £7.90.
Strengths and Weaknesses of Quantum Computing ” Universal Quantum Simulators ”
  • Phys . Rev . A
  • 1998
Strengths and Weaknesses of Quantum Computing ” Universal Quantum Simulators ”
  • Phys . Rev . A
  • 1998
An Analog Analogue of a Digital Quantum Computation ” , quant - ph / 9612026
  • Phys . Rev . Lett .
  • 1997
An Analog Analogue of a Digital Quantum Computation ” , quantph / 9612026
  • Phys . Rev . Lett .
  • 1997