A quantum walk over randomly sampled subset pairs yields a worst-case O~(n^{2k/7}) algorithm for k-SUM and an O^*(2^{2n/7}) algorithm for Subset Sum.
Exact Weight Subgraphs and the k -Sum Conjecture
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improved Quantum Algorithms for Subset Sum and $k$-SUM
A quantum walk over randomly sampled subset pairs yields a worst-case O~(n^{2k/7}) algorithm for k-SUM and an O^*(2^{2n/7}) algorithm for Subset Sum.