Adversary Lower Bound for the k-sum Problem [article]

Aleksandrs Belovs, Robert Spalek
2012 arXiv   pre-print
We prove a tight quantum query lower bound Ω(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.
arXiv:1206.6528v2 fatcat:epzhatctw5hmhdrrekebgdcfsi