Improved quantum algorithm for the random subset sum problem

Abstract

Solving random subset sum instances plays an important role in constructing cryptographic systems. For the random subset sum problem, in 2013 Bernstein et al. proposed a quantum algorithm with heuristic time complexity $\tilde{O}(2^{0.241n})$, where the "$\tilde{O}$" symbol is used to omit poly($\log n$) factors. In 2018, Helm and May proposed another quantum algorithm that reduces the heuristic time and memory complexity to $\tilde{O}(2^{0.226n})$. In this paper, a new quantum algorithm is proposed, with heuristic time and memory complexity $\tilde{O}(2^{0.209n})$.

arXiv admin note: text overlap with arXiv:1907.04295 by other authors

Cited by in corpus (1)

• Number Partitioning with Grover's Algorithm in Central Spin Systems