Anthony Ransford

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.

Barium Autoionization for Efficient Ion Trap Loading

Zachary J. Wall [1], Justin D. Piel [2], Samuel R. Vizvary [1], Michael Bareian [1], Steven Diaz [1], Elijah Mossman [1], Anthony Ransford [3], Chris H. Greene [2], Eric R. Hudson [1,4,5], Wesley C. Campbell [1,4,5]

Abstract

We report a theoretical and experimental investigation of autoionizing resonances from the $5d6p\,{}^3\mathrm{D}_1^o$ manifold in neutral barium for efficient loading of ion traps. Our calculations predict large resonant cross sections for many narrow autoionizing resonances, but we find experimentally that for most of these, Doppler broadening during trap loading depresses the effective cross sections that can be achieved in practice. We identify and demonstrate a strong, broad transition at $531\,\mathrm{nm}$, and show that it furnishes an order-of-magnitude increase in trap loading efficiency compared to other demonstrated resonances.

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 amplification by dynamically probing remote random quantum states

Minzhao Liu [1], Pradeep Niroula [1], Matthew DeCross [2], Cameron Foreman [3], Wen Yu Kon [1], Ignatius William Primaatmaja [1,2], M. S. Allman, J. P. Campora, Akhil Isanaka [2], Kartik Singhal [2], Omar Amer [1], Shouvanik Chakrabarti [1], Kaushik Chakraborty [1], Samuel F. Cooper [2], Robert D. Delaney [2], Joan M. Dreiling [2], Brian Estey [2], Caroline Figgatt [2], Cameron Foltz [2], John P. Gaebler [2], Alex Hall [2], Zichang He [1], Craig A. Holliman [4], Travis S. Humble [5], Shih-Han Hung [6], Ali A. Husain [7], Yuwei Jin [1], Fatih Kaleoglu [1], Colin J. Kennedy [2], Nikhil Kotibhaskar [3], Nathan K. Lysne [4], Ivaylo S. Madjarov [2], Michael Mills [2], Alistair R. Milne [3], Kevin Milner [3], Louis Narmour [2], Sivaprasad Omanakuttan [1], Annie J. Park [2], Michael A. Perlin [1], Adam P. Reed [2], Chris N. Self [8], Matthew Steinberg [1], David T. Stephen [2], Joseph Sullivan [1], Alex Chernoguzov [2], Florian J. Curchod [8], Anthony Ransford [2], Justin G. Bohnet [2], Brian Neyenhuis [2], Michael Foss-Feig [2], Rob Otter [1], Ruslan Shaydulin [1]

Abstract

Cryptography depends on truly unpredictable numbers, but physical sources emit biased or correlated bits. Quantum mechanics enables the amplification of imperfect randomness into nearly perfect randomness, but prior demonstrations have required physically co-located, loophole-free Bell tests, constraining the feasibility of remote operation. Here we realize certified randomness amplification across a network by dynamically probing large, entangled quantum states on Quantinuum's 98-qubit Helios trapped-ion quantum processor. Our protocol is secure even if the remote device acts maliciously or is compromised by an intercepting adversary, provided the samples are generated quickly enough to preclude classical simulation of the quantum circuits. We stream quantum gates in real time to the quantum processor, maintain quantum state coherence for $\approx 0.9$ seconds, and then reveal the measurement bases to the quantum processor only milliseconds before measurement. This limits the time for classical spoofing to 30 ms and constrains the location of hypothetical adversaries to a $4{,}500$ km radius. We achieve a fidelity of 0.586 on random circuits with 64 qubits and 276 two-qubit gates, enabling the amplification of realistic imperfect randomness with a low entropy rate into nearly perfect randomness.

Realization of a Quantum Streaming Algorithm on Long-lived Trapped-ion Qubits

Pradeep Niroula [1], Shouvanik Chakrabarti [1], Steven Kordonowy [1], Niraj Kumar [1], Sivaprasad Omanakuttan [1], Michael A. Perlin [1,2], M. S. Allman, J. P. Campora, Alex Chernoguzov [2], Samuel F. Cooper [2], Robert D. Delaney [2], Joan M. Dreiling [2], Brian Estey [2], Caroline Figgatt [2], Cameron Foltz [2], John P. Gaebler [2], Alex Hall [2], Ali A. Husain [3], Akhil Isanaka [2], Colin J. Kennedy [2], Nikhil Kotibhaskar [4], Ivaylo S. Madjarov [2], Michael Mills [2], Alistair R. Milne [4], Louis Narmour [2], Annie J. Park [2], Adam P. Reed [2], Kartik Singhal [2], Anthony Ransford [2], Justin G. Bohnet [2], Brian Neyenhuis [2], Rob Otter [1], Ruslan Shaydulin [1]

Abstract

Large classical datasets are often processed in the streaming model, with data arriving one item at a time. In this model, quantum algorithms have been shown to offer an unconditional exponential advantage in space. However, experimentally implementing such streaming algorithms requires qubits that remain coherent while interacting with an external data stream. In this work, we realize such a data-streaming model using Quantinuum Helios trapped-ion quantum computer with long-lived qubits that communicate with an external server. We implement a quantum pair sketch, which is the primitive underlying many quantum streaming algorithms, and use it to solve Hidden Matching, a problem known to exhibit a theoretical exponential quantum advantage in space. Furthermore, we compile the quantum streaming algorithm to fault-tolerant quantum architectures based on surface and bivariate bicycle codes and show that the quantum space advantage persists even with the overheads of fault-tolerance.

Superconducting pairing correlations on a trapped-ion quantum computer

Etienne Granet [1], Sheng-Hsuan Lin [1], Kevin Hémery, Reza Haghshenas [2], Pablo Andres-Martinez [3], David T. Stephen [2], Anthony Ransford [2], Jake Arkinstall [3,2], M. S. Allman, Pete Campora [2], Samuel F. Cooper [2], Robert D. Delaney [2], Joan M. Dreiling [2], Brian Estey [2], Caroline Figgatt [2], Cameron Foltz [2], John P. Gaebler [2], Alex Hall [2], Ali Husain [4], Akhil Isanaka [2], Colin J. Kennedy [2], Nikhil Kotibhaskar [5], Ivaylo S. Madjarov [2], Michael Mills [2], Alistair R. Milne [5], Annie J. Park [2], Adam P. Reed [2], Brian Neyenhuis [2], Justin G. Bohnet [2], Michael Foss-Feig [2], Andrew C. Potter [2], Ramil Nigmatullin [3], Mohsin Iqbal [1], Henrik Dreyer [1]

Abstract

The Fermi-Hubbard model is the starting point for the simulation of many strongly correlated materials, including high-temperature superconductors, whose modelling is a key motivation for the construction of quantum simulation and computing devices. However, the detection of superconducting pairing correlations has so far remained out of reach, both because of their off-diagonal character - which makes them inaccessible to local density measurements - and because of the difficulty of preparing superconducting states. Here, we report measurement of significant pairing correlations in three different regimes of Fermi-Hubbard models simulated on Quantinuum's Helios trapped-ion quantum computer. Specifically, we measure non-equilibrium pairing induced by an electromagnetic field in the half-filled square lattice model, d-wave pairing in an approximate ground state of the checkerboard Hubbard model at $1/6$-doping, and s-wave pairing in a bilayer model relevant to nickelate superconductors. These results show that a quantum computer can reliably create and probe physically relevant states with superconducting pairing correlations, opening a path to the exploration of superconductivity with quantum computers.

Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer

Kévin Hémery, Khaldoon Ghanem [1], Eleanor Crane [1,2], Sara L. Campbell [3], Joan M. Dreiling [3], Caroline Figgatt [3], Cameron Foltz [3], John P. Gaebler [3], Jacob Johansen [3], Michael Mills [3], Steven A. Moses [3], Juan M. Pino [3], Anthony Ransford [3], Mary Rowe [3], Peter Siegfried [3], Russell P. Stutz [3], Henrik Dreyer [1], Alexander Schuckert [1,2], Ramil Nigmatullin [4]

Abstract

Calculating the equilibrium properties of condensed matter systems is one of the promising applications of near-term quantum computing. Recently, hybrid quantum-classical time-series algorithms have been proposed to efficiently extract these properties from a measurement of the Loschmidt amplitude $\langle ψ| e^{-i \hat H t}|ψ\rangle$ from initial states $|ψ\rangle$ and a time evolution under the Hamiltonian $\hat H$ up to short times $t$. In this work, we study the operation of this algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a $16$-site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We assess the effect of noise on the Loschmidt amplitude and implement algorithm-specific error mitigation techniques. By using a thus-motivated error model, we numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies. Finally, we estimate the resources needed for scaling up the algorithm.

Non-Abelian Topological Order and Anyons on a Trapped-Ion Processor

Mohsin Iqbal [1], Nathanan Tantivasadakarn [2], Ruben Verresen [3], Sara L. Campbell [4], Joan M. Dreiling [4], Caroline Figgatt [4], John P. Gaebler [4], Jacob Johansen [4], Michael Mills [4], Steven A. Moses [4], Juan M. Pino [4], Anthony Ransford [4], Mary Rowe [4], Peter Siegfried [4], Russell P. Stutz [4], Michael Foss-Feig [4], Ashvin Vishwanath [3], Henrik Dreyer [1]

Abstract

Non-Abelian topological order (TO) is a coveted state of matter with remarkable properties, including quasiparticles that can remember the sequence in which they are exchanged. These anyonic excitations are promising building blocks of fault-tolerant quantum computers. However, despite extensive efforts, non-Abelian TO and its excitations have remained elusive, unlike the simpler quasiparticles or defects in Abelian TO. In this work, we present the first unambiguous realization of non-Abelian TO and demonstrate control of its anyons. Using an adaptive circuit on Quantinuum's H2 trapped-ion quantum processor, we create the ground state wavefunction of $D_4$ TO on a kagome lattice of 27 qubits, with fidelity per site exceeding $98.4\%$. By creating and moving anyons along Borromean rings in spacetime, anyon interferometry detects an intrinsically non-Abelian braiding process. Furthermore, tunneling non-Abelions around a torus creates all 22 ground states, as well as an excited state with a single anyon -- a peculiar feature of non-Abelian TO. This work illustrates the counterintuitive nature of non-Abelions and enables their study in quantum devices.

High fidelity state preparation and measurement of ion hyperfine qubits with I > 1/2

Fangzhao Alex An [1], Anthony Ransford [2], Andrew Schaffer [1], Lucas R. Sletten [1], John Gaebler [2], James Hostetter [1], Grahame Vittorini [1]

Abstract

We present a method for achieving high fidelity state preparation and measurement (SPAM) using trapped ion hyperfine qubits with nuclear spins higher than $I = 1/2$. The ground states of these higher nuclear spin isotopes do not afford a simple frequency-selective state preparation scheme. We circumvent this limitation by stroboscopically driving strong and weak transitions, blending fast optical pumping using dipole transitions and narrow microwave or optical quadrupole transitions. We demonstrate this method with the $I=3/2$ isotope $^{137}\mbox{Ba}^+$ to achieve a SPAM infidelity of $\left(9.0 \pm 1.3\right) \times 10^{-5}$ ($-40.5 \pm 0.6$ dB), facilitating the use of a wider range of ion isotopes with favorable wavelengths and masses for quantum computation.

Coherent control for qubit state readout

Conrad Roman [1], Anthony Ransford [1], Michael Ip [1], Wesley C. Campbell [1]

Abstract

Short pulses from mode-locked lasers can produce background-free atomic fluorescence by allowing temporal separation of the prompt incidental scatter from the subsequent atomic emission. We use this to improve quantum state detection of optical-frequency and electron-shelved trapped ion qubits by more than 2 orders of magnitude. For direct detection of qubits defined on atomic hyperfine structure, however, the large bandwidth of short pulses is greater than the hyperfine splitting, and repeated excitation is not qubit state selective. Here, we show that the state resolution needed for projective quantum measurement of hyperfine qubits can be recovered by applying techniques from coherent control to the orbiting valence electron of the queried ion. We demonstrate electron wavepacket interference to allow readout of the original qubit state using broadband pulses, even in the presence of large amounts of background laser scatter.

Phonon lasing from optical frequency comb illumination of a trapped ion

Michael Ip [1], Anthony Ransford [1], Andrew M. Jayich [2], Xueping Long [1], Conrad Roman [1], Wesley C. Campbell [1]

Abstract

An atomic transition can be addressed by a single tooth of an optical frequency comb if the excited state lifetime ($τ$) is significantly longer than the pulse repetition period ($T_\mathrm{r}$). In the crossover regime between fully-resolved and unresolved comb teeth ($τ\lessapprox T_\mathrm{r}$), we observe Doppler cooling of a pre-cooled trapped atomic ion by a single tooth of a frequency-doubled optical frequency comb. We find that for initially hot ions, a multi-tooth effect gives rise to lasing of the ion's harmonic motion in the trap, verified by acoustic injection locking. The gain saturation of this phonon laser action leads to a comb of steady-state oscillation amplitudes, allowing hot ions to be loaded directly into the trap and laser cooled to crystallization despite the presence of hundreds of blue-detuned teeth.

Achieving translational symmetry in trapped cold ion rings

Hao-Kun Li [1], Erik Urban [2], Crystal Noel [2], Alexander Chuang [2], Yang Xia [1], Anthony Ransford [2], Boerge Hemmerling [2], Yuan Wang [1,3], Tongcang Li [1,2,3], Hartmut Haeffner, Xiang Zhang [1,3]

Abstract

Spontaneous symmetry breaking is a universal concept throughout science. For instance, the Landau-Ginzburg paradigm of translational symmetry breaking underlies the classification of nearly all quantum phases of matter and explains the emergence of crystals, insulators, and superconductors. Usually, the consequences of translational invariance are studied in large systems to suppress edge effects which cause undesired symmetry breaking. While this approach works for investigating global properties, studies of local observables and their correlations require access and control of the individual constituents. Periodic boundary conditions, on the other hand, could allow for translational symmetry in small systems where single particle control is achievable. Here, we crystallize up to fifteen 40Ca+ ions in a microscopic ring with inherent periodic boundary conditions. We show the ring's translational symmetry is preserved at millikelvin temperatures by delocalizing the Doppler laser cooled ions. This establishes an upper bound for undesired symmetry breaking at a level where quantum control becomes feasible. These findings pave the way towards studying quantum many-body physics with translational symmetry at the single particle level in a variety of disciplines from simulation of Hawking radiation to exploration of quantum phase transitions.