
Portfolio knapsack optimization asks which assets to select when each candidate has value, weight, and explicit capacity constraints. The source use case describes a feasible constrained-QAOA proof of concept on a 5-asset instance using 11 qubits on a simulator.
MILP and heuristics remain strong baselines for constrained selection. The QAOA variant uses a Quantum Walk Mixer to explore feasible selections while preserving the constrained structure of the problem, then compares objective value, feasibility, and seed stability against the classical references.
The source material reports a feasible constrained-QAOA simulator run whose objective is comparable to MILP and heuristics on the same instance.
Classical baseline
MILP
Quantum method
Constrained QAOA
PoC instance
5 assets
Quantum resources
11 qubits
Use it when you need a defensible QAOA benchmark against MILP, backed by the concrete PoC setup from the source material.
5 assets
PoC portfolio instance
11 qubits
Simulator setup
MILP
Exact classical baseline
Feasible
Constraint-aware QAOA run
For teams that need a classical reference before evaluating a quantum heuristic.
For researchers testing knapsack-style asset selection under strict budget or risk caps.
For teams deciding whether constrained QAOA is worth deeper simulator or hardware experiments.
One formulation, two solvers, one reproducible benchmark.
Set the 5-asset instance, values, weights, budget or risk caps, and the shared objective
Solve the classical baseline and record feasibility, objective value, and constraints
Use constrained QAOA with a Quantum Walk Mixer in an 11-qubit simulator setup
Measure feasibility, objective gap, seed stability, and configuration sensitivity
Download the methods, assumptions, code, and reproducible benchmark report
Algorithms, applied use cases and benchmarks connected to this page
Finance
Compare quantum portfolio optimization: QAOA with quantum walk mixers, HHL mean-variance allocation, and quantum annealing for cardinality-constrained QUBOs.
Algorithms
Explore the Quantum Approximate Optimization Algorithm for QUBO and Ising problems with reproducible benchmarks, parameter schedules, and hardware notes.
Comparisons
Compare quantum annealing with QAOA on QUBO/Ising optimization: hardware, constraints, scaling, and two real portfolio-optimization benchmarks.
Algorithms
Map combinatorial optimization problems to QUBO and Ising form and benchmark quantum annealing with reproducible runs, baselines, and hardware notes.
Run the 5-asset, 11-qubit constrained QAOA benchmark and compare feasibility and objective quality against MILP and heuristics.
Try your first case for free