Speedup in adiabatic evolution based quantum algorithms
- 112 Downloads
In this context, we study three different strategies to improve the time complexity of the widely used adiabatic evolution algorithms when solving a particular class of quantum search problems where both the initial and final Hamiltonians are one-dimensional projector Hamiltonians on the corresponding ground state. After some simple analysis, we find the time complexity improvement is always accompanied by the increase of some other “complexities” that should be considered. But this just gives the implication that more feasibilities can be achieved in adiabatic evolution based quantum algorithms over the circuit model, even though the equivalence between the two has been shown. In addition, we also give a rough comparison between these different models for the speedup of the problem.
Keywordsadiabatic evolution evolution paths quantum computing
Unable to display preview. Download preview PDF.
- 2.Messiah A. Quantum Mechanics. New York: Dover Publications, 1999Google Scholar
- 12.Farhi E, Goldstone J, Gutmann S. Quantum adiabatic evolution algorithms with different paths. arXiv:quant-ph/0208135Google Scholar
- 13.van Dam W, Mosca M, Vazirani U. How powerful is adiabatic quantum computation? In: Proceedings of the 42th Ann. Symp. Foundations of Computer Science (FOCS’01). Las Vegas: IEEE Computer Society, 2001. 279–287Google Scholar
- 14.van Dam W, Vazirani U. Limits on quantum adiabatic optimization. Available at http://www.cs.berkeley.edu/vazirani/pubs/qao.ps
- 15.Choi V. Avoid first order quantum phase transition by changing problem Hamiltonians. arXiv:quant-ph/1010.1220Google Scholar