DeepAI AI Chat
Log In Sign Up

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

by   Xin Wang, et al.
University of the Chinese Academy of Sciences

Optimizing parameterized quantum circuits promises efficient use of near-term quantum computers to achieve the potential quantum advantage. However, there is a notorious tradeoff between the expressibility and trainability of the parameter ansatz. We find that in combinatorial optimization problems, since the solutions are described by bit strings, one can trade the expressiveness of the ansatz for high trainability. To be specific, by focusing on the max-cut problem we introduce a simple yet efficient algorithm named Quantum Qubit Rotation Algorithm (QQRA). The quantum circuits are comprised with single-qubit rotation gates implementing on each qubit. The rotation angles of the gates can be trained free of barren plateaus. Thus, the approximate solution of the max-cut problem can be obtained with probability close to 1. To illustrate the effectiveness of QQRA, we compare it with the well known quantum approximate optimization algorithm and the classical Goemans-Williamson algorithm.


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...

An efficient quantum circuits optimizing scheme compared with QISKit

Recently, the development of quantum chips has made great progress-- the...

Depth Optimized Ansatz Circuit in QAOA for Max-Cut

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

PAN: Pulse Ansatz on NISQ Machines

Variational quantum algorithms (VQAs) have demonstrated great potentials...

Channel Decoding with Quantum Approximate Optimization Algorithm

Motivated by the recent advancement of quantum processors, we investigat...

Natural evolution strategies and quantum approximate optimization

A notion of quantum natural evolution strategies is introduced, which pr...