This notebook solves the subset-sum problem by combining a classical check with Grover-style quantum amplitude amplification. Given a set $S$ of cardinality $n \ge 0 ...
..math The Subset Sum problem is the decision problem, where given a set of $n$ values $x_i$ and a target value $t$, is there a collection of indicies $I \subseteq [n ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results