2 papers
quant-ph2025
Boosting Sparsity in Graph Decompositions with QAOA Sampling
George Pennington, Naeimeh Mohseni, Oscar Wallis +5
We study the problem of decomposing a graph into a weighted sum of a small number of matchings, a task that arises in network resource allocation problems such as peer-to-peer ener…
quant-ph2025
Evolving a multi-population evolutionary-QAOA on distributed QPUs
Francesca Schiavello, Edoardo Altamura, Ivano Tavernelli +2
Our work integrates an Evolutionary Algorithm (EA) with the Quantum Approximate Optimization Algorithm (QAOA) to optimize ansatz parameters in place of traditional gradient-based m…