EJEric B. Jones

Eric B. Jones

*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


Eric B. Jones has a total of 78 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    Universal Neutral-Atom Quantum Computer with Individual Optical Addressing and Nondestructive Readout

    by A.G. Radnaev, W.C. Chung, D.C. Cole, D. Mason, T.G. Ballance, M.J. Bedalov, D.A. Belknap, M.R. Berman, M. Blakely, I.L. Bloomfield, et al.

    Quantum computers must achieve large-scale fault-tolerant operation to deliver on their promise of transformational processing power. This will require thousands or millions of high-fidelity quantum gates and similar numbers of qubits. Demonstrations using neutral-atom qubits trapped and manipulated by lasers have shown that this modality can provide high two-qubit gate () fidelities and scalable operation. However, the gates in these demonstrations are driven by lasers that do not resolve individual qubits, with universal computation enabled by physical midcircuit shuttling of the qubits. This relatively slow operation may greatly extend run times for useful large-scale computation. Here, we demonstrate a universal neutral-atom quantum computer with gate rates limited by optical switching times, rather than shuttling, by individually addressing tightly focused laser beams at an array of single atoms. We achieve fidelity of 99.35(4)% and local single-qubit R Z gate fidelity of 99.902(8)% in both cases accounting for leakage out of the computational basis. Moreover, we demonstrate nondestructive readout of alkali-atom qubits with 0.9(3)% loss, which boosts operational speed. This technique also enables us to measure a state-of-the-art fidelity of 99.73(3)% when excluding atom-loss events, which may be mitigated through erasure conversion. Our results represent a critical step toward large-scale fault-tolerant neutral-atom quantum computers that can execute computations on practical timescales.


  • Open Access

    Dynamic, symmetry-preserving, and hardware-adaptable circuits for quantum computing many-body states and correlators of the Anderson impurity model

    by Eric B. Jones, Cody James Winkleblack, Colin Campbell, Caleb Rotello, Edward D. Dahl, Matthew Reynolds, Peter Graf, Wesley Jones

    We present a hardware-reconfigurable ansatz on N q -qubits for the variational preparation of many-body states of the Anderson impurity model (AIM) with N imp + N bath = N q / 2 sites, which conserves total charge and spin z component within each variational search subspace. The many-body ground state of the AIM is determined as the minimum over all minima of O ( N q 2 ) distinct charge-spin sectors. Hamiltonian expectation values are shown to require ω ( N q ) < N meas. ≤ O ( N imp N bath ) symmetry-preserving, parallelizable measurement circuits, each amenable to postselection. To obtain the one-particle impurity Green's function we show how initial Krylov vectors can be computed via midcircuit measurement and how Lanczos iterations can be computed using the symmetry-preserving ansatz. For a single-impurity Anderson model with a number of bath sites increasing from one to seven, we show using numerical emulation that the ease of variational ground-state preparation is suggestive of linear scaling in circuit depth and subquartic scaling in optimizer complexity. We therefore expect that, combined with time-dependent methods for Green's function computation, our ansatz provides a useful tool to account for electronic correlations on early fault-tolerant processors. Finally, with a view towards computing real materials properties of interest like magnetic susceptibilities and electron-hole propagators, we provide a straightforward method to compute many-body, time-dependent correlation functions using a combination of time evolution, midcircuit measurement-conditioned operations, and the Hadamard test. Published by the American Physical Society 2025


  • Open Access

    Automated detection of symmetry-protected subspaces in quantum simulations

    by Caleb Rotello, Eric B. Jones, Peter Graf, Eliot Kapit

    The analysis of symmetry in quantum systems is of utmost theoretical importance, useful in a variety of applications and experimental settings, and difficult to accomplish in general. Symmetries imply conservation laws, which partition Hilbert space into invariant subspaces of the time-evolution operator, each of which is demarcated according to its conserved quantity. We show that, starting from a chosen basis, any invariant, symmetry-protected subspaces which are diagonal in that basis are discoverable using transitive closure on graphs representing state-to-state transitions under k-local unitary operations. Importantly, the discovery of these subspaces relies neither upon the explicit identification of a symmetry operator or its eigenvalues nor upon the construction of matrices of the full Hilbert space dimension. We introduce two classical algorithms, which efficiently compute and elucidate features of these subspaces. The first algorithm explores the entire symmetry-protected subspace of an initial state in time complexity linear to the size of the subspace by closing local basis state-to-basis state transitions. The second algorithm determines, with bounded error, if a given measurement outcome of a dynamically generated state is within the symmetry-protected subspace of the state in which the dynamical system is initialized. We demonstrate the applicability of these algorithms by performing postselection on data generated from emulated noisy quantum simulations of three different dynamical systems: the Heisenberg-XXX model and the T6 and F4 quantum cellular automata. Due to their efficient computability and indifference to identifying the underlying symmetry, these algorithms lend themselves to the postselection of quantum computer data, optimized classical simulation of quantum systems, and discovery of previously hidden symmetries in quantum mechanical systems.


  • Open Access

    Automated detection of symmetry-protected subspaces in quantum simulations

    by Caleb Rotello, Eric B. Jones, Peter Graf, Eliot Kapit

    The analysis of symmetry in quantum systems is of utmost theoretical importance, useful in a variety of applications and experimental settings, and is difficult to accomplish in general. Symmetries imply conservation laws, which partition Hilbert space into invariant subspaces of the time-evolution operator, each of which is demarcated according to its conserved quantity. We show that, starting from a chosen basis, any invariant, symmetry-protected subspaces which are diagonal in that basis are discoverable using transitive closure on graphs representing state-to-state transitions under $k$-local unitary operations. Importantly, the discovery of these subspaces relies neither upon the explicit identification of a symmetry operator or its eigenvalues nor upon the construction of matrices of the full Hilbert space dimension. We introduce two classical algorithms, which efficiently compute and elucidate features of these subspaces. The first algorithm explores the entire symmetry-protected subspace of an initial state in time complexity linear to the size of the subspace by closing local basis state-to-basis state transitions. The second algorithm determines, with bounded error, if a given measurement outcome of a dynamically-generated state is within the symmetry-protected subspace of the state in which the dynamical system is initialized. We demonstrate the applicability of these algorithms by performing post-selection on data generated from emulated noisy quantum simulations of three different dynamical systems: the Heisenberg-XXX model and the $T_6$ and $F_4$ quantum cellular automata. Due to their efficient computability and indifference to identifying the underlying symmetry, these algorithms lend themselves to the post-selection of quantum computer data, optimized classical simulation of quantum systems, and the discovery of previously hidden symmetries in quantum mechanical systems.

  • Open Access

    Small-world complex network generation on a digital quantum processor

    by Eric B. Jones, Logan E. Hillberry, Matthew T. Jones, Mina Fasihi, Pedram Roushan, Zhang Jiang, Alan Ho, Charles Neill, Eric Ostby, Peter Graf, et al.

    Quantum cellular automata (QCA) evolve qubits in a quantum circuit depending only on the states of their neighborhoods and model how rich physical complexity can emerge from a simple set of underlying dynamical rules. The inability of classical computers to simulate large quantum systems hinders the elucidation of quantum cellular automata, but quantum computers offer an ideal simulation platform. Here, we experimentally realize QCA on a digital quantum processor, simulating a one-dimensional Goldilocks rule on chains of up to 23 superconducting qubits. We calculate calibrated and error-mitigated population dynamics and complex network measures, which indicate the formation of small-world mutual information networks. These networks decohere at fixed circuit depth independent of system size, the largest of which corresponding to 1,056 two-qubit gates. Such computations may enable the employment of QCA in applications like the simulation of strongly-correlated matter or beyond-classical computational demonstrations.


  • Metastable materials discovery in the age of large-scale computation

    by Félix Therrien, Eric B. Jones, Vladan Stevanović

    Computational materials discovery has been successful in predicting novel, technologically relevant materials. However, it has remained focused almost exclusively on finding ground-state structures. Now that the lower-hanging fruit has been found in many fields of application, materials exploration is moving toward metastable materials: higher energy phases that are stable at practical time scales. Because of the challenges associated with predicting which phases are realistic, this class of materials has remained relatively unexplored, despite numerous examples of metastable structures with unmatched properties (e.g., diamond). This article highlights recent advances in developing computational and theoretical methods for predicting useful and realizable metastable materials. Topics discussed cover (1) the latest strategies for identifying potential metastable phases, (2) methodologies for assessing which phases can be realized experimentally, and (3) current approaches to estimate the lifetime of metastable materials.


  • Open Access

    K-spin Hamiltonian for quantum-resolvable Markov decision processes

    by Eric B. Jones, Peter Graf, Eliot Kapit, Wesley Jones


  • Open Access

    The glassy solid as a statistical ensemble of crystalline microstates

    by Eric B. Jones, Vladan Stevanović

    We present an alternative and, for the purpose of non-crystalline materials design, a more suitable description of covalent and ionic glassy solids as statistical ensembles of crystalline local minima on the potential energy surface. Motivated by the concept of partially broken ergodicity, we analytically formulate the set of approximations under which the structural features of ergodic systems such as the radial distribution function (RDF) and powder X-ray diffraction (XRD) intensity can be rigorously expressed as statistical ensemble averages over different local minima. Validation is carried out by evaluating these ensemble averages for elemental Si and SiO2 over the local minima obtained through the first-principles random structure sampling that we performed using relatively small simulation cells, thereby restricting the sampling to a set of predominantly crystalline structures. The comparison with XRD and RDF from experiments (amorphous silicon) and molecular dynamics simulations (glassy SiO2) shows excellent agreement, thus supporting the ensemble picture of glasses and opening the door to fully predictive description without the need for experimental inputs.