Research · FinQ-affiliated · Publication
Comparing Constraint Encoding Methods for QAOA
A numerical study uses the knapsack problem to compare three ways of incorporating linear constraints into QAOA.
An optimization problem has both an objective and rules that a valid solution must obey. This FinQ-affiliated paper asks how the choice of constraint encoding affects the Quantum Approximate Optimization Algorithm, or QAOA.
Three routes through the same problem
The study numerically compares transforming constraints into an unconstrained formulation, introducing penalty dephasing, and using the quantum Zeno effect. The knapsack problem provides a common case for examining their efficiency and effectiveness.
A paper to read alongside the workshop story
FinQ’s reviewed archive records the work in the ICCAD 2024 proceedings. The public preprint supplies the methods and author record. Its comparison is a starting point for examining encoding choices, rather than a claim that one method wins for every optimization problem.
The archive identifies this publication as FinQ-affiliated. That attribution connects the work to affiliated people and activity; it does not make the paper an official FinQ organizational output.