A quantum approximate optimization algorithm

The source of QAOA. The constant this library quotes is the paper's own: on connected 3-regular graphs, depth p = 1 yields a cut at least 0.6924 times optimal, and the authors write that this is not as good as known classical algorithms. Also the source for the cost-mixer ansatz and for the fixed-p preprocessing argument on bounded-degree graphs.