Geometric Characterization of Quantum Oracle Identification(New Trends in Theory of Computation and Algorithm)
Akinori Kawachi, Shigeru Yamashita · Institutional Repositories DataBase (IRDB) · 2006
We geometrically characterize the query complexity of the oracle identification prob- lem in this paper.By defining an inner product between two oracles, we construct a quantum algo- rithm, which generalizes Bemstein-Vazirani and Grover algorithms, for a certain class of the oracle identification problem characterized by the inner product.We also show the optimality of this quantum algorithm.