Adversary Lower Bound for the k-sum Problem

Aleksandrs Belovs; Robert Spalek

Adversary Lower Bound for the k-sum Problem

Quantum Physics 2012-08-13 v2 Computational Complexity

Authors: Aleksandrs Belovs , Robert Spalek

Abstract

We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an extended and simplified version of an earlier preprint of one of the authors arXiv:1204.5074.

Keywords

quantum state discrimination

Cite

@article{arxiv.1206.6528,
  title  = {Adversary Lower Bound for the k-sum Problem},
  author = {Aleksandrs Belovs and Robert Spalek},
  journal= {arXiv preprint arXiv:1206.6528},
  year   = {2012}
}

Comments

10 pages, minor changes in v2. Extended and simplified version of an earlier preprint of one of the authors arXiv:1204.5074

Adversary Lower Bound for the k-sum Problem

Abstract

Keywords

Cite

Comments

Related papers