Exact contraction complexities found using freetdi and meiji-e on QAOA circuits for computing MaxCut on <i>r</i>-regular graphs.
- Eugene F. Dumitrescu (6095660)
- Allison L. Fisher (6095663)
- Timothy D. Goodrich (6095666)
- Travis S. Humble (5234537)
- Blair D. Sullivan (5933777)
- Andrew L. Wright (6095669)
Publication date
December 2018
DOI Publisher
Public Library of Science (PLoS)Abstract
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.</p
Add to ORKG