Charles H. Baldwin

Improving Dynamical Decoupling for Trapped-Ion QCCD Quantum Computers

William M. Watkins, Leigh M. Norris, Ross Hutson, Maxwell Urmey, Peter Siegfried, Charles H. Baldwin

Abstract

We examine the impact of scheduling errors on dynamical decoupling (DD) in trapped-ion quantum charge-coupled devices (QCCDs) and develop better strategies for reducing memory errors. In the QCCD architecture, qubit transport and control introduce stochastic pulse delays that impact the efficiency of DD. Using the filter-function formalism, we analyze the performance of DD in the presence of scheduling-induced timing errors, showing that they increase the sensitivity of standard DD to low-frequency fluctuations. For typical memory errors in trapped-ion platforms, we numerically demonstrate that increasing the DD pulse frequency beyond 2 Hz is generally counterproductive due to scheduling-induced timing errors. Furthermore, we introduce a real-time DD protocol that inserts refocusing pulses opportunistically during idle periods. We demonstrate our methods on Quantinuum H2-1 with Ramsey delay-type experiments.

Computing with many encoded logical qubits beyond break-even

Shival Dasu [1], Matthew DeCross [1], Andrew Y. Guo [1], Ali Lavasani [1], Jan Behrends [2], Asmae Benhemou [3], Yi-Hsiang Chen [1], Karl Mayer [1], Chris N. Self [2], Selwyn Simsek [3], Basudha Srivastava [2,1], M. S. Allman, Jake Arkinstall [2], Justin G. Bohnet [1], Nathaniel Q. Burdick [4,1], J. P. Campora, Alex Chernoguzov [1], Samuel F. Cooper [1], Robert D. Delaney [1], Joan M. Dreiling [1], Brian Estey [1], Caroline Figgatt [1], Cameron Foltz [1], John P. Gaebler [1], Alex Hall [1], Craig A. Holliman [5], Ali A. Husain [4], Akhil Isanaka [1], Colin J. Kennedy [1], Yuga Kodama [5], Nikhil Kotibhaskar [3], Nathan K. Lysne [5], Ivaylo S. Madjarov [1], Michael Mills [1], Alistair R. Milne [3], Brian Neyenhuis [1], Annie J. Park [1], Anthony Ransford [1], Adam P. Reed [1], Steven J. Sanders [1], Charles H. Baldwin [1], David Hayes [1], Ben Criger [2], Andrew C. Potter [1], David Amaro [3]

Abstract

High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits, making them promising candidates for quantum computation. Implementing high-rate codes at a scale that both frustrates classical computing and improves performance by encoding requires both high fidelity gates and long-range qubit connectivity -- both of which are offered by trapped-ion quantum computers. Here, we demonstrate computations that outperform their unencoded counterparts in the high-rate $[[ k+2,\, k,\, 2 ]]$ iceberg quantum error detecting (QED) and $[[ (k_2 + 2)(k_1 + 2),\, k_2k_1,\, 4 ]]$ two-level concatenated iceberg QEC codes, using the 98-qubit Quantinuum Helios trapped-ion quantum processor. Utilizing new gadgets for encoded operations, we realize this "beyond break-even" performance with reasonable postselection rates across a range of fault-tolerant (FT) and partially-fault-tolerant (pFT) component and application benchmarks with between $48$ and $94$ logical qubits. These benchmarks include FT state preparation and measurement, QEC cycle benchmarking, logical gate benchmarking, GHZ state preparation, and a pFT quantum simulation of the three-dimensional $XY$ model of quantum magnetism. Additionally, we illustrate that postselection rates can be suppressed by increasing the code distance via concatenation. Our results represent state-of-the-art logical component and state fidelities and provide evidence that high-rate QED/QEC codes are viable on contemporary quantum computers for near-term beyond-classical-scale computation.

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.

Digital quantum magnetism on a trapped-ion quantum computer

Reza Haghshenas, Eli Chertkov, Michael Mills, Wilhelm Kadow, Sheng-Hsuan Lin, Yi-Hsiang Chen, Chris Cade, Ido Niesen, Tomislav Begušić, Manuel S. Rudolph, Cristina Cirstoiu, Kevin Hemery, Conor Mc Keever, Michael Lubasch, Etienne Granet, Charles H. Baldwin, John P. Bartolotta, Matthew Bohn, Justin J. Burau, Julia Cline, Matthew DeCross, Joan M. Dreiling, Cameron Foltz, David Francois, John P. Gaebler, Christopher N. Gilbreth, Johnnie Gray, Dan Gresh, Alex Hall, Aaron Hankin, Azure Hansen, Nathan Hewitt, Craig A. Holliman, Ross B. Hutson, Mohsin Iqbal, Nikhil Kotibhaskar, Elliot Lehman, Dominic Lucchetti, Ivaylo S. Madjarov, Karl Mayer, Alistair R. Milne, Steven A. Moses, Brian Neyenhuis, Gunhee Park, Abigail R. Perry, Boris Ponsioen, Michael Schecter, Peter E. Siegfried, David T. Stephen, Bruce G. Tiemann, Maxwell D. Urmey, James Walker, Andrew C. Potter, David Hayes, Garnet Kin-Lic Chan, Frank Pollmann, Michael Knap, Henrik Dreyer, Michael Foss-Feig

Abstract

Digital quantum matter -- realized when discrete quantum gates approximate continuous time evolution -- is susceptible to heating into chaotic, structureless states. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviors observed in equilibrium systems, ranging from the nontrivial microscopic origins of thermalization itself to the stabilization of effective models hosting exotic emergent properties. Here, we use Quantinuum's system model H2 quantum computer to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics due to approximate energy conservation, and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration. Our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of $99.94(1)\%$), and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.

Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer

Karl Mayer, Ciarán Ryan-Anderson, Natalie Brown, Elijah Durso-Sabina, Charles H. Baldwin, David Hayes, Joan M. Dreiling, Cameron Foltz, John P. Gaebler, Thomas M. Gatterman, Justin A. Gerber, Kevin Gilmore, Dan Gresh, Nathan Hewitt, Chandler V. Horst, Jacob Johansen, Tanner Mengle, Michael Mills, Steven A. Moses, Peter E. Siegfried, Brian Neyenhuis, Juan Pino, Russell Stutz [15]

Abstract

We implement logically encoded three-qubit circuits for the quantum Fourier transform (QFT), using the [[7,1,3]] Steane code, and benchmark the circuits on the Quantinuum H2-1 trapped-ion quantum computer. The circuits require multiple logical two-qubit gates, which are implemented transversally, as well as logical non-Clifford single-qubit rotations, which are performed by non-fault-tolerant state preparation followed by a teleportation gadget. First, we benchmark individual logical components using randomized benchmarking for the logical two-qubit gate, and a Ramsey-type experiment for the logical $T$ gate. We then implement the full QFT circuit, using two different methods for performing a logical control-$T$, and benchmark the circuits by applying it to each basis state in a set of bases that is sufficient to lower bound the process fidelity. We compare the logical QFT benchmark results to predictions based on the logical component benchmarks.

Joint Quantum-State and Measurement Tomography with Incomplete Measurements

Adam C. Keith [1,2], Charles H. Baldwin [1], Scott Glancy [1], E. Knill [1,3]

Abstract

Estimation of quantum states and measurements is crucial for the implementation of quantum information protocols. The standard method for each is quantum tomography. However, quantum tomography suffers from systematic errors caused by imperfect knowledge of the system. We present a procedure to simultaneously characterize quantum states and measurements that mitigates systematic errors by use of a single high-fidelity state preparation and a limited set of high-fidelity unitary operations. Such states and operations are typical of many state-of-the-art systems. For this situation we design a set of experiments and an optimization algorithm that alternates between maximizing the likelihood with respect to the states and measurements to produce estimates of each. In some cases, the procedure does not enable unique estimation of the states. For these cases, we show how one may identify a set of density matrices compatible with the measurements and use a semi-definite program to place bounds on the state's expectation values. We demonstrate the procedure on data from a simulated experiment with two trapped ions.