Andrew Arrasmith

Quantum-Classical Auxiliary Field Quantum Monte Carlo with Matchgate Shadows on Trapped Ion Quantum Computers

Luning Zhao, Joshua J. Goings, Willie Aboumrad, Andrew Arrasmith, Lazaro Calderin, Spencer Churchill, Dor Gabay, Thea Harvey-Brown, Melanie Hiles, Magda Kaja, Matthew Keesan, Karolina Kulesz, Andrii Maksymov, Mei Maruo, Mauricio Muñoz, Bas Nijholt, Rebekah Schiller, Yvette de Sereville, Amy Smidutz, Felix Tripier, Grace Yao, Trishal Zaveri [1], Coleman Collins [1], Martin Roetteler [1], Evgeny Epifanovsky [1], Arseny Kovyrshin [2], Lars Tornberg [2], Anders Broo [2], Jeff R. Hammond [3], Zohim Chandani [4], Pradnya Khalate [4], Elica Kyoseva [4], Yi-Ting Chen [5], Eric M. Kessler [5], Cedric Yen-Yu Lin [5], Gandhi Ramu [5], Ryan Shaffer [5], Michael Brett [6], Benchen Huang [6], Maxime R. Hugues [6], Tyler Y. Takeshita [6]

Abstract

We demonstrate an end-to-end workflow to model chemical reaction barriers with the quantum-classical auxiliary field quantum Monte Carlo (QC-AFQMC) algorithm with quantum tomography using matchgate shadows. The workflow operates within an accelerated quantum supercomputing environment with the IonQ Forte quantum computer and NVIDIA GPUs on Amazon Web Services. We present several algorithmic innovations and an efficient GPU-accelerated execution, which achieves a several orders of magnitude speedup over the state-of-the-art implementation of QC-AFQMC. We apply the algorithm to simulate the oxidative addition step of the nickel-catalyzed Suzuki-Miyaura reaction using 24 qubits of IonQ Forte with 16 qubits used to represent the trial state, plus 8 additional ancilla qubits for error mitigation, resulting in the largest QC-AFQMC with matchgate shadow experiments ever performed on quantum hardware. We achieve a $9\times$ speedup in collecting matchgate circuit measurements, and our distributed-parallel post-processing implementation attains a $656\times$ time-to-solution improvement over the prior state-of-the-art. Chemical reaction barriers for the model reaction evaluated with active-space QC-AFQMC are within the uncertainty interval of $\pm4$ kcal/mol from the reference CCSD(T) result when matchgates are sampled on the ideal simulator and within 10 kcal/mol from reference when measured on QPU. This work marks a step towards practical quantum chemistry simulations on quantum devices while identifying several opportunities for further development.

Pathfinding Quantum Simulations of Neutrinoless Double-Beta Decay

Ivan A. Chernyshev [1], Roland C. Farrell [2], Marc Illa [3], Martin J. Savage [3,4], Andrii Maksymov, Felix Tripier [4], Miguel Angel Lopez-Ruiz [4], Andrew Arrasmith [4], Yvette de Sereville [4], Aharon Brodutch [4], Claudio Girotto [4], Ananth Kaushik [4], Martin Roetteler [4]

Abstract

We present results from co-designed quantum simulations of the neutrinoless double-beta decay of a simple nucleus in 1+1D quantum chromodynamics using IonQ's Forte-generation trapped-ion quantum computers. Electrons, neutrinos, and up and down quarks are distributed across two lattice sites and mapped to 32 qubits, with an additional 4 qubits used for flag-based error mitigation. A four-fermion interaction is used to implement weak interactions, and lepton-number violation is induced by a neutrino Majorana mass. Quantum circuits that prepare the initial nucleus and time evolve with the Hamiltonian containing the strong and weak interactions are executed on IonQ Forte Enterprise. Enabled by tuned model parameters, lepton-number violation is observed in real time, providing a clear signal of neutrinoless double-beta decay. This was made possible by co-designing the simulation to maximally utilize the all-to-all connectivity and native gate-set available on IonQ's quantum computers. Quantum circuit compilation techniques and co-designed error-mitigation methods, informed from executing benchmarking circuits with up to 2,356 two-qubit gates, enabled observables to be extracted with high precision. We discuss the potential of future quantum simulations to provide yocto-second resolution of the reaction pathways in these, and other, nuclear processes.

Unifying and benchmarking state-of-the-art quantum error mitigation techniques

Daniel Bultrini [1,2], Max Hunter Gordon [3], Piotr Czarnik [1,4], Andrew Arrasmith [1,5], M. Cerezo [6,5], Patrick J. Coles [1,5], Lukasz Cincio [1,5]

Abstract

Error mitigation is an essential component of achieving a practical quantum advantage in the near term, and a number of different approaches have been proposed. In this work, we recognize that many state-of-the-art error mitigation methods share a common feature: they are data-driven, employing classical data obtained from runs of different quantum circuits. For example, Zero-noise extrapolation (ZNE) uses variable noise data and Clifford-data regression (CDR) uses data from near-Clifford circuits. We show that Virtual Distillation (VD) can be viewed in a similar manner by considering classical data produced from different numbers of state preparations. Observing this fact allows us to unify these three methods under a general data-driven error mitigation framework that we call UNIfied Technique for Error mitigation with Data (UNITED). In certain situations, we find that our UNITED method can outperform the individual methods (i.e., the whole is better than the individual parts). Specifically, we employ a realistic noise model obtained from a trapped ion quantum computer to benchmark UNITED, as well as other state-of-the-art methods, in mitigating observables produced from random quantum circuits and the Quantum Alternating Operator Ansatz (QAOA) applied to Max-Cut problems with various numbers of qubits, circuit depths and total numbers of shots. We find that the performance of different techniques depends strongly on shot budgets, with more powerful methods requiring more shots for optimal performance. For our largest considered shot budget ($10^{10}$), we find that UNITED gives the most accurate mitigation. Hence, our work represents a benchmarking of current error mitigation methods and provides a guide for the regimes when certain methods are most useful.

Qubit-efficient exponential suppression of errors

Piotr Czarnik [1], Andrew Arrasmith [2], Lukasz Cincio [2], Patrick J. Coles [2]

Abstract

Achieving a practical advantage with near-term quantum computers hinges on having effective methods to suppress errors. Recent breakthroughs have introduced methods capable of exponentially suppressing errors by preparing multiple noisy copies of a state and virtually distilling a more purified version. Here we present an alternative method, the Resource-Efficient Quantum Error Suppression Technique (REQUEST), that adapts this breakthrough to much fewer qubits by making use of active qubit resets, a feature now available on commercial platforms. Our approach exploits a space/time trade-off to achieve a similar error reduction using only $2N+1$ qubits as opposed to $MN+1$ qubits, for $M$ copies of an $N$ qubit state. Additionally, we propose a method using near-Clifford circuits to find the optimal number of these copies in the presence of realistic noise, which limits this error suppression. We perform a numerical comparison between the original method and our qubit-efficient version with a realistic trapped-ion noise model. We find that REQUEST can reproduce the exponential suppression of errors of the virtual distillation approach, while out-performing virtual distillation when fewer than $3N+1$ qubits are available. Finally, we examine the scaling of the number of shots $N_S$ required for REQUEST to achieve useful corrections. We find that $N_S$ remains reasonable well into the quantum advantage regime where $N$ is hundreds of qubits.