3 papers
cs.DS2024
Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
Jad Salem, Reuben Tate, Stephan Eidenbenz
Maximin fairness is the ideal that the worst-off group (or individual) should be treated as well as possible. Literature on maximin fairness in various decision-making settings has…
quant-ph2024
Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
Reuben Tate, Stephan Eidenbenz
In order to boost the performance of the Quantum Approximate Optimization Algorithm (QAOA) to solve problems in combinatorial optimization, researchers have leveraged the solutions…
quant-ph2024
The Better Solution Probability Metric: Optimizing QAOA to Outperform its Warm-Start Solution
Sean Feeney, Reuben Tate, Stephan Eidenbenz
This paper presents a numerical simulation investigation of the Warm-Start Quantum Approximate Optimization Algorithm (QAOA) as proposed by Tate et al. [1], focusing on its applica…