Simple proof of equivalence between adiabatic quantum computation and the circuit model

Simple item page
dc.creatorMizel, Ari
dc.creatorLidar, Daniel A.
dc.creatorMitchell, Morgan
dc.date2006-09-08
dc.date2007-02-26
dc.date.accessioned2026-07-07T08:27:39Z
dc.date.available2026-07-07T08:27:39Z
dc.descriptionWe 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 amount of time needed is evaluated by computing the gap. We show that the procedure is computationally efficient.
dc.description5 pages, 2 figures. v2: improved gap estimates and added some more details
dc.identifierhttps://arxiv.org/abs/quant-ph/0609067
dc.identifierhttp://arxiv.org/abs/quant-ph/0609067
dc.identifierPhys. Rev. Lett. 99, 070502 (2007)
dc.identifierdoi:10.1103/PhysRevLett.99.070502
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137342
dc.subjectQuantum Physics
dc.titleSimple proof of equivalence between adiabatic quantum computation and the circuit model
dc.typetext

Files

Collections

arXiv