Solving Large-Scale QUBO with Transferred Parameters from Multilevel QAOA of low depth

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Bach, Bao G, Maciejewski, Filip B., Safro, Ilya
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912380080881664
author Bach, Bao G
Maciejewski, Filip B.
Safro, Ilya
author_facet Bach, Bao G
Maciejewski, Filip B.
Safro, Ilya
contents The Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum approach for tackling combinatorial optimization problems. However, hardware constraints such as limited scaling and susceptibility to noise pose significant challenges when applying QAOA to large instances. To overcome these limitations, scalable hybrid multilevel strategies have been proposed. In this work, we propose a fast hybrid multilevel algorithm with QAOA parameterization throughout the multilevel hierarchy and its reinforcement with genetic algorithms, which results in a high-quality, low-depth QAOA solver. Notably, we propose parameter transfer from the coarsest level to the finer level, showing that the relaxation-based coarsening preserves the problem structural information needed for QAOA parametrization. Our strategy improves the coarsening phase and leverages both Quantum Relax \& Round and genetic algorithms to incorporate $p=1$ QAOA samples effectively. The results highlight the practical potential of multilevel QAOA as a scalable method for combinatorial optimization on near-term quantum devices.
format Preprint
id arxiv_https___arxiv_org_abs_2505_11464
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Solving Large-Scale QUBO with Transferred Parameters from Multilevel QAOA of low depth
Bach, Bao G
Maciejewski, Filip B.
Safro, Ilya
Quantum Physics
The Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum approach for tackling combinatorial optimization problems. However, hardware constraints such as limited scaling and susceptibility to noise pose significant challenges when applying QAOA to large instances. To overcome these limitations, scalable hybrid multilevel strategies have been proposed. In this work, we propose a fast hybrid multilevel algorithm with QAOA parameterization throughout the multilevel hierarchy and its reinforcement with genetic algorithms, which results in a high-quality, low-depth QAOA solver. Notably, we propose parameter transfer from the coarsest level to the finer level, showing that the relaxation-based coarsening preserves the problem structural information needed for QAOA parametrization. Our strategy improves the coarsening phase and leverages both Quantum Relax \& Round and genetic algorithms to incorporate $p=1$ QAOA samples effectively. The results highlight the practical potential of multilevel QAOA as a scalable method for combinatorial optimization on near-term quantum devices.
title Solving Large-Scale QUBO with Transferred Parameters from Multilevel QAOA of low depth
topic Quantum Physics
url https://arxiv.org/abs/2505.11464