Quantum Approximate Optimization Algorithm (QAOA) Deep Dive
What are Combinatorial Optimization Problems (COPs)? Combinatorial problems(COPs) are categorized as NP hard problems (well because they are combinatorial problems) which means the number of solutions typically depend on an where a is a constant depending upon the problem and n is the problem size. Combinatorial implies that n! (factorial n) combination of objectives are involved, which…