Neal Erickson

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.

Certified randomness using a trapped-ion quantum processor

Minzhao Liu [1,3,4], Ruslan Shaydulin [1], Pradeep Niroula [1], Matthew DeCross [2], Shih-Han Hung [5,6], Wen Yu Kon [1], Enrique Cervero-Martín, Kaushik Chakraborty [1], Omar Amer [1], Scott Aaronson [5], Atithi Acharya [1], Yuri Alexeev [3], K. Jordan Berg [2], Shouvanik Chakrabarti [1], Florian J. Curchod [7], Joan M. Dreiling [2], Neal Erickson [2], Cameron Foltz [2], Michael Foss-Feig [2], David Hayes [2], Travis S. Humble [8], Niraj Kumar [1], Jeffrey Larson [9], Danylo Lykov [1,3], Michael Mills [2], Steven A. Moses [2], Brian Neyenhuis [2], Shaltiel Eloul [1], Peter Siegfried [2], James Walker [2], Charles Lim [1], Marco Pistoia [1]

Abstract

While quantum computers have the potential to perform a wide range of practically important tasks beyond the capabilities of classical computers, realizing this potential remains a challenge. One such task is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy. Certified randomness has many applications but is fundamentally impossible to achieve solely by classical computation. In this work, we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations: a client generates quantum "challenge" circuits using a small randomness seed, sends them to an untrusted quantum server to execute, and verifies the server's results. We analyze the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of $1.1\times10^{18}$ floating-point operations per second across multiple supercomputers, we certify $71,313$ bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of today's quantum computers.