Abstract: Given a multiset of n positive integers and a target sum S, the subset sum problem is to find a subset such that the sum of its elements is as close as possible to S without exceeding S. We ...

Abstract: Search algorithms based on quantum walks have emerged as a promising approach to solve computational problems across various domains, including combinatorial optimization, and cryptography.