Efficient Quantum Algorithm for SUBSET-SUM Problem

ePrint Report: Efficient Quantum Algorithm for SUBSET-SUM Problem

Sanchita Ghosh, Anant Sharma, Sreetama Das, Shibdas Roy

Problems in the complexity class $NP$ are not all known to be solvable, but are verifiable given the solution, in polynomial time by a classical computer. The complexity class $BQP$ includes all problems solvable in polynomial time by a quantum computer. Prime factorization is in $NP$ class, and is also in $BQP$ class, owing to Shor's algorithm. The hardest of all problems within the …

algorithm class complexity computer eprint report problem problems quantum report solution