Quantum Knapsack Problem Benchmark
QAOA / Copula-QAOA / AAM-QAOA · Optimization · 20 qubits · Qiskit, PennyLane
Benchmark of quantum optimization algorithms applied to the knapsack problem, a fundamental NP-hard constrained combinatorial optimization problem. Recent advances include copula-QAOA for hardware-efficient constraint handling and Amplitude Amplification-mixer QAOA (AAM-QAOA), which uses a quantum tree generator for feasible-solution state preparation. Benchmark sets test instances with up to 20 items.
Benchmark of quantum optimization algorithms applied to the knapsack problem, a fundamental NP-hard constrained combinatorial optimization problem. Recent advances include copula-QAOA for hardware-efficient constraint handling and Amplitude Amplification-mixer QAOA (AAM-QAOA), which uses a quantum tree generator for feasible-solution state preparation. Benchmark sets test instances with up to 20 items.
Advances constrained combinatorial optimization by demonstrating hardware-efficient feasible-solution state preparation for NP-hard problems.
Simulator / hardware-agnostic
Qiskit, PennyLane