How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory?
- 153 Downloads
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the efficiency in solving the integer factoring and searching a database faster than any currently known classical computer algorithm. Adiabatic evolution of quantum systems have been studied as a potential means that physically realizes such quantum computation. Up to now, all the research on adiabatic quantum systems has dealt with polynomial time-bounded computation and little attention has been paid to, for example, adiabatic quantum systems consuming only constant memory space. Such quantum systems can be modeled in a form similar to quantum finite automata. This exposition dares to ask a bold question of how to make adiabatic quantum computation fit into the rapidly progressing framework of quantum automata theory. As our answer to this eminent but profound question, we first lay out a basic framework of adiabatic evolutionary quantum systems (AEQSs) with limited computational resources and then establish their close connection to quantum finite automata. We also explore fundamental structural properties of languages solved quickly by such adiabatic evolutionary quantum systems.
KeywordsAdiabatic quantum computation Quantum finite automata Hamiltonian Schrödinger equation
- 3.Ambainis, A., Yakaryilmaz, A.S.: Automata and quantum computing. CoRR abs/1507.01988 (2015). https://arxiv.org/abs/1507.01988
- 4.Dam van, W., Mosca, M., Vazirani, U.: How powerful is adiabatic quantum computation? In: Proceedings of 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, pp. 279–287. IEEE Computer Society (2001). https://doi.org/10.1109/SFCS.2001.959902
- 6.Farhi, E., Goldstone, J., Gutmann, S., Sipser., M.: Quantum computation by adiabatic evolution. CoRR abs/quant-ph/0001106 (2000). https://arxiv.org/abs/quant-ph/0001106
- 8.Gruska, J.: Quantum Computing. McGraw-Hill (2000)Google Scholar
- 14.Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)Google Scholar
- 16.Yamakami, T.: Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice. In: Martín-Vide, C., Okhotin, A., Shapira, D. (eds.) LATA 2019. LNCS, vol. 11417, pp. 134–145. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-13435-8_10CrossRefGoogle Scholar