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

10/15/2021
by   Xin Wang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2023

Sub-universal variational circuits for combinatorial optimization problems

Quantum variational circuits have gained significant attention due to th...
research
06/05/2021

Optimizing Ansatz Design in QAOA for Max-cut

Quantum Approximate Optimization Algorithm (QAOA) is studied primarily t...
research
08/21/2023

A Block-Ring connected Topology of Parameterized Quantum Circuits

It is essential to select efficient topology of parameterized quantum ci...
research
10/20/2021

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...
research
10/09/2021

Depth Optimized Ansatz Circuit in QAOA for Max-Cut

While a Quantum Approximate Optimization Algorithm (QAOA) is intended to...
research
08/02/2022

PAN: Pulse Ansatz on NISQ Machines

Variational quantum algorithms (VQAs) have demonstrated great potentials...
research
06/10/2023

A Universal Quantum Algorithm for Weighted Maximum Cut and Ising Problems

We propose a hybrid quantum-classical algorithm to compute approximate s...

Please sign up or login with your details

Forgot password? Click here to reset