In this paper we discuss Grover Adaptive Search (GAS) for Constrained Polynomial Binary Optimization (CPBO) problems, and in particular, Quadratic Unconstrained (QUBO) as a special case. GAS can provide quadratic speed-up combinatorial optimization problems compared to brute force search. However, requires the development of efficient oracles represent flag states that satisfy certain search cr...