  One of the central goals of the DARPA Optimization with Noisy
Intermediate-Scale Quantum (ONISQ) program is to implement a hybrid
quantum/classical optimization algorithm with high $N\cdot p$, where $N$ is the
number of qubits and $p$ is the number of alternating applications of
parameterized quantum operators in the protocol. In this note, we demonstrate
the execution of the Quantum Approximate Optimization Algorithm (QAOA) applied
to the MaxCut problem on non-planar 3-regular graphs with $N\cdot p$ of up to
$320$ on the Quantinuum H1-1 and H2 trapped-ion quantum processors. To the best
of our knowledge, this is the highest $N\cdot p$ demonstrated on hardware to
date. Our demonstration highlights the rapid progress of quantum hardware.
