Simple proof of equivalence between adiabatic quantum computation and the circuit model
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:M66JIAUIrecord.jsonopen to challenge →
classification
quant-ph
keywords
computationadiabaticquantumcircuitequivalencemodelprocedureamount
read the original abstract
We 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.