arXiv subjects

David Hayes

Publications and source records attributed to David Hayes.

35 records · Page 2Linked to original sources

arXiv2024

Laser cooling trapped-ion crystal modes beyond the Lamb-Dicke regime

Laser cooling methods for trapped ions are most commonly studied at low energies, i.e., in the Lamb-Dicke regime. However, ions in experiments are often excited to higher energies for which the Lamb-Dicke approximation breaks down. Here we construct a non-perturbative, semiclassical method for predicting the energy-dependent cooling dynamics of trapped-ion crystals with potentially many internal levels and motional modes beyond the Lamb-Dicke regime. This method allows accurate and efficient modeling of a variety of interesting phenomena, such as the breakdown of EIT cooling at high energies and the simultaneous cooling of multiple high-temperature modes. We compare its predictions both to fully-quantum simulations and to experimental data for a broadband EIT cooling method on a Raman $S$-$D$ transition in $^{138}$Ba${^+}$. We find the method can accurately predict cooling rates over a wide range of energies relevant to trapped ion experiments. Our method complements fully quantum models by allowing for fast and accurate predictions of laser-cooling dynamics at much higher energy scales.

physics.atom-ph↗

arXiv2024

Scalable Multispecies Ion Transport in a Grid-Based Surface-Electrode Trap

Quantum processors based on linear arrays of trapped ions have achieved exceptional performance, but scaling to large qubit numbers requires realizing two-dimensional ion arrays as envisioned in the quantum charge-coupled device (QCCD) architecture. Here we present a scalable method for the control of ion crystals in a grid-based surface-electrode Paul trap and characterize it in the context of transport operations that sort and reorder multispecies crystals. By combining cowiring of control electrodes at translationally symmetric locations in each grid site with the sitewise ability to exchange the voltages applied to two special electrodes gated by a binary input, site dependent operations can be achieved using only a fixed number of analog voltage signals and a single digital input per site. In two separate experimental systems containing nominally identical grid traps, one using $^{171}\mathrm{Yb}^{+}$-$^{138}\mathrm{Ba}^{+}$ crystals and the other $^{137}\mathrm{Ba}^{+}$-$^{88}\mathrm{Sr}^{+}$, we demonstrate this method by characterizing the conditional intrasite crystal reorder and the conditional exchange of ions between adjacent sites on the grid. Averaged across a multisite region of interest, we measure subquanta motional excitation in the axial in-phase and out-of-phase modes of the crystals following these operations at exchange rates of 2.5 kHz. In this initial demonstration, the logic controlling the voltage exchange occurs in software, but the applied signals mimic a proposed hardware implementation using crossover switches. These techniques can be further extended to implement other conditional operations in the QCCD architecture such as gates, initialization and measurement.

quant-ph↗

arXiv2024

Robustness of near-thermal dynamics on digital quantum computers

Understanding the impact of gate errors on quantum circuits is crucial to determining the potential applications of quantum computers, especially in the absence of large-scale error-corrected hardware. We put forward analytical arguments, corroborated by extensive numerical and experimental evidence, that Trotterized quantum circuits simulating the time-evolution of systems near thermal equilibrium are substantially more robust to both quantum gate errors and Trotter (discretization) errors than is widely assumed. In Quantinuum's trapped-ion computers, the weakly entangling gates that appear in Trotterized circuits can be implemented natively, and their error rate is smaller when they generate less entanglement; from benchmarking, we know that the error for a gate $\exp[-i (Z\otimes Z) τ]$ decreases roughly linearly with $τ$, up to a small offset at $τ= 0$. We provide extensive evidence that this scaling, together with the robustness of near-thermal dynamics to both gate and discretization errors, facilitates substantial improvements in the achievable accuracy of Trotterized dynamics on near-term quantum computers. We make heavy use of a new theoretical tool -- a statistical ensemble of random product states that approximates a thermal state, which can be efficiently prepared with low noise on quantum computers. We outline how the random product state ensemble can be used to predict, optimize, and design Hamiltonian simulation experiments on near-thermal quantum systems.

quant-ph↗

arXiv2024

Entangling four logical qubits beyond break-even in a nonlocal code

Quantum error correction protects logical quantum information against environmental decoherence by encoding logical qubits into entangled states of physical qubits. One of the most important near-term challenges in building a scalable quantum computer is to reach the break-even point, where logical quantum circuits on error-corrected qubits achieve higher fidelity than equivalent circuits on uncorrected physical qubits. Using Quantinuum's H2 trapped-ion quantum processor, we encode the GHZ state in four logical qubits with fidelity $ 99.5 \pm 0.15 \% \le F \le 99.7 \pm 0.1\% $ (after postselecting on over 98% of outcomes). Using the same quantum processor, we can prepare an uncorrected GHZ state on four physical qubits with fidelity $97.8 \pm 0.2 \% \le F\le 98.7\pm 0.2\%$. The logical qubits are encoded in a $[\![ 25,4,3 ]\!]$ Tanner-transformed long-range-enhanced surface code. Logical entangling gates are implemented using simple swap operations. Our results are a first step towards realizing fault-tolerant quantum computation with logical qubits encoded in geometrically nonlocal quantum low-density parity check codes.

quant-ph↗

arXiv2024

The computational power of random quantum circuits in arbitrary geometries

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of $\sim 50$ qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and therefore how much infidelity is suffered) in generating highly-entangled states. Here, we describe recent hardware upgrades to Quantinuum's H2 quantum computer enabling it to operate on up to $56$ qubits with arbitrary connectivity and $99.843(5)\%$ two-qubit gate fidelity. Utilizing the flexible connectivity of H2, we present data from random circuit sampling in highly connected geometries, doing so at unprecedented fidelities and a scale that appears to be beyond the capabilities of state-of-the-art classical algorithms. The considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the QCCD architecture as continued progress is made towards building larger machines.

quant-ph↗

arXiv2024

Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer

We implement logically encoded three-qubit circuits for the quantum Fourier transform (QFT), using the [[7,1,3]] Steane code, and benchmark the circuits on the Quantinuum H2-1 trapped-ion quantum computer. The circuits require multiple logical two-qubit gates, which are implemented transversally, as well as logical non-Clifford single-qubit rotations, which are performed by non-fault-tolerant state preparation followed by a teleportation gadget. First, we benchmark individual logical components using randomized benchmarking for the logical two-qubit gate, and a Ramsey-type experiment for the logical $T$ gate. We then implement the full QFT circuit, using two different methods for performing a logical control-$T$, and benchmark the circuits by applying it to each basis state in a set of bases that is sufficient to lower bound the process fidelity. We compare the logical QFT benchmark results to predictions based on the logical component benchmarks.

quant-ph↗

arXiv2023

Opportunities and Limitations in Broadband Sensing

We consider estimating the magnitude of a monochromatic AC signal that couples to a two-level sensor. For any detection protocol, the precision achieved depends on the signal's frequency and can be quantified by the quantum Fisher information. To study limitations in broadband sensing, we introduce the integrated quantum Fisher information and derive inequality bounds that embody fundamental tradeoffs in any sensing protocol. These inequalities show that sensitivity in one frequency range must come at a cost of reduced sensitivity elsewhere. For many protocols, including those with small phase accumulation and those consisting of $π$-pulses, we find the integrated Fisher information scales linearly with $T$. We also find protocols with substantial phase accumulation can have integrated QFI that grows quadratically with $T$, which is optimal. These protocols may allow the very rapid detection of a signal with unknown frequency over a very wide bandwidth.

quant-ph↗

arXiv2023

Experimental demonstration of the advantage of adaptive quantum circuits

Adaptive quantum circuits employ unitary gates assisted by mid-circuit measurement, classical computation on the measurement outcome, and the conditional application of future unitary gates based on the result of the classical computation. In this paper, we experimentally demonstrate that even a noisy adaptive quantum circuit of constant depth can achieve a task that is impossible for any purely unitary quantum circuit of identical depth: the preparation of long-range entangled topological states with high fidelity. We prepare a particular toric code ground state with fidelity of at least $76.9\pm 1.3\%$ using a constant depth ($d=4$) adaptive circuit, and rigorously show that no unitary circuit of the same depth and connectivity could prepare this state with fidelity greater than $50\%$.

quant-ph↗

arXiv2022

Characterizing a non-equilibrium phase transition on a quantum computer

At transitions between phases of matter, physical systems can exhibit universal behavior independent of their microscopic details. Probing such behavior in quantum many-body systems is a challenging and practically important problem that can be solved by quantum computers, potentially exponentially faster than by classical computers. In this work, we use the Quantinuum H1-1 quantum computer to realize a quantum extension of a simple classical disease spreading process that is known to exhibit a non-equilibrium phase transition between an active and absorbing state. Using techniques such as qubit-reuse and error avoidance based on real-time conditional logic (utilized extensively in quantum error correction), we are able to implement large instances of the model with $73$ sites and up to $72$ circuit layers, and quantitatively determine the model's critical properties. This work demonstrates how quantum computers capable of mid-circuit resets, measurements, and conditional logic enable the study of difficult problems in quantum many-body physics: the simulation of open quantum system dynamics and non-equilibrium phase transitions.

quant-ph↗

arXiv2022

Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations

The quantum volume test is a full-system benchmark for quantum computers that is sensitive to qubit number, fidelity, connectivity, and other quantities believed to be important in building useful devices. The test was designed to produce a single-number measure of a quantum computer's general capability, but a complete understanding of its limitations and operational meaning is still missing. We explore the quantum volume test to better understand its design aspects, sensitivity to errors, passing criteria, and what passing implies about a quantum computer. We elucidate some transient behaviors the test exhibits for small qubit number including the ideal measurement output distributions and the efficacy of common compiler optimizations. We then present an efficient algorithm for estimating the expected heavy output probability under different error models and compiler optimization options, which predicts performance goals for future systems. Additionally, we explore the original confidence interval construction and show that it underachieves the desired coverage level for single shot experiments and overachieves for more typical number of shots. We propose a new confidence interval construction that reaches the specified coverage for typical number of shots and is more efficient in the number of circuits needed to pass the test. We demonstrate these savings with a $QV=2^{10}$ experimental dataset collected from Quantinuum System Model H1-1. Finally, we discuss what the quantum volume test implies about a quantum computer's practical or operational abilities especially in terms of quantum error correction.

quant-ph↗

arXiv2021

Realizing a dynamical topological phase in a trapped-ion quantum simulator

Nascent platforms for programmable quantum simulation offer unprecedented access to new regimes of far-from-equilibrium quantum many-body dynamics in (approximately) isolated systems. Here, achieving precise control over quantum many-body entanglement is an essential task for quantum sensing and computation. Extensive theoretical work suggests that these capabilities can enable dynamical phases and critical phenomena that exhibit topologically-robust methods to create, protect, and manipulate quantum entanglement that self-correct against large classes of errors. However, to date, experimental realizations have been confined to classical (non-entangled) symmetry-breaking orders. In this work, we demonstrate an emergent dynamical symmetry protected topological phase (EDSPT), in a quasiperiodically-driven array of ten $^{171}\text{Yb}^+$ hyperfine qubits in Honeywell's System Model H1 trapped-ion quantum processor. This phase exhibits edge qubits that are dynamically protected from control errors, cross-talk, and stray fields. Crucially, this edge protection relies purely on emergent dynamical symmetries that are absolutely stable to generic coherent perturbations. This property is special to quasiperiodically driven systems: as we demonstrate, the analogous edge states of a periodically driven qubit-array are vulnerable to symmetry-breaking errors and quickly decohere. Our work paves the way for implementation of more complex dynamical topological orders that would enable error-resilient techniques to manipulate quantum information.

quant-ph↗

arXiv2021

Holographic dynamics simulations with a trapped ion quantum computer

Quantum computers have the potential to efficiently simulate the dynamics of many interacting quantum particles, a classically intractable task of central importance to fields ranging from chemistry to high-energy physics. However, precision and memory limitations of existing hardware severely limit the size and complexity of models that can be simulated with conventional methods. Here, we demonstrate and benchmark a new scalable quantum simulation paradigm--holographic quantum dynamics simulation--which uses efficient quantum data compression afforded by quantum tensor networks along with opportunistic mid-circuit measurement and qubit reuse to simulate physical systems that have far more quantum degrees of freedom than can be captured by the available number of qubits. Using a Honeywell trapped ion quantum processor, we simulate the non-integrable (chaotic) dynamics of the self-dual kicked Ising model starting from an entangled state of $32$ spins using at most $9$ trapped ion qubits, obtaining excellent quantitative agreement when benchmarking against dynamics computed directly in the thermodynamic limit via recently developed exact analytical techniques. These results suggest that quantum tensor network methods, together with state-of-the-art quantum processor capabilities, enable a viable path to practical quantum advantage in the near term.

quant-ph↗

arXiv2021

Entanglement from tensor networks on a trapped-ion QCCD quantum computer

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 using a quantum computer to simulate many-body systems with limited entanglement. We experimentally demonstrate a significant benefit of this approach to quantum simulation: In addition to all correlation functions, 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 a trapped-ion QCCD quantum computer equipped with selective mid-circuit 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.

quant-ph↗

arXiv2020

Holographic quantum algorithms for simulating correlated spin systems

We present a suite of "holographic" quantum algorithms for efficient ground-state preparation and dynamical evolution of correlated spin-systems, which require far-fewer qubits than the number of spins being simulated. The algorithms exploit the equivalence between matrix-product states (MPS) and quantum channels, along with partial measurement and qubit re-use, in order to simulate a $D$-dimensional spin system using only a ($D$-1)-dimensional subset of qubits along with an ancillary qubit register whose size scales logarithmically in the amount of entanglement present in the simulated state. Ground states can either be directly prepared from a known MPS representation, or obtained via a holographic variational quantum eigensolver (holoVQE). Dynamics of MPS under local Hamiltonians for time $t$ can also be simulated with an additional (multiplicative) ${\rm poly}(t)$ overhead in qubit resources. These techniques open the door to efficient quantum simulation of MPS with exponentially large bond-dimension, including ground-states of 2D and 3D systems, or thermalizing dynamics with rapid entanglement growth. As a demonstration of the potential resource savings, we implement a holoVQE simulation of the antiferromagnetic Heisenberg chain on a trapped-ion quantum computer, achieving within $10(3)\%$ of the exact ground-state energy of an infinite chain using only a pair of qubits.

quant-ph↗

arXiv2013

Long-time Low-latency Quantum Memory by Dynamical Decoupling

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.

quant-ph↗

arXiv2011

Reducing sequencing complexity in dynamical quantum error suppression by Walsh modulation

We study dynamical error suppression from the perspective of reducing sequencing complexity, in order to facilitate efficient semi-autonomous quantum-coherent systems. With this aim, we focus on digital sequences where all interpulse time periods are integer multiples of a minimum clock period and compatibility with simple digital classical control circuitry is intrinsic, using so-called em Walsh functions as a general mathematical framework. The Walsh functions are an orthonormal set of basis functions which may be associated directly with the control propagator for a digital modulation scheme, and dynamical decoupling (DD) sequences can be derived from the locations of digital transitions therein. We characterize the suite of the resulting Walsh dynamical decoupling (WDD) sequences, and identify the number of periodic square-wave (Rademacher) functions required to generate a Walsh function as the key determinant of the error-suppressing features of the relevant WDD sequence. WDD forms a unifying theoretical framework as it includes a large variety of well-known and novel DD sequences, providing significant flexibility and performance benefits relative to basic quasi-periodic design. We also show how Walsh modulation may be employed for the protection of certain nontrivial logic gates, providing an implementation of a dynamically corrected gate. Based on these insights we identify Walsh modulation as a digital-efficient approach for physical-layer error suppression.

quant-ph↗

arXiv2006

Quantum logic via the exchange blockade in ultracold collisions

A nuclear spin can act as a quantum switch that turns on or off ultracold collisions between atoms even when there is neither interaction between nuclear spins nor between the nuclear and electron spins. This "exchange blockade" is a new mechanism for implementing quantum logic gates that arises from the symmetry of composite identical particles, rather than direct coupling between qubits. We study the implementation of the entangling $\sqrt{\text{SWAP}}$ gate based on this mechanism for a model system of two atoms with ground electron configuration $^1S_0$, spin 1/2 nuclei, trapped in optical tweezers. We evaluate a proof-of-principle protocol based on adiabatic evolution of a one dimensional double Gaussian well, calculating fidelities of operation as a function of interaction strength, gate time, and temperature.

quant-ph↗