Adiabatic quantum computation is equivalent to standard quantum computation

@article{Aharonov2004AdiabaticQC,
  title={Adiabatic quantum computation is equivalent to standard quantum computation},
  author={Dorit Aharonov and Wim van Dam and Julia Kempe and Zeph Landau and Seth Lloyd and Oded Regev},
  journal={45th Annual IEEE Symposium on Foundations of Computer Science},
  year={2004},
  pages={42-51}
}
  • D. Aharonov, W. V. Dam, O. Regev
  • Published 18 May 2004
  • Physics, Computer Science
  • 45th Annual IEEE Symposium on Foundations of Computer Science
The model of adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its exact computational power has been unknown. We settle this question and describe an efficient adiabatic simulation of any given quantum algorithm. This implies that the adiabatic computation model and the standard quantum circuit model are polynomially equivalent. We also describe an extension of this result with implications to physical implementations of… 

Figures and Tables from this paper

Adiabatic Quantum Computation and Simulation

TLDR
This work has shown that the adiabatic approach to quantum computing has had dramatic up and downturns as a viable way to approach quantum computing, along with related controversy regarding the consistency of the aduabatic theorem.

Exact Equivalence between Quantum Adiabatic Algorithm and Quantum Circuit Algorithm

We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of

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

Realizations of standard quantum computational circuits by adiabatic evolution

We study the adiabatic equivalent of the standard quantum circuit of elementary logic operators. We propose a scheme for constructing time variations of the Hamiltonian. This scheme can be

On the Circuit Model of Global Adiabatic Search Algorithm

Local adiabatic search has been implemented on the quantum circuit model, and the time steps necessary to guarantee the approximation precision are of the same order as the time complexity of the

From quantum circuits to adiabatic algorithms

  • M. Siu
  • Physics, Computer Science
  • 2005
TLDR
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.

Proof of efficient, parallelized, universal adiabatic quantum computation

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

Solving the Hamiltonian Cycle Problem using a Quantum Computer

TLDR
A QUBO (quadratic unconstrained binary optimization) formulation is presented, which is suitable for the adiabatic quantum computation for a D-Wave architecture and a physical Hamiltonian is derived from the QUBO formulation and its adequateness in the aduabatic framework is discussed.

Quantum Computing

  • E. Rieffel
  • Computer Science, Physics
    The Quantum Internet
  • 2021
TLDR
The quantum information processing viewpoint provides insight into classical algorithmic issues as well as a deeper understanding of entanglement and other non-classical aspects of quantum physics.
...

References

SHOWING 1-10 OF 68 REFERENCES

From quantum circuits to adiabatic algorithms

  • M. Siu
  • Physics, Computer Science
  • 2005
TLDR
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.

Experimental implementation of an adiabatic quantum optimization algorithm.

TLDR
A nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm that agrees well with the prediction of a simple decoherence model is reported.

How powerful is adiabatic quantum computation?

TLDR
It is argued that the adiabatic approach may be thought of as a kind of 'quantum local search', and a family of minimization problems that is hard for such local search heuristics are designed, and an exponential lower bound is established for the ad iabatic algorithm for these problems.

A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

TLDR
For the small examples that the authors could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.

Noise resistance of adiabatic quantum computation using random matrix theory

TLDR
A fully analytical study of the resistance to noise of quantum algorithms using perturbation theory combined with a theoretical noise model based on random matrices drawn from the Gaussian orthogonal ensemble, whose elements vary in time and form a stationary random process.

Adiabatic quantum computation in open systems.

TLDR
An inherently open-systems approach is introduced, based on a recent generalization of the adiabatic approximation, that shows that a system may initially be in an adiAbatic regime, but then undergo a transition to a regime where adiABaticity breaks down.

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

Geometric quantum computation

Abstract We describe in detail a general strategy for implementing a conditional geometric phase between two spins. Combined with single-spin operations, this simple operation is a universal gate for

Quantum Computation by Adiabatic Evolution

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

The quantum adiabatic optimization algorithm and local minima

TLDR
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.
...