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


Ambainis, Andris ; Iraids, Janis ; Smotrovs, Juris

Exact Quantum Query Complexity of EXACT and THRESHOLD

pdf-format:
32.pdf (0.4 MB)


Abstract

A quantum algorithm is exact if it always produces the correct answer, on any input. Coming up with exact quantum algorithms that substantially outperform the best classical algorithm has been a quite challenging task. In this paper, we present two new exact quantum algorithms for natural problems: - for the problem EXACT_k^n in which we have to determine whether the sequence of input bits x_1, ..., x_n contains exactly k values x_i=1; - for the problem THRESHOLD_k^n in which we have to determine if at least k of n input bits are equal to 1.

BibTeX - Entry

@InProceedings{ambainis_et_al:LIPIcs:2013:4326,
  author =	{Andris Ambainis and Janis Iraids and Juris Smotrovs},
  title =	{{Exact Quantum Query Complexity of EXACT and THRESHOLD}},
  booktitle =	{8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)},
  pages =	{263--269},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-55-2},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{22},
  editor =	{Simone Severini and Fernando Brandao},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4326},
  URN =		{urn:nbn:de:0030-drops-43261},
  doi =		{10.4230/LIPIcs.TQC.2013.263},
  annote =	{Keywords: Quantum query algorithms, Complexity of Boolean functions}
}

Keywords: Quantum query algorithms, Complexity of Boolean functions
Seminar: 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)
Issue Date: 2013
Date of publication: 05.11.2013


DROPS-Home | Fulltext Search | Imprint Published by LZI