License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2015.1
URN: urn:nbn:de:0030-drops-55459
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5545/
Go to the corresponding LIPIcs Volume Portal


Kimmel, Shelby ; Lin, Cedric Yen-Yu ; Lin, Han-Hsuan

Oracles with Costs

pdf-format:
1.pdf (0.8 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{kimmel_et_al:LIPIcs:2015:5545,
  author =	{Shelby Kimmel and Cedric Yen-Yu Lin and Han-Hsuan Lin},
  title =	{{Oracles with Costs}},
  booktitle =	{10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)},
  pages =	{1--26},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-96-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{44},
  editor =	{Salman Beigi and Robert Koenig},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5545},
  URN =		{urn:nbn:de:0030-drops-55459},
  doi =		{10.4230/LIPIcs.TQC.2015.1},
  annote =	{Keywords: Quantum Algorithms, Query Complexity, Amplitude Amplification}
}

Keywords: Quantum Algorithms, Query Complexity, Amplitude Amplification
Seminar: 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)
Issue Date: 2015
Date of publication: 28.10.2015


DROPS-Home | Fulltext Search | Imprint Published by LZI