A Structured Method for Compilation of QAOA Circuits in Quantum
  Computing
Quantum Approximation Optimization Algorithm (QAOA) is a highly advocated
variational algorithm for solving the combinatorial optimization problem. One
critical feature in the quantum circuit of QAOA algorithm is that it consists
of two-qubit operators that commute. The flexibility in reordering the
two-qubit gates allows compiler optimizations to generate circuits with better
depths, gate count, and fidelity. However, it also imposes significant
challenges due to additional freedom exposed in the compilation. Prior studies
lack the following: (1) Performance guarantee, (2) Scalability, and (3)
Awareness of regularity in scalable hardware. We propose a structured method
that ensures linear depth for any compiled QAOA circuit on multi-dimensional
quantum architectures. We also demonstrate how our method runs on Google
Sycamore and IBM Non-linear architectures in a scalable manner and in linear
time. Overall, we can compile a circuit with up to 1024 qubits in 10 seconds
with a 3.8X speedup in depth, 17% reduction in gate count, and 18X improvement
for circuit ESP.
Yuwei Jin Jason Luo Lucent Fong Yanhao Chen Ari B. Hayes Chi Zhang Fei Hua Eddy Z. Zhang