Optimizing Ansatz Design in QAOA for Max-cut

by   Ritajit Majumdar, et al.

Quantum Approximate Optimization Algorithm (QAOA) is studied primarily to find approximate solutions to combinatorial optimization problems. For a graph with n vertices and m edges, a depth p QAOA for the Max-cut problem requires 2· m · p CNOT gates. CNOT is one of the primary sources of error in modern quantum computers. In this paper, we propose two hardware independent methods to reduce the number of CNOT gates in the circuit. First, we present a method based on Edge Coloring of the input graph that minimizes the the number of cycles (termed as depth of the circuit), and reduces upto ⌊n/2⌋ CNOT gates. Next, we depict another method based on Depth First Search (DFS) on the input graph that reduces n-1 CNOT gates, but increases depth of the circuit moderately. We analytically derive the condition for which the reduction in CNOT gates overshadows this increase in depth, and the error probability of the circuit is still lowered. We show that all IBM Quantum Hardware satisfy this condition. We simulate these two methods for graphs of various sparsity with the ibmq_manhattan noise model, and show that the DFS based method outperforms the edge coloring based method, which in turn, outperforms the traditional QAOA circuit in terms of reduction in the number of CNOT gates, and hence the probability of error of the circuit.



There are no comments yet.


page 1

page 2

page 3

page 4


Depth Optimized Ansatz Circuit in QAOA for Max-Cut

While a Quantum Approximate Optimization Algorithm (QAOA) is intended to...

Efficiently Solve the Max-cut Problem via a Quantum Qubit Rotation Algorithm

Optimizing parameterized quantum circuits promises efficient use of near...

Separation and approximate separation of multipartite quantum gates

The number of qubits of current quantum computers is one of the most dom...

Qubit Routing using Graph Neural Network aided Monte Carlo Tree Search

Near-term quantum hardware can support two-qubit operations only on the ...

Query and Depth Upper Bounds for Quantum Unitaries via Grover Search

We prove that any n-qubit unitary can be implemented (i) approximately i...

Extracting Success from IBM's 20-Qubit Machines Using Error-Aware Compilation

NISQ (Noisy, Intermediate-Scale Quantum) computing requires error mitiga...

Code Repositories


The repository contains the code to find the probability of error for the traditional QAOA ansatz, and the proposed Edge coloring and Depth First Search Based Ansatz. This research was done in collaboration with IBM India Research Lab. The collaborators are Ritajit Majumdar, Dhiraj Madan, Debasmita Bhoumik, Dhinakaran Vinayagamurthy, Shesha Raghunathan and Susmita Sur-Kolay. The corresponding paper can be found in arXiv:

view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.