Mitchell Matheny

Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem

Ruslan Shaydulin [1], Changhao Li [1], Shouvanik Chakrabarti [1], Matthew DeCross [2], Dylan Herman [1], Niraj Kumar [1], Jeffrey Larson [3], Danylo Lykov [1,4], Pierre Minssen [1], Yue Sun [1], Yuri Alexeev [4], Joan M. Dreiling [2], John P. Gaebler [2], Thomas M. Gatterman [2], Justin A. Gerber [2], Kevin Gilmore [2], Dan Gresh [2], Nathan Hewitt [2], Chandler V. Horst [2], Shaohan Hu [1], Jacob Johansen [2], Mitchell Matheny [2], Tanner Mengle [2], Michael Mills [2], Steven A. Moses [2], Brian Neyenhuis [2], Peter Siegfried [2], Romina Yalovetzky [1], Marco Pistoia [1]

Abstract

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.

Topological Order from Measurements and Feed-Forward on a Trapped Ion Quantum Computer

Mohsin Iqbal [1], Nathanan Tantivasadakarn [2], Thomas M. Gatterman [3], Justin A. Gerber [3], Kevin Gilmore [3], Dan Gresh [3], Aaron Hankin [3], Nathan Hewitt [3], Chandler V. Horst [3], Mitchell Matheny [3], Tanner Mengle [3], Brian Neyenhuis [3], Ashvin Vishwanath [4], Michael Foss-Feig [3], Ruben Verresen [4], Henrik Dreyer [1]

Abstract

Quantum systems evolve in time in one of two ways: through the Schrödinger equation or wavefunction collapse. So far, deterministic control of quantum many-body systems in the lab has focused on the former, due to the probabilistic nature of measurements. This imposes serious limitations: preparing long-range entangled states, for example, requires extensive circuit depth if restricted to unitary dynamics. In this work, we use mid-circuit measurement and feed-forward to implement deterministic non-unitary dynamics on Quantinuum's H1 programmable ion-trap quantum computer. Enabled by these capabilities, we demonstrate for the first time a constant-depth procedure for creating a toric code ground state in real-time. In addition to reaching high stabilizer fidelities, we create a non-Abelian defect whose presence is confirmed by transmuting anyons via braiding. This work clears the way towards creating complex topological orders in the lab and exploring deterministic non-unitary dynamics via measurement and feed-forward.