Timothy Proctor

Helios: A 98-qubit trapped-ion quantum computer

Anthony Ransford [1], M. S. Allman, Jake Arkinstall [2,1], J. P. Campora, Samuel F. Cooper [1], Robert D. Delaney [1], Joan M. Dreiling [1], Brian Estey [1], Caroline Figgatt [1], Alex Hall [1], Ali A. Husain [3], Akhil Isanaka [1], Colin J. Kennedy [1], Nikhil Kotibhaskar [4], Ivaylo S. Madjarov [1], Karl Mayer [1], Alistair R. Milne [4], Annie J. Park [1], Adam P. Reed [1], Riley Ancona [1], Molly P. Andersen [5], Pablo Andres-Martinez [2], Will Angenent [2], Liz Argueta [1], Benjamin Arkin [1], Leonardo Ascarrunz [1], William Baker [1], Corey Barnes [1], John Bartolotta [1], Jordan Berg [1], Ryan Besand [1], Bryce Bjork [1], Matt Blain [5], Paul Blanchard [1], Robin Blume-Kohout [6], Matt Bohn [1,2], Agustin Borgna, Daniel Y. Botamanenko [1], Robert Boutelle [1], Natalie Brown [1], Grant T. Buckingham [1], Nathaniel Q. Burdick [3], William Cody Burton [1], Varis Carey [1], Christopher J. Carron [5], Joe Chambers [1], John Children [2], Victor E. Colussi [1], Steven Crepinsek [1], Andrew Cureton [1], Joe Davies [5], Daniel Davis [1], Matthew DeCross [1], David Deen [3], Conor Delaney [1], Davide DelVento [1], B. J. DeSalvo, Jason Dominy [1], Ross Duncan [7], Vanya Eccles [2], Alec Edgington [2], Neal Erickson [1], Stephen Erickson [1], Christopher T. Ertsgaard [5], Bruce Evans [1], Tyler Evans [1], Maya I. Fabrikant [1], Andrew Fischer [1], Cameron Foltz [1], Michael Foss-Feig [1], David Francois [1], Brad Freyberg [1], Charles Gao [1], Robert Garay [1], Jane Garvin [1], David M. Gaudiosi [1], Christopher N. Gilbreth [1], Josh Giles [1], Erin Glynn [1], Jeff Graves [1], Azure Hansen [1], David Hayes [1], Lukas Heidemann [2], Bob Higashi [5], Tyler Hilbun [1], Jordan Hines [6], Ariana Hlavaty [2], Kyle Hoffman [1], Ian M. Hoffman [1], Craig Holliman [7], Isobel Hooper [2], Bob Horning [5], James Hostetter [3], Daniel Hothem [8], Jack Houlton [1], Jared Hout [1], Ross Hutson [1], Ryan T. Jacobs [1], Trent Jacobs [1], Melf Johannsen [2], Jacob Johansen [1], Loren Jones [1], Sydney Julian [1], Ryan Jung [5], Aidan Keay [2], Todd Klein [5], Mark Koch [2], Ryo Kondo [1], Chang Kong [1], Asa Kosto [1], Alan Lawrence [2], David Liefer [1], Michelle Lollie [1], Dominic Lucchetti [1], Nathan K. Lysne [7], Christian Lytle [1], Callum MacPherson [2], Andrew Malm [1], Spencer Mather [1], Brian Mathewson [1], Daniel Maxwell [3], Lauren McCaffrey [1], Hannah McDougall [1], Robin Mendoza [1], Michael Mills [1], Richard Morrison [2], Louis Narmour [1], Nhung Nguyen [1], Lora Nugent [1], Scott Olson [5], Daniel Ouellette [5], Jeremy Parks [1], Zach Peters [1], Jessie Petricka [1], Juan M. Pino [1], Frank Polito [1], Matthias Preidl [5], Gabriel Price [1], Timothy Proctor [8], McKinley Pugh [1], Noah Ratcliff [1], Daisy Raymondson [1], Peter Rhodes [1], Conrad Roman [1], Craig Roy [2], Ciaran Ryan-Anderson [1], Fernando Betanzo Sanchez [2], George Sangiolo [2], Tatiana Sawadski [2], Andrew Schaffer [3], Peter Schow [1], Jon Sedlacek [3], Henry Semenenko [2], Peter Shevchuk [1], Susan Shore [5], Peter Siegfried [1], Kartik Singhal [1], Seyon Sivarajah [2], Thomas Skripka [1], Lucas Sletten [3], Ben Spaun [1], R. Tucker Sprenkle [1], Paul Stoufer [1], Mariel Tader [1], Stephen F. Taylor [3], Travis H. Thompson [2], Raanan Tobey [1], Anh Tran [1], Tam Tran [1], Grahame Vittorini [3], Curtis Volin [3], Jim Walker [1], Sam White [2], Douglas Wilson [2], Quinn Wolf [1], Chester Wringe [2], Kevin Young [8], Jian Zheng [1], Kristen Zuraski [1], Charles H. Baldwin [1], Alex Chernoguzov [1], John P. Gaebler [1], Steven J. Sanders [1], Brian Neyenhuis [1], Russell Stutz [1], Justin G. Bohnet [1]

Abstract

We report on Quantinuum Helios, a 98-qubit trapped-ion quantum processor based on the quantum charge-coupled device (QCCD) architecture. Helios features $^{137}$Ba$^{+}$ hyperfine qubits, all-to-all connectivity enabled by a rotatable ion storage ring connecting two quantum operation regions by a junction, speed improvements from parallelized operations, and a new software stack with real-time compilation of dynamic programs. Averaged over all operational zones in the system, we achieve average infidelities of $2.5(1)\times10^{-5}$ for single-qubit gates, $7.9(2)\times10^{-4}$ for two-qubit gates, and $4.8(6)\times10^{-4}$ for state preparation and measurement, none of which are fundamentally limited and likely able to be improved. These component infidelities are predictive of system-level performance in both random Clifford circuits and random circuit sampling, the latter demonstrating that Helios operates well beyond the reach of classical simulation and establishes a new frontier of fidelity and complexity for quantum computers.

Measuring error rates of mid-circuit measurements

Daniel Hothem [1], Jordan Hines [1,2], Charles Baldwin [3], Dan Gresh [3], Robin Blume-Kohout [4], Timothy Proctor [1]

Abstract

High-fidelity mid-circuit measurements, which read out the state of specific qubits in a multiqubit processor without destroying them or disrupting their neighbors, are a critical component for useful quantum computing. They enable fault-tolerant quantum error correction, dynamic circuits, and other paths to solving classically intractable problems. But there are almost no methods to assess their performance comprehensively. We address this gap by introducing the first randomized benchmarking protocol that measures the rate at which mid-circuit measurements induce errors in many-qubit circuits. Using this protocol, we detect and eliminate previously undetected measurement-induced crosstalk in a 20-qubit trapped-ion quantum computer. Then, we use the same protocol to measure the rate of measurement-induced crosstalk error on a 27-qubit IBM Q processor, and quantify how much of that error is eliminated by dynamical decoupling.

Quantum Circuit Transformations with a Multi-Level Intermediate Representation Compiler

Thien Nguyen, Dmitry Lyakh, Raphael C. Pooser, Travis S. Humble, Timothy Proctor, Mohan Sarovar

Abstract

Quantum computing promises remarkable approaches for processing information, but new tools are needed to compile program representations into the physical instructions required by a quantum computer. Here we present a novel adaptation of the multi-level intermediate representation (MLIR) integrated into a quantum compiler that may be used for checking program execution. We first present how MLIR enables quantum circuit transformations for efficient execution on quantum computing devices and then give an example of compiler transformations based on so-called mirror circuits. We demonstrate that mirror circuits inserted during compilation may test hardware performance by assessing quantum circuit accuracy on several superconducting and ion trap hardware platforms. Our results validate MLIR as an efficient and effective method for collecting hardware-dependent diagnostics through automated transformations of quantum circuits.

Experimental Characterization of Crosstalk Errors with Simultaneous Gate Set Tomography

Kenneth Rudinger [1], Craig W. Hogle [2], Ravi K. Naik [3], Akel Hashim [3], Daniel Lobser [2], David I. Santiago [3,4], Matthew D. Grace [1], Erik Nielsen [1], Timothy Proctor [1], Stefan Seritan [1], Susan M. Clark [2], Robin Blume-Kohout [1], Irfan Siddiqi [3,4,5], Kevin C. Young [1]

Abstract

Crosstalk is a leading source of failure in multiqubit quantum information processors. It can arise from a wide range of disparate physical phenomena, and can introduce subtle correlations in the errors experienced by a device. Several hardware characterization protocols are able to detect the presence of crosstalk, but few provide sufficient information to distinguish various crosstalk errors from one another. In this article we describe how gate set tomography, a protocol for detailed characterization of quantum operations, can be used to identify and characterize crosstalk errors in quantum information processors. We demonstrate our methods on a two-qubit trapped-ion processor and a two-qubit subsystem of a superconducting transmon processor.

Detecting and tracking drift in quantum information processors

Timothy Proctor [1], Melissa Revelle [2], Erik Nielsen [1], Kenneth Rudinger [1], Daniel Lobser [2], Peter Maunz [2], Robin Blume-Kohout [1], Kevin Young [1]

Abstract

If quantum information processors are to fulfill their potential, the diverse errors that affect them must be understood and suppressed. But errors typically fluctuate over time, and the most widely used tools for characterizing them assume static error modes and rates. This mismatch can cause unheralded failures, misidentified error modes, and wasted experimental effort. Here, we demonstrate a spectral analysis technique for resolving time dependence in quantum processors. Our method is fast, simple, and statistically sound. It can be applied to time-series data from any quantum processor experiment. We use data from simulations and trapped-ion qubit experiments to show how our method can resolve time dependence when applied to popular characterization protocols, including randomized benchmarking, gate set tomography, and Ramsey spectroscopy. In the experiments, we detect instability and localize its source, implement drift control techniques to compensate for this instability, and then demonstrate that the instability has been suppressed.