Madelyn Cain

Strategies for running the QAOA at hundreds of qubits

2024 · arXiv (Cornell University)

We explore strategies aimed at reducing the amount of computation, both quantum and classical, required to run the Quantum Approximate Optimization Algorithm (QAOA). First, following Wurtz et al. [Phys.Rev A 104:052419], we consider the standard …

Derandomized shallow shadows: Efficient Pauli learning with bounded-depth circuits

2024 · arXiv (Cornell University)

Efficiently estimating large numbers of non-commuting observables is an important subroutine of many quantum science tasks. We present the derandomized shallow shadows (DSS) algorithm for efficiently learning a large set of non-commuting observables, using shallow …