1 citations · 1 across the 9 of their papers we have counts for
4 papers · 2 filters
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…
Extrapolating Pauli Checks for Expectation Value Estimation on Noisy Quantum Devices
Quinn Langfitt, Ji Liu, Benchen Huang +4
Pauli Check Sandwiching (PCS) is an error detection scheme that protects quantum circuits by inserting pairs of parity checks and discarding runs that signal errors. However, each…
Graph Representation Learning for Parameter Transferability in Quantum Approximate Optimization Algorithm
Jose Falla, Quinn Langfitt, Yuri Alexeev +1
The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. O…