Search

Resolving the locations and discriminating the spin states of individual trapped ions with high fidelity is critical for a large class of applications in quantum computing, simulation, and sensing. We report on a method for high-fidelity state discrimination in large two-dimensional (2D) crystals with over 100 trapped ions in a single trapping region, combining a novel hardware detector and an artificial neural network. A high-data-rate, spatially resolving, single-photon sensitive timestamping detector performs efficient single-shot detection of 2D crystals in a Penning trap, exhibiting rotation at about $25\,\mathrm{kHz}$. We then train an artificial neural network to process the fluorescence photon data in the rest frame of the rotating crystal in order to identify ion locations with a precision of $~90\%$, accounting for substantial illumination inhomogeneity across the crystal. Finally, employing a time-binned state detection method, we arrive at an average spin-state detection fidelity of $94(1)\%$. This technique can be used to analyze spatial and temporal correlations in arrays of hundreds of trapped-ion qubits., Comment: 7 pages, 4 figures

Identifying and calibrating quantitative dynamical models for physical quantum systems is important for a variety of applications. Here we present a closed-loop Bayesian learning algorithm for estimating multiple unknown parameters in a dynamical model, using optimised experimental "probe" controls and measurement. The estimation algorithm is based on a Bayesian particle filter, and is designed to autonomously choose informationally-optimised probe experiments with which to compare to model predictions. We demonstrate the performance of the algorithm in both simulated calibration tasks and in an experimental single-qubit ion-trap system. Experimentally, we find that with 60x fewer samples, we exceed the precision of conventional calibration methods, delivering an approximately 93x improvement in efficiency (as quantified by the reduction of measurements required to achieve a target residual uncertainty and multiplied by the increase in accuracy). In simulated and experimental demonstrations, we see that successively longer pulses are selected as the posterior uncertainty iteratively decreases, leading to an exponential improvement in the accuracy of model parameters with the number of experimental queries., 18 pages, 8 figures

Conical intersections are ubiquitous in chemistry, often governing processes such as light harvesting, vision, photocatalysis, and chemical reactivity. They act as funnels between electronic states of molecules, allowing rapid and efficient relaxation during chemical dynamics. In addition, when a reaction path encircles a conical intersection, the molecular wavefunction experiences a geometric phase, which affects the outcome of the reaction through quantum-mechanical interference. Past experiments have measured indirect signatures of geometric phases in scattering patterns and spectroscopic observables, but there has been no direct observation of the underlying wavepacket interference. Here, we experimentally observe geometric-phase interference in the dynamics of a nuclear wavepacket travelling around an engineered conical intersection in a programmable trapped-ion quantum simulator. To achieve this, we develop a new technique to reconstruct the two-dimensional wavepacket densities of a trapped ion. Experiments agree with the theoretical model, demonstrating the ability of analog quantum simulators -- such as those realised using trapped ions -- to accurately describe nuclear quantum effects. These results demonstrate a path to deploying analog quantum simulators for solving some of the most difficult problems in chemical dynamics., 9 pages, 5 figures

Spectroscopy is one of the most accurate probes of the molecular world. However, predicting molecular spectra accurately is computationally difficult because of the presence of entanglement between electronic and nuclear degrees of freedom. Although quantum computers promise to reduce this computational cost, existing quantum approaches rely on combining signals from individual eigenstates, an approach that is difficult to scale because the number of eigenstates grows exponentially with molecule size. Here, we introduce a method for scalable analog quantum simulation of molecular spectroscopy, by performing simulations in the time domain. Our approach can treat more complicated molecular models than previous ones, requires fewer approximations, and can be extended to open quantum systems with minimal overhead. We present a direct mapping of the underlying problem of time-domain simulation of molecular spectra to the degrees of freedom and control fields available in a trapped-ion quantum simulator. We experimentally demonstrate our algorithm on a trapped-ion device, exploiting both intrinsic electronic and motional degrees of freedom, showing excellent quantitative agreement for a single-mode vibronic photoelectron spectrum of SO$_2$., 11 pages, 8 figures

We explore the near-term intersection of quantum computing with the transport sector. To support near-term integration, we introduce a framework for assessing the suitability of transport optimization problems for obtaining potential performance enhancement using quantum algorithms. Given a suitable problem, we then present a workflow for obtaining valuable transport solutions using quantum computers, articulate the limitations on contemporary systems, and describe newly available performance-enhancing tools applicable to current commercial quantum computing systems. We make this integration process concrete by following the assessment framework and integration workflow for an exemplary vehicle routing optimization problem: the Capacitated Vehicle Routing Problem. We present novel advances to exponentially reduce the required computational resources, and experimentally demonstrate a prototype implementation exhibiting over 20X circuit performance enhancement on a real quantum device., Accepted as a scientific paper for the 28th ITS World Congress 2022 Los Angeles

Excitement about the promise of quantum computers is tempered by the reality that the hardware remains exceptionally fragile and error-prone, forming a bottleneck in the development of novel applications. In this manuscript, we describe and experimentally test a fully autonomous workflow designed to deterministically suppress errors in quantum algorithms from the gate level through to circuit execution and measurement. We introduce the key elements of this workflow, delivered as a software package called Fire Opal, and survey the underlying physical concepts: error-aware compilation, automated system-wide gate optimization, automated dynamical decoupling embedding for circuit-level error cancellation, and calibration-efficient measurement-error mitigation. We then present a comprehensive suite of performance benchmarks executed on IBM hardware, demonstrating up to > 1000X improvement over the best alternative expert-configured techniques available in the open literature. Benchmarking includes experiments using up to 16 qubit systems executing: Bernstein Vazirani, Quantum Fourier Transform, Grover's Search, QAOA, VQE, Syndrome extraction on a five-qubit Quantum Error Correction code, and Quantum Volume. Experiments reveal a strong contribution of Non-Markovian errors to baseline algorithmic performance; in all cases the deterministic error-suppression workflow delivers the highest performance and approaches incoherent error bounds without the need for any additional sampling or randomization overhead, while maintaining compatibility with all additional probabilistic error suppression techniques., 20 pages, 16 figures

New quantum computing architectures consider integrating qubits as sensors to provide actionable information useful for decoherence mitigation on neighboring data qubits, but little work has addressed how such schemes may be efficiently implemented in order to maximize information utilization. Techniques from classical estimation and dynamic control, suitably adapted to the strictures of quantum measurement, provide an opportunity to extract augmented hardware performance through automation of low-level characterization and control. In this work, we present an autonomous learning framework, Noise Mapping for Quantum Architectures (NMQA), for adaptive scheduling of sensor-qubit measurements and efficient spatial noise mapping (prior to actuation) across device architectures. Via a two-layer particle filter, NMQA receives binary measurements and determines regions within the architecture that share common noise processes; an adaptive controller then schedules future measurements to reduce map uncertainty. Numerical analysis and experiments on an array of trapped ytterbium ions demonstrate that NMQA outperforms brute-force mapping by up-to $18$x ($3$x) in simulations (experiments), calculated as a reduction in the number of measurements required to map a spatially inhomogeneous magnetic field with a target error metric. As an early adaptation of robotic control to quantum devices, this work opens up exciting new avenues in quantum computer science., 9 pages, 4 figures. (Supplements: 6 pages, 3 figures.)

As interest in quantum computing grows, there is a pressing need for standardized API's so that algorithm designers, circuit designers, and physicists can be provided a common reference frame for designing, executing, and optimizing experiments. There is also a need for a language specification that goes beyond gates and allows users to specify the time dynamics of a quantum experiment and recover the time dynamics of the output. In this document we provide a specification for a common interface to backends (simulators and experiments) and a standarized data structure (Qobj --- quantum object) for sending experiments to those backends via Qiskit. We also introduce OpenPulse, a language for specifying pulse level control (i.e. control of the continuous time dynamics) of a general quantum device independent of the specific hardware implementation., 68 pages. More information and schemas can be found in the Qiskit repository https://github.com/Qiskit/

Quantum memory is a central component for quantum information processing devices, and will be required to provide high-fidelity storage of arbitrary states, long storage times and small access latencies. Despite growing interest in applying physical-layer error-suppression strategies to boost fidelities, it has not previously been possible to meet such competing demands with a single approach. Here we use an experimentally validated theoretical framework to identify periodic repetition of a high-order dynamical decoupling sequence as a systematic strategy to meet these challenges. We provide analytic bounds-validated by numerical calculations-on the characteristics of the relevant control sequences and show that a "stroboscopic saturation" of coherence, or coherence plateau, can be engineered, even in the presence of experimental imperfection. This permits high-fidelity storage for times that can be exceptionally long, meaning that our device-independent results should prove instrumental in producing practically useful quantum technologies., and authors list fixed

The presence of long-range quantum spin correlations underlies a variety of physical phenomena in condensed matter systems, potentially including high-temperature superconductivity. However, many properties of exotic strongly correlated spin systems (e.g., spin liquids) have proved difficult to study, in part because calculations involving N-body entanglement become intractable for as few as N~30 particles. Feynman divined that a quantum simulator - a special-purpose "analog" processor built using quantum particles (qubits) - would be inherently adept at such problems. In the context of quantum magnetism, a number of experiments have demonstrated the feasibility of this approach. However, simulations of quantum magnetism allowing controlled, tunable interactions between spins localized on 2D and 3D lattices of more than a few 10's of qubits have yet to be demonstrated, owing in part to the technical challenge of realizing large-scale qubit arrays. Here we demonstrate a variable-range Ising-type spin-spin interaction J_ij on a naturally occurring 2D triangular crystal lattice of hundreds of spin-1/2 particles (9Be+ ions stored in a Penning trap), a computationally relevant scale more than an order of magnitude larger than existing experiments. We show that a spin-dependent optical dipole force can produce an antiferromagnetic interaction J_ij ~ 1/d_ij^a, where a is tunable over 0, Comment: 10 pages, 10 figures; article plus Supplementary Materials

One approach to maintaining phase coherence of qubits through dynamical decoupling consists of applying a sequence of Hahn spin-echo pulses. Recent studies have shown that, in certain noise environments, judicious choice of the delay times between these pulses can greatly improve the suppression of phase errors compared to traditional approaches. By enforcing a simple analytical condition, we obtain sets of dynamical decoupling sequences that are designed for optimized noise filtration and are spectrum-independent up to a single scaling factor set by the coherence time of the system. We demonstrate the efficacy of these sequences in suppressing phase errors through measurements on a model qubit system, $^{9}$Be$^{+}$ ions in a Penning trap. Our combined theoretical and experimental studies show that in high-frequency-dominated noise environments this approach may suppress phase errors orders of magnitude more efficiently than comparable techniques can., 4 pages, 3 figures version 2 - Different nomenclature to describe sequences - More detailed explanation contrasting feedback routine implemented here to that in previous work - Statements on the constraints on noise spectra which will allow improved error suppression added. - Typos corrected and other minor changes made

Given statistics with components Yi = gi(μ+X), i = 1,…,m, and domains D such that, when μ e D, distributions derived applying to Delta method may be used. The case in which X is normal is singled out. Then the approximate distributions are normal and may be applied in situations with high non‐centrality parameter Δ = μtΣ−1μ. where Σ is the variance‐covariance matrix of X.