Extrapolation method to optimize linear-ramp quantum approximate optimization algorithm parameters: dataset
收藏Zenodo2026-01-19 更新2026-05-29 收录
下载链接：
https://zenodo.org/doi/10.5281/zenodo.18302993
下载链接
链接失效反馈官方服务：
资源简介：
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.
提供机构：
Zenodo
创建时间：
2026-01-19
