CFCaroline Figgatt

Caroline Figgatt

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Caroline Figgatt has a total of 143 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Measuring the Loschmidt Amplitude for Finite-Energy Properties of the Fermi-Hubbard Model on an Ion-Trap Quantum Computer

    by Kévin Hémery, Khaldoon Ghanem, Eleanor Crane, Sara L. Campbell, Joan M. Dreiling, Caroline Figgatt, Cameron Foltz, John P. Gaebler, Jacob Johansen, Michael Mills, et al.

    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 ⟨ψ|e−iH^t|ψ⟩ from initial states |ψ⟩ and a time evolution under the Hamiltonian 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.


  • Top Cited Papers

    Non-Abelian topological order and anyons on a trapped-ion processor

    by Mohsin Iqbal, Nathanan Tantivasadakarn, Ruben Verresen, Sara L. Campbell, Joan M. Dreiling, Caroline Figgatt, John P. Gaebler, Jacob Johansen, Michael Mills, Steven A. Moses, et al.

    Non-Abelian topological order is a coveted state of matter with remarkable properties, including quasiparticles that can remember the sequence in which they are exchanged1,2,3,4. These anyonic excitations are promising building blocks of fault-tolerant quantum computers5,6. However, despite extensive efforts, non-Abelian topological order and its excitations have remained elusive, unlike the simpler quasiparticles or defects in Abelian topological order. Here we present the realization of non-Abelian topological order in the wavefunction prepared in a quantum processor 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 D4 topological order on a kagome lattice of 27 qubits, with fidelity per site exceeding 98.4 per cent. By creating and moving anyons along Borromean rings in spacetime, anyon interferometry detects an intrinsically non-Abelian braiding process. Furthermore, tunnelling 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 topological order. This work illustrates the counterintuitive nature of non-Abelions and enables their study in quantum devices.


  • Top Cited Papers
    Open Access

    A Race-Track Trapped-Ion Quantum Processor

    by S. A. Moses, C. H. Baldwin, M. S. Allman, R. Ancona, L. Ascarrunz, C. Barnes, J. Bartolotta, B. Bjork, P. Blanchard, M. Bohn, et al.

    We describe and benchmark a new quantum charge-coupled device (QCCD) trapped-ion quantum computer based on a linear trap with periodic boundary conditions, which resembles a race track. The new system successfully incorporates several technologies crucial to future scalability—including electrode broadcasting, multilayer rf routing, and magneto-optical trap (MOT) loading—while maintaining, and in some cases exceeding, the gate fidelities of previous QCCD systems. The system is initially operated with 32 qubits, but future upgrades will allow for more. We benchmark the performance of primitive operations, including an average state preparation and measurement error of 1.6(1)×10−3, an average single-qubit gate infidelity of 2.5(3)×10−5, and an average two-qubit gate infidelity of 1.84(5)×10−3. The system-level performance of the quantum processor is assessed with mirror benchmarking, linear cross-entropy benchmarking, a quantum volume measurement of QV=216, and the creation of 32-qubit entanglement in a GHZ state. We also tested application benchmarks, including Hamiltonian simulation, QAOA, error correction on a repetition code, and dynamics simulations using qubit reuse. We also discuss future upgrades to the new system aimed at adding more qubits and capabilities.


  • Entanglement from Tensor Networks on a Trapped-Ion Quantum Computer

    by Michael Foss-Feig, Stephen Ragole, Andrew Potter, Joan Dreiling, Caroline Figgatt, John Gaebler, Alex Hall, Steven Moses, Juan Pino, Ben Spaun, et al.

    The ability to selectively measure, initialize, and reuse qubits during a quantum circuit enables a mapping of the spatial structure of certain tensor-network states onto the dynamics of quantum circuits, thereby achieving dramatic resource savings when simulating quantum systems with limited entanglement. We experimentally demonstrate a significant benefit of this approach to quantum simulation: the entanglement structure of an infinite system—specifically the half-chain entanglement spectrum—is conveniently encoded within a small register of “bond qubits” and can be extracted with relative ease. Using Honeywell’s model H0 quantum computer equipped with selective midcircuit measurement and reset, we quantitatively determine the near-critical entanglement entropy of a correlated spin chain directly in the thermodynamic limit and show that its phase transition becomes quickly resolved upon expanding the bond-qubit register.


  • Suppression of midcircuit measurement crosstalk errors with micromotion

    by J. P. Gaebler, C. H. Baldwin, S. A. Moses, J. M. Dreiling, C. Figgatt, M. Foss-Feig, D. Hayes, J. M. Pino

    Midcircuit measurement and reset are crucial primitives in quantum computation, but such operations require strong interactions with selected qubits while maintaining isolation of neighboring qubits, which is a significant challenge in many systems. For trapped ion systems, measurement is performed with laser-induced fluorescence. Stray light from the detection beam and fluorescence from the measured ions can be significant sources of decoherence for unmeasured qubits. We present a technique using ion micromotion to reduce these sources of decoherence by over an order of magnitude. We benchmark the performance with a different method, based on randomized benchmarking, to estimate the magnitude of crosstalk errors on nearby qubits. Using the Honeywell System Model H0, we demonstrate measurement and reset on select qubits with low crosstalk errors on neighboring qubits.


  • Parallel entangling operations on a universal ion-trap quantum computer

    by C. Figgatt, A. Ostrander, N. M. Linke, K. A. Landsman, D. Zhu, D. Maslov, C. Monroe

    The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations1. The ability to execute parallel entangling quantum gates offers efficiency gains in numerous quantum circuits2,3,4, as well as for entire algorithms—such as Shor’s factoring algorithm5—and quantum simulations6,7. In circuits such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time through the divide-and-conquer technique8. More importantly, quantum gate parallelism is essential for fault-tolerant error correction of qubits that suffer from idle errors9,10. However, the implementation of parallel quantum gates is complicated by potential crosstalk, especially between qubits that are fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions11,12 or cavity-coupled superconducting transmons13. Here we present experimental results for parallel two-qubit entangling gates in an array of fully connected trapped 171Yb+ ion qubits. We perform a one-bit full-addition operation on a quantum computer using a depth-four quantum circuit4,14,15, where circuit depth denotes the number of runtime steps required. Our method exploits the power of highly connected qubit systems using classical control techniques and will help to speed up quantum circuits and achieve fault tolerance in trapped-ion quantum computers.


  • Open Access

    Parallel Entangling Operations on a Universal Ion Trap Quantum Computer

    by C. Figgatt, A. Ostrander, N. M. Linke, K. A. Landsman, D. Zhu, D. Maslov, C. Monroe

    The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling quantum gates offers clear efficiency gains in numerous quantum circuits as well as for entire algorithms such as Shor's factoring algorithm and quantum simulations. In cases such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time. More importantly, quantum gate parallelism is essential for the practical fault-tolerant error correction of qubits that suffer from idle errors. The implementation of parallel quantum gates is complicated by potential crosstalk, especially between qubits fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions or cavity-coupled superconducting transmons. Here, we present the first experimental results for parallel 2-qubit entangling gates in an array of fully-connected trapped ion qubits. We demonstrate an application of this capability by performing a 1-bit full addition operation on a quantum computer using a depth-4 quantum circuit. These results exploit the power of highly connected qubit systems through classical control techniques, and provide an advance toward speeding up quantum circuits and achieving fault tolerance with trapped ion quantum computers.

  • Open Access

    Complete 3-Qubit Grover search on a programmable quantum computer

    by C. Figgatt, D. Maslov, K. A. Landsman, N. M. Linke, S. Debnath, C. Monroe

    The Grover quantum search algorithm is a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.