Extrapolation method to optimize linear-ramp quantum approximate optimization algorithm parameters: dataset

Read full text
Authors: Thomas Wellens, Vanessa Dehn, Martin Zaefferer, Gerhard Hellstern, Karthik Jayadevan, Florentin Reiter
Cited by: 1

Abstract

The dataset contains the problem instances for which the QAOA runtime scaling is analyzed in the paper "Extrapolation method to optimize linear-ramp quantum approximate optimization algorithm parameters: evaluation of runtime scaling". Portfolio optimization Feature selection Clustering (moons) MaxCut The keys of the python dictionaries have the form "N_i", where: N = problem size / number of binary variables (from 12 to 28), i = instance (from 0 to 9 or from 0 to 19). The dictionaries furthermore contain the QUBO matrices Q_ij, see Eq. (2) (key: "matrix") and the corresponding optimal bitstrings (key: "optimal_solution") in reversed order (as usual in Qiskit). Furthermore, also the dataset for the hard MaxCut instances (see Appendix D) is included.

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
19 January 2026
Document type
Dataset