Depth Optimized Ansatz Circuit in QAOA for Max-Cut

Understand

While a Quantum Approximate Optimization Algorithm (QAOA) is intended to provide a quantum advantage in finding approximate solutions to combinatorial optimization problems, noise in the system is a hurdle in exploiting its full potential.

• Several error mitigation techniques have been studied to lessen the effect of noise on this algorithm.
• Recently, Majumdar et al.
• proposed a Depth First Search (DFS) based method to reduce $n-1$ CNOT gates in the ansatz design of QAOA for finding Max-Cut in a graph G = (V, E), |V| = n.