Comparing classical and quantum-based approaches for solving the 0/1 knapsack problem

The central research question of this thesis is how classical and quantum-based approaches differ when solving the 0/1 Knapsack Problem (KP) with respect to runtime, resource consumption, and solution quality. A key focus of this thesis lies on a newly proposed Controlled Full Adder (CFA) approach for encoding the KP on quantum annealers. Such an encoding for the KP has not appeared in literature before.