Quantum Optimization for the Maximum Cut Problem on a Superconducting Quantum Computer
收藏NIAID Data Ecosystem2026-05-02 收录
下载链接：
https://zenodo.org/record/11061743
下载链接
链接失效反馈官方服务：
资源简介：
The dataset includes maximum cut problem instances on 3-regular graphs, the cut number returned by the experimental runs of the greedy-enhanced quantum relax-and-round algorithm, and the estimated optimal cut number used for computing the approximation ratio from the paper Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer [https://arxiv.org/abs/2404.17579]
创建时间：
2025-02-25
