Adversary lower bound for the k-sum problem

Authors:
Aleksandrs Belovs;Robert Spalek
Affiliations:
University of Latvia, Riga, Latvia;Google Inc., Mountain View, CA, USA
Venue:
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Year:
2013

Citing 13
Cited 0

Quantum lower bounds by polynomials

Journal of the ACM (JACM)
Complexity measures and decision tree complexity: a survey

Theoretical Computer Science - Complexity and logic
Quantum lower bounds by quantum arguments

Journal of Computer and System Sciences - Special issue on STOC 2000
Polynomial Degree vs. Quantum Query Complexity

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Quantum lower bounds for the collision and the element distinctness problems

Journal of the ACM (JACM)
On the power of Ambainis lower bounds

Theoretical Computer Science
Negative weights make adversaries stronger

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Quantum Walk Algorithm for Element Distinctness

SIAM Journal on Computing
Quantum algorithms for subset finding

Quantum Information & Computation
Merkle puzzles in a quantum world

CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Quantum Query Complexity of State Conversion

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Reflections for quantum query algorithms

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Learning-Graph-Based Quantum Algorithm for k-Distinctness

FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove a tight quantum query lower bound Omega(nk/(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.