Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Lavagna, Leonardo"'
We investigate the Maximum Cut (MaxCut) problem on different graph classes with the Quantum Approximate Optimization Algorithm (QAOA) using symmetries. In particular, heuristics on the relationship between graph symmetries and the approximation ratio
Externí odkaz:
http://arxiv.org/abs/2408.15413