### 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 | English (US) |
---|---|

Title of host publication | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |

Pages | 42-51 |

Number of pages | 10 |

Publication status | Published - 2004 |

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

### Other

Other | Proceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 |
---|---|

Country | Italy |

City | Rome |

Period | 10/17/04 → 10/19/04 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS*(pp. 42-51)