Improved Classical and Quantum Algorithms for Subset-Sum

by   Xavier Bonnetain, et al.

We present new classical and quantum algorithms for solving random subset-sum instances. First, we improve over the Becker-Coron-Joux algorithm (EUROCRYPT 2011) from Õ(2^0.291 n) downto Õ(2^0.283 n), using more general representations with values in {-1,0,1,2}. Next, we improve the state of the art of quantum algorithms for this problem in several directions. By combining the Howgrave-Graham-Joux algorithm (EUROCRYPT 2010) and quantum search, we devise an algorithm with asymptotic cost Õ(2^0.236 n), lower than the cost of the quantum walk based on the same classical algorithm proposed by Bernstein, Jeffery, Lange and Meurer (PQCRYPTO 2013). This algorithm has the advantage of using classical memory with quantum random access, while the previously known algorithms used the quantum walk framework, and required quantum memory with quantum random access. We also propose new quantum walks for subset-sum, performing better than the previous best time complexity of Õ(2^0.226 n) given by Helm and May (TQC 2018). We combine our new techniques to reach a time Õ(2^0.216 n). This time is dependent on a heuristic on quantum walk updates, formalized by Helm and May, that is also required by the previous algorithms. We show how to partially overcome this heuristic, and we obtain an algorithm with quantum time Õ(2^0.218 n) requiring only the standard classical subset-sum heuristics.


page 1

page 2

page 3

page 4


Improved quantum algorithm for the random subset sum problem

We propose a quantum algorithm for solving random subset sum instances w...

Improved Low-qubit Hidden Shift Algorithms

Hidden shift problems are relevant to assess the quantum security of var...

Quantum algorithm for finding minimum values in a Quantum Random Access Memory

Finding the minimum value in an unordered database is a common and funda...

Quantum speedup of branch-and-bound algorithms

Branch-and-bound is a widely used technique for solving combinatorial op...

Generalized Quantum Google PageRank Algorithm with Arbitrary Phase Rotations

The quantization of the PageRank algorithm is a promising tool for a fut...

The Elephant Quantum Walk

We explore the impact of long-range memory on the properties of a family...

Improved Quantum Information Set Decoding

In this paper we present quantum information set decoding (ISD) algorith...

Please sign up or login with your details

Forgot password? Click here to reset