Evolving a Multi-Population Evolutionary-QAOA on Distributed QPUs

Our work integrates an Evolutionary Algorithm (EA) with the Quantum Approximate Optimization Algorithm (QAOA) to optimize ansatz parameters in place of traditional gradient-based methods. We benchmark this EvolutionaryQAOA (E-QAOA) approach on the Max-Cut problem for d 3 regular graphs of 4 to 26 nodes, demonstrating equal or higher accuracy and reduced variance compared to COBYLAbased QAOA, especially when using Conditional Value at Risk (CVaR) for fitness evaluations. Additionally, we propose a novel distributed multi-population EA strategy, executing parallel, independent populations on two quantum processing units (QPUs) with classical communication of 'elite' solutions. Experiments on quantum simulators and IBM hardware validate the approach. We also discuss potential extensions of our method and outline promising future directions in scalable, distributed quantum optimization on hybrid quantum-classical infrastructures.