License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2021.6
URN: urn:nbn:de:0030-drops-140013
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14001/
Go to the corresponding LIPIcs Volume Portal

Ambainis, Andris ; Balodis, Kaspars ; Iraids, Jānis

A Note About Claw Function with a Small Range

pdf-format:
LIPIcs-TQC-2021-6.pdf (0.5 MB)

Abstract

In the claw detection problem we are given two functions f:D → R and g:D → R (|D| = n, |R| = k), and we have to determine if there is exist x,y ∈ D such that f(x) = g(y). We show that the quantum query complexity of this problem is between Ω(n^{1/2}k^{1/6}) and O(n^{1/2+ε}k^{1/4}) when 2 ≤ k < n.

BibTeX - Entry

@InProceedings{ambainis_et_al:LIPIcs.TQC.2021.6,
  author =	{Ambainis, Andris and Balodis, Kaspars and Iraids, J\={a}nis},
  title =	{{A Note About Claw Function with a Small Range}},
  booktitle =	{16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
  pages =	{6:1--6:5},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-198-6},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{197},
  editor =	{Hsieh, Min-Hsiu},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14001},
  URN =		{urn:nbn:de:0030-drops-140013},
  doi =		{10.4230/LIPIcs.TQC.2021.6},
  annote =	{Keywords: collision, claw, quantum query complexity}
}

Keywords: collision, claw, quantum query complexity
Collection: 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
Issue Date: 2021
Date of publication: 22.06.2021

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI