Exact contraction complexities found using freetdi and meiji-e on QAOA circuits for computing MaxCut on r-regular graphs.
收藏数据链接：
官方服务：
资源简介：
25 random regular graphs are generated at each r, |V| level using NetworkX, and algorithms were timed out at 15 minutes. Timed out values were dropped from the data, resulting in less than 25 Samples for some parameter values.
创建时间：
2018-12-18
