Yi-Hsiang Chen

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.

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.

Robustness of near-thermal dynamics on digital quantum computers

Eli Chertkov [1], Yi-Hsiang Chen [1], Michael Lubasch [2], David Hayes [1], Michael Foss-Feig [1]

Abstract

Understanding the impact of gate errors on quantum circuits is crucial to determining the potential applications of quantum computers, especially in the absence of large-scale error-corrected hardware. We put forward analytical arguments, corroborated by extensive numerical and experimental evidence, that Trotterized quantum circuits simulating the time-evolution of systems near thermal equilibrium are substantially more robust to both quantum gate errors and Trotter (discretization) errors than is widely assumed. In Quantinuum's trapped-ion computers, the weakly entangling gates that appear in Trotterized circuits can be implemented natively, and their error rate is smaller when they generate less entanglement; from benchmarking, we know that the error for a gate $\exp[-i (Z\otimes Z) τ]$ decreases roughly linearly with $τ$, up to a small offset at $τ= 0$. We provide extensive evidence that this scaling, together with the robustness of near-thermal dynamics to both gate and discretization errors, facilitates substantial improvements in the achievable accuracy of Trotterized dynamics on near-term quantum computers. We make heavy use of a new theoretical tool -- a statistical ensemble of random product states that approximates a thermal state, which can be efficiently prepared with low noise on quantum computers. We outline how the random product state ensemble can be used to predict, optimize, and design Hamiltonian simulation experiments on near-thermal quantum systems.