## Abstract

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 adiabatic computation. We believe that our result highlights the potential importance of the adiabatic computation model in the design of quantum algorithms and in their experimental realization.

Original language | American English |
---|---|

Pages (from-to) | 42-51 |

Number of pages | 10 |

Journal | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |

State | Published - 2004 |

Event | Proceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 - Rome, Italy Duration: 17 Oct 2004 → 19 Oct 2004 |