Recognition: unknown
Exact Equivalence between Quantum Adiabatic Algorithm and Quantum Circuit Algorithm
classification
🪐 quant-ph
keywords
quantumalgorithmadiabaticcircuitcomplexityexacttimeadditionally
read the original abstract
We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of $L$ gates we can construct a quantum adiabatic algorithm with time complexity of $O(L)$. Additionally, our construction shows that one may exponentially speed up some quantum adiabatic algorithms by properly choosing an evolution path.
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.