Optimality of partial adiabatic search and its circuit model


In this paper, we first uncover a fact that a partial adiabatic quantum search with O( √ N/M) time complexity is in fact optimal, in which N is the total number of elements in an unstructured database, and M(M ≥ 1) of them are the marked ones(one) (N M). We then discuss how to implement a partial adiabatic search algorithm on the quantum circuit model. From… (More)
DOI: 10.1007/s11128-014-0770-6


  • Presentations referencing similar topics