NHNathan Hewitt

Nathan Hewitt

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Nathan Hewitt has a total of 142 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Improved quantum processor logical error rates via correction and detection

    by A. Paetznick, B. W. Reichardt, M. P. da Silva, C. Ryan-Anderson, D. Aasen, J. M. Bello-Rivas, J. P. Campora, R. Chao, A. Chernoguzov, W. van Dam, et al.

    Performing quantum algorithms for critical problems in physics and chemistry requires substantially lower error rates than the physical error rates of present quantum computers. Achieving such low logical error rates requires quantum error correction1,2 and physical error rates below a critical threshold value3-8. We experimentally demonstrate on a trapped-ion quantum charge-coupled device (QCCD)9,10 improvements in logical error rates ranging from 11× to 800× compared with several physical circuit baselines, including quantum computation on multiple qubits. Our results hinge on two quantum error correction code constructions optimized for an ion-trap processor: a 12-qubit code encoding two qubits inspired by Knill11 and a 16-qubit tesseract colour code encoding four qubits12,13. These constructions are combined with a scalable method of error detection and post-selection to achieve reduced logical error rates. Our results show that state-of-the-art quantum devices are already able to make use of fault tolerance and error correction to strongly suppress errors in non-trivial quantum circuit computations.


  • Top Cited Papers

    Digital quantum magnetism on a trapped-ion quantum computer

    by R. Haghshenas, E. Chertkov, M. Mills, W. Kadow, S.-H. Lin, Y. H. Chen, C. Cade, I. Niesen, T. Begušić, M. S. Rudolph, et al.

    Digital quantum matter—realized when discrete quantum gates approximate continuous time evolution—is susceptible to heating into chaotic, structureless states1. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics2,3,4,5,6,7 can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviours observed in equilibrium systems, ranging from the non-trivial microscopic origins of thermalization itself8 to the stabilization of effective models hosting exotic emergent properties. Here we use Quantinuum’s H2 quantum computer9,10 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 owing 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 frustration11,12,13. 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.


  • Open Access

    Qutrit toric code and parafermions in trapped ions

    by Mohsin Iqbal, Anasuya Lyons, Chiu Fan Bowen Lo, Nathanan Tantivasadakarn, Joan Dreiling, Cameron Foltz, Thomas M. Gatterman, Dan Gresh, Nathan Hewitt, Craig A. Holliman, et al.

    The development of programmable quantum devices can be measured by the complexity of many-body states that they are able to prepare. Among the most significant are topologically ordered states of matter, which enable robust quantum information storage and processing. While topological orders are more readily accessible with qudits, experimental realizations have thus far been limited to lattice models of qubits. Here, we prepare and measure a ground state of the $${{\mathbb{Z}}}_{3}$$ Z 3 toric code state on 24 qutrits (obtained by encoding one qutrit into two qubits) in a trapped ion quantum processor with fidelity per qutrit exceeding 96.5(3)%. We manipulate two types of defects which go beyond the conventional qubit toric code: a parafermion, and its bound state which is related to charge conjugation symmetry. We further demonstrate defect fusion and the transfer of entanglement between anyons and defects, which we use to control topological qutrits. Our work opens up the space of long-range entangled states with qudit degrees of freedom for use in quantum simulation and universal error-correcting codes.


  • Experimental demonstration of breakeven for a compact fermionic encoding

    by Ramil Nigmatullin, Kévin Hémery, Khaldoon Ghanem, Steven Moses, Dan Gresh, Peter Siegfried, Michael Mills, Thomas Gatterman, Nathan Hewitt, Etienne Granet, et al.


  • Probing Critical States of Matter on a Digital Quantum Computer

    by Reza Haghshenas, Eli Chertkov, Matthew DeCross, Thomas M. Gatterman, Justin A. Gerber, Kevin Gilmore, Dan Gresh, Nathan Hewitt, Chandler V. Horst, Mitchell Matheny, et al.

    Although quantum mechanics underpins the microscopic behavior of all materials, its effects are often obscured at the macroscopic level by thermal fluctuations. A notable exception is a zero-temperature phase transition, where scaling laws emerge entirely due to quantum correlations over a diverging length scale. The accurate description of such transitions is challenging for classical simulation methods of quantum systems, and is a natural application space for quantum simulation. These quantum simulations are, however, not without their own challenges-representing quantum critical states on a quantum computer requires encoding entanglement of a large number of degrees of freedom, placing strict demands on the coherence and fidelity of the computer's operations. Using Quantinuum's H1-1 quantum computer, we address these challenges by employing hierarchical quantum tensor-network techniques, creating the ground state of the critical transverse-field Ising chain on 128-sites with sufficient fidelity to extract accurate critical properties of the model. Our results suggest a viable path to quantum-assisted tensor-network contraction beyond the limits of classical methods.


  • Experiments with the four-dimensional surface code on a quantum charge-coupled device quantum computer

    by Noah Berthusen, Joan Dreiling, Cameron Foltz, John P. Gaebler, Thomas M. Gatterman, Dan Gresh, Nathan Hewitt, Michael Mills, Steven A. Moses, Brian Neyenhuis, et al.


  • Top Cited Papers

    High-fidelity teleportation of a logical qubit using transversal gates and lattice surgery

    by C. Ryan-Anderson, N. C. Brown, C. H. Baldwin, J. M. Dreiling, C. Foltz, J. P. Gaebler, T. M. Gatterman, N. Hewitt, C. Holliman, C. V. Horst, et al.

    Quantum state teleportation is commonly used in designs for large-scale quantum computers. Using Quantinuum’s H2 trapped-ion quantum processor, we demonstrate fault-tolerant state teleportation circuits for a quantum error correction code—specifically the Steane code. The circuits use up to 30 qubits at the physical level and employ real-time quantum error correction. We conducted experiments on several variations of logical teleportation circuits using both transversal gates and lattice surgery. We measured the logical process fidelity to be 0.975 ± 0.002 for the transversal teleportation implementation and 0.851 ± 0.009 for the lattice surgery teleportation implementation as well as 0.989 ± 0.002 for an implementation of Knill-style quantum error correction.


  • Open Access

    Fault-tolerant one-bit addition with the smallest interesting color code

    by Yang Wang, Selwyn Simsek, Thomas M. Gatterman, Justin A. Gerber, Kevin Gilmore, Dan Gresh, Nathan Hewitt, Chandler V. Horst, Mitchell Matheny, Tanner Mengle, et al.

    Fault-tolerant operations based on stabilizer codes are the state of the art in suppressing error rates in quantum computations. Most such codes do not permit a straightforward implementation of non-Clifford logical operations, which are necessary to define a universal gate set. As a result, implementations of these operations must use either error-correcting codes with more complicated error correction procedures or gate teleportation and magic states, which are prepared at the logical level, increasing overhead to a degree that precludes near-term implementation. Here, we implement a small quantum algorithm, one-qubit addition, fault-tolerantly on a trapped-ion quantum computer, using the[[8, 3, 2]]color code. By removing unnecessary error correction circuits and using low-overhead techniques for fault-tolerant preparation and measurement, we reduce the number of error-prone two-qubit gates and measurements to 36. We observe arithmetic errors with a rate of ∼1.1 × 10−3for the fault-tolerant circuit and ∼9.5 × 10−3for the unencoded circuit.


  • Top Cited Papers
    Open Access

    Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem

    by Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti, Matthew DeCross, Dylan Herman, Niraj Kumar, Jeffrey Larson, Danylo Lykov, Pierre Minssen, Yue Sun, et al.

    The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.


  • Open Access

    HaloSat Observation of the Virgo Intracluster Medium

    by Nathan H. Hewitt, Philip Kaaret, Chase A. Fuller

    Contained within a galaxy cluster, the Intracluster Medium is comprised of hot, X-ray emitting material between member galaxies. The nearest (∼16.1 Mpc) large galaxy cluster is Virgo. Virgo covers an approximately 12° diameter field, making it challenging to observe in its entirety. The HaloSat satellite utilized a 7° radius field of view to obtain the first full cluster observations since 1994. We then fit the cluster spectra with a plasma emission model of fixed metallicity. Our best fit temperature is kT = 1.39 ± 0.11 keV. We report a cluster luminosity of 5.8 ± 0.7 × 1043 erg s−1 and an emission measure of 5.8 ± 0.6 × 1066 cm−3.