



01001nas a2200109   4500008004100000245006100041210006100102260001500163520065900178100001700837856003700854       2017                        eng d00aPenalty models for bitstrings of constant Hamming weight0 aPenalty models for bitstrings of constant Hamming weight  c2017/04/243 a<p><span style="font-family: &quot;Lucida Grande&quot;, helvetica, arial, verdana, sans-serif; font-size: 14.4px;">To program a quantum annealer, one must construct objective functions whose minima encode hard constraints imposed by the underlying problem. For such &quot;penalty models,&quot; one desires the additional property that the gap in the objective value between such minima and states that fail the constraints is maximized amongst the allowable objective functions. In this short note, we prove the standard penalty model for the constraint that a bitstring has given Hamming weight is optimal with respect to objective value gap.</span></p>1 aLackey, Brad  uhttps://arxiv.org/abs/1704.07290