Investigating layer-selective transfer learning of QAOA parameters for Max-Cut problem

Francesco Aldo Venturelli, Sreetama Das, Filippo Caruso
12/30/2024
quant-phcond-mat.dis-nncs.LG

No confident code implementation found for this paper.

Abstract

Quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm (VQA) ideal for noisy intermediate-scale quantum (NISQ) processors, and is highly successful for solving combinatorial optimization problems (COPs). It has been observed that the optimal variational parameters obtained from one instance of a COP can be transferred to another instance, producing sufficiently satisfactory solutions for the latter. In this context, a suitable method for further improving the solution is to fine-tune a subset of the transferred parameters. We numerically explore the role of optimizing individual QAOA layers in improving the approximate solution of the Max-Cut problem after parameter transfer. We also investigate the trade-off between a good approximation and the required optimization time when optimizing transferred QAOA parameters. These studies show that optimizing a subset of layers can be more effective at a lower time-cost compared to optimizing all layers.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{venturelli2024investigating,
  title  = {Investigating layer-selective transfer learning of QAOA parameters for Max-Cut problem},
  author = {Francesco Aldo Venturelli and Sreetama Das and Filippo Caruso},
  year   = {2024},
  eprint = {2412.21071},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.21071v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.21071.svg)](https://codeofpaper.com/paper/2412.21071)

Discussion