Depth Optimized Ansatz Circuit in QAOA for Max-Cut

by   Ritajit Majumdar, et al.

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. However, this method tends to increase the depth of the circuit, making it more prone to relaxation error. The depth of the circuit is proportional to the height of the DFS tree, which can be n-1 in the worst case. In this paper, we propose an O(Δ· n^2) greedy heuristic algorithm, where Δ is the maximum degree of the graph, that finds a spanning tree of lower height, thus reducing the overall depth of the circuit while still retaining the n-1 reduction in the number of CNOT gates needed in the ansatz. We numerically show that this algorithm achieves nearly 10 times increase in the probability of success for each iteration of QAOA for Max-Cut. We further show that although the average depth of the circuit produced by this heuristic algorithm still grows linearly with n, our algorithm reduces the slope of the linear increase from 1 to 0.11.


page 1

page 2

page 3

page 4


Optimizing Ansatz Design in QAOA for Max-cut

Quantum Approximate Optimization Algorithm (QAOA) is studied primarily t...

Lower Bounds on Circuit Depth of the Quantum Approximate Optimization Algorithm

The quantum approximate optimization algorithm (QAOA) is a method of app...

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

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

Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit

Combinatorial optimization is regarded as a potentially promising applic...

Importance of Diagonal Gates in Tensor Network Simulations

In this work we present two techniques that tremendously increase the pe...

Lowering the T-depth of Quantum Circuits By Reducing the Multiplicative Depth Of Logic Networks

The multiplicative depth of a logic network over the gate basis {, ⊕, } ...

The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model

The Quantum Approximate Optimization Algorithm (QAOA) finds approximate ...

Please sign up or login with your details

Forgot password? Click here to reset