Simple proof of equivalence between adiabatic quantum computation and the circuit model
Ari Mizel, Daniel A. Lidar, Morgan W. Mitchell
Abstract
Ari Mizel, Daniel A. Lidar, Morgan W. Mitchell
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.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Adiabatic process, Computation, Adiabatic quantum computation, Equivalence (formal languages), Quantum computer, Quantum circuit, Quantum, Simple (philosophy)