C. Baldwin

Implementing Fault-tolerant Entangling Gates on the Five-qubit Code and the Color Code

C. Ryan-Anderson [1], N. C. Brown [1], M. S. Allman [1], B. Arkin [1], G. Asa-Attuah [2], C. Baldwin [1], J. Berg, J. G. Bohnet [1], S. Braxton [1], N. Burdick [2], J. P. Campora [1], A. Chernoguzov [1], J. Esposito [1], B. Evans [1], D. Francois [1], J. P. Gaebler [1], T. M. Gatterman [1], J. Gerber [1], K. Gilmore [1], D. Gresh [1], A. Hall [1], A. Hankin [1], J. Hostetter [2], D. Lucchetti [1], K. Mayer [1], J. Myers [2], B. Neyenhuis [1], J. Santiago [2], J. Sedlacek [2], T. Skripka [1], A. Slattery [2], R. P. Stutz [1], J. Tait [2], R. Tobey [1], G. Vittorini [2], J. Walker [1], D. Hayes [1]

Abstract

We compare two different implementations of fault-tolerant entangling gates on logical qubits. In one instance, a twelve-qubit trapped-ion quantum computer is used to implement a non-transversal logical CNOT gate between two five qubit codes. The operation is evaluated with varying degrees of fault tolerance, which are provided by including quantum error correction circuit primitives known as flagging and pieceable fault tolerance. In the second instance, a twenty-qubit trapped-ion quantum computer is used to implement a transversal logical CNOT gate on two [[7,1,3]] color codes. The two codes were implemented on different but similar devices, and in both instances, all of the quantum error correction primitives, including the determination of corrections via decoding, are implemented during runtime using a classical compute environment that is tightly integrated with the quantum processor. For different combinations of the primitives, logical state fidelity measurements are made after applying the gate to different input states, providing bounds on the process fidelity. We find the highest fidelity operations with the color code, with the fault-tolerant SPAM operation achieving fidelities of 0.99939(15) and 0.99959(13) when preparing eigenstates of the logical X and Z operators, which is higher than the average physical qubit SPAM fidelities of 0.9968(2) and 0.9970(1) for the physical X and Z bases, respectively. When combined with a logical transversal CNOT gate, we find the color code to perform the sequence--state preparation, CNOT, measure out--with an average fidelity bounded by [0.9957,0.9963]. The logical fidelity bounds are higher than the analogous physical-level fidelity bounds, which we find to be [0.9850,0.9903], reflecting multiple physical noise sources such as SPAM errors for two qubits, several single-qubit gates, a two-qubit gate and some amount of memory error.

Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator

G. Pagano [1,2], A. Bapat [1], P. Becker [1], K. S. Collins [1], A. De [1], P. W. Hess [1,3], H. B. Kaplan [1], A. Kyprianidis [1], W. L. Tan [1], C. Baldwin [1], L. T. Brady [1], A. Deshpande [1], F. Liu [1], S. Jordan [4], A. V. Gorshkov [1], C. Monroe [1]

Abstract

Quantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly improving performance for solving exponentially hard problems, such as optimization and satisfiability. Here we report the implementation of a low-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator. We estimate the ground state energy of the Transverse Field Ising Model with long-range interactions with tunable range and we optimize the corresponding combinatorial classical problem by sampling the QAOA output with high-fidelity, single-shot individual qubit measurements. We execute the algorithm with both an exhaustive search and closed-loop optimization of the variational parameters, approximating the ground state energy with up to 40 trapped-ion qubits. We benchmark the experiment with bootstrapping heuristic methods scaling polynomially with the system size. We observe, in agreement with numerics, that the QAOA performance does not degrade significantly as we scale up the system size, and that the runtime is approximately independent from the number of qubits. We finally give a comprehensive analysis of the errors occurring in our system, a crucial step in the path forward towards the application of the QAOA to more general problem instances.