85 citations · 105 across the 26 of their papers we have counts for
6 papers · 1 filter
Snapshot-QAOA: Extending QAOA to Quantum Hamiltonian Simulation
Reuben Tate, Quinn Langfitt, Elijah Pelofske +4
We present Snapshot-QAOA, a variation of the Quantum Approximate Optimization Algorithm (QAOA) that finds approximate minimum energy eigenstates of a large set of quantum Hamiltoni…
Phantom Edges in the Problem Hamiltonian: A Method for Increasing Performance and Graph Visibility for QAOA
Quinn Langfitt, Reuben Tate, Stephan Eidenbenz
The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm that can be used to approximately solve combinatorial optimization problems. However, a maj…
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…
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…
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…
Theoretical Approximation Ratios for Warm-Started QAOA on 3-Regular Max-Cut Instances at Depth
Reuben Tate, Stephan Eidenbenz
We generalize Farhi et al.'s 0.6924-approximation result technique of the Max-Cut Quantum Approximate Optimization Algorithm (QAOA) on 3-regular graphs to obtain provable lower bou…