The Subset-sum Problem is one of the easiest to describe and understand NP-complete problems. Available algorithms that solve this problem exactly need an exponential time, thus finding a solution to ...

The Subset Sum Problem is a classic computational problem in the field of computer science and mathematics. Given a set of positive integers and a target sum, the task is to determine whether there is ...

To solve the subset sum problem, a well-known nondeterministic polynomial-time complete problem that is widely used in encryption and resource scheduling, we propose a feasible quantum algorithm that ...