Abstract
Adiabatic quantum computation has been proposed as a quantum algorithm with adiabatic evolution to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Deutsch-Jozsa problem more efficiently by a method with higher observation probability. © 2013 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Nakayama, S., & Gang, P. (2013). Study on adiabatic quantum computation in Deutsch-Jozsa problem. In Studies in Computational Intelligence (Vol. 492, pp. 25–35). Springer Verlag. https://doi.org/10.1007/978-3-319-00738-0_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
