Preprint
Aug 2026
Improved Quantum Algorithms for Subset Sum and $k$-SUM
A new quantum algorithm solving worst-case $k-SUM in time $\widetilde O(n^{\Psi_k})$, which is not only faster for all $k$ congruent to $3$ or $6$ modulo $7, but also gives a worst-case guarantee rather than a guarantee restricted to single-solution random instances.
N. Chukhin, Alexander S. Kulikov, Maksim Levitskii et al.
· 1 citation