TY - JOUR
T1 - Oracles with Costs
JF - 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)
Y1 - 2015
A1 - Shelby Kimmel
A1 - Cedric Yen-Yu Lin
A1 - Han-Hsuan Lin
AB - While powerful tools have been developed to analyze quantum query complexity, there are still many natural problems that do not fit neatly into the black box model of oracles. We create a new model that allows multiple oracles with differing costs. This model captures more of the difficulty of certain natural problems. We test this model on a simple problem, Search with Two Oracles, for which we create a quantum algorithm that we prove is asymptotically optimal. We further give some evidence, using a geometric picture of Grover's algorithm, that our algorithm is exactly optimal.
VL - 44
U4 - 1-26
SN - 978-3-939897-96-5
UR - http://arxiv.org/abs/1502.02174
U5 - 10.4230/LIPIcs.TQC.2015.1
ER -