High-fidelity quantum logic operations in trapped ions often require the ions' collective motion to be cooled to near the ground state. Since cooling the ions' motion typically involves dissipative processes such as spontaneous photon scattering, sympathetic cooling is used on select coolant ions between gate sequences to cool the ion chain without affecting the data qubits. Common implementations for coolant ions include different atomic species, different isotopes of the same species or individually addressable ions. Each of these approaches have challenges associated with them, which include increased hardware complexity, reduced efficiency of radial mode cooling and re-ordering events which add additional experimental overhead. We demonstrate a sympathetic cooling scheme leveraging internal metastable atomic levels accessible via a narrow quadrupole transition, utilizing the natural Zeeman shift and individually addressed Raman transitions, to achieve isolation of the non-coolant or “data ions" from coolant ions. We demonstrate modest decoherence of the data ions due to cooling, while preserving the coherence requirements for high-fidelity gate operations.

Modular trapped-ion quantum computing hardware, known as Quantum Charge Coupled Devices (QCCDs) require shuttling operations in order to maintain effective all-to-all connectivity. Each module or trap can perform only one operation at a time, resulting in low intra-trap parallelism, but there is no restriction on operations happening on independent traps, enabling high inter-trap parallelism. Unlike their superconducting counterparts, the design space for QCCDs is relatively flexible and can be explored beyond the constraints of two-dimensional grids. In this work, we are motivated by the opportunity to explore the QCCD design space in the context of optimizing for non-topological CSS codes. In particular, current grid-based architectures significantly limit the performance of many promising, high-rate codes such as hypergraph product codes and bivariate bicycle codes. Many of these codes are highly parallelizable, meaning that with appropriate hardware layouts and matching software schedules, execution latency can be greatly reduced. Faster execution, in turn, reduces error accumulation from decoherence and heating, ultimately improving code performance when mapped to realistic hardware. However, current 2D grid designs suffer from numerous trap to trap "roadblocks", forcing serialization and destroying the inherent parallelism of these codes. To address this, we propose Cyclone, a circular software-hardware codesign that departs from traditional 2D grids in favor of a flexible ring topology, where ancilla qubits move in lockstep. Cyclone eliminates roadblocks, bounds total movement, and enables high levels of parallelism, resulting in up to 4x speedup in execution times. In addition to temporal efficiency, Cyclone also offers large spatial efficiency when compared to a grid codesign. It requires fewer traps, fewer junctions, and only a constant number of Digital-to-Analog Converters (DAC), as opposed to grid architectures, where DAC count scales linearly with the number of traps. With hypergraph product codes, Cyclone achieves up to a 2x order of magnitude improvement in logical error rate, and with bivariate bicycle codes, this improvement reaches up to a 3x in order of magnitude. Spatially, Cyclone reduces the number of required traps and ancilla qubits by 2x. The overall spacetime improvement over a standard grid is up to similar to 20x, demonstrating Cyclone as a scalable and efficient alternative to conventional 2D QCCD architectures.

Recent advancements in neutral atom platforms have enabled exploration of early fault-tolerant (FT) architectures for applications with quantum advantage, such as quantum dynamics simulations. An efficient fault-tolerant architecture has both spatially efficient quantum error correction codes (low qubit overhead), and efficient methodologies (transversal based gates, extractor based gates, etc.) for logical computation, to minimize overall execution time. Achieving the right balance between space and time can be critical for enabling early FT demonstrations of quantum advantage. In this work, we identify bottlenecks in existing spatially efficient schemes, which tend to be very serial, and do not take advantage of unutilized space. We introduce a teleportation-based scheme that leverages the reconfigurable connectivity of neutral atoms to parallelize logical operations. Our approach achieves up to ∼ 3 × speedup over extractor architectures at no extra space cost and achieves the best spacetime performance among other viable architectures before accounting for external resource-states. To rigorously evaluate performance, we construct explicit quantum advantage benchmarks and simulate compilation to a fault-tolerant instruction set, including low-level gate scheduling and shuttling patterns, and resource-state nondeterminism. We find that our speedups still apply and report exact space-time cost along with success probabilities, identifying architectures capable of achieving quantum advantage with as little as 11,495 atoms and a runtime of ∼ 15 hours.

Large-language-model (LLM) agents can write and run experimental control code. This allows laboratory work to be conducted autonomously. However, this autonomy raises a safety problem that prior work has not addressed. Unchecked code can damage the apparatus, and there is no formal, per-operation boundary between human authorization/supervision, and agent decisions. We present a control system that places an LLM agent in the loop of a trapped-ion experiment while enforcing such a boundary. The agent controls the existing Advanced Real-Time Infrastructure for Quantum physics (ARTIQ) stack through tools provided by a Model Context Protocol (MCP) server. No tool call reaches the hardware unless it carries an authorization token bound to its exact contents. Tokens are issued in one of two ways: automatically, by running the agent's proposed script in an isolated hardware simulation (dax.sim) and checking every operation against preset per-device bounds, or manually by a human operator for sensitive actions. Within this boundary the agent develops its own experiments, rather than only calling pre-built routines. We deploy the system on a co-trapped ^40Ca^+/^40CaOH^+ crystal, where the agent autonomously builds a full calibration stack and, with targeted operator guidance, closes a cross-instrument magnetic-field-stabilization loop. On a separate, independent ^171Yb^+ platform, we confirm interface-level portability. We systematically test token-authorization mechanism with adversarial scripts that attempt to bypass it, mapping the precise boundary of its protection and prioritizing where to strengthen it next. Analyzing where the agent still requires human guidance, we find that its limits lie in metacognitive control, namely recognizing when a problem must be re-framed, rather than in domain knowledge.

Advancing quantum information processors and building fault-tolerant architectures rely on the ability to accurately characterize the noise sources and suppress their impact on quantum devices. In practice, noise often drifts over time, whereas conventional noise characterization and decoding methods typically assume stationarity or provide only a time-average behavior of the noise. This treatment can result in suboptimal decoding performance. In this work, we present a rigorous analytical framework to capture time-dependent Pauli noise, by exploiting the syndrome statistics of quantum error correction experiments. We propose a sliding-window estimation method which allows us to recover the frequency components of the noise, by using optimal window sizes that we derive analytically. We prove the noise-filtering behavior of sliding windows, linking window size to spectral cutoff frequencies, and provide an iterative algorithm that captures multiple drift frequencies. We further introduce an overlapping window algorithm that enables us to capture rapid multi-frequency noise drifts in a single-pass fashion. Simulations for both phenomenological and circuit-level noise models validate our framework, demonstrating robust tracking of multi-frequency drift. The logical error rate obtained from our estimated models consistently align with the ground-truth logical error rate, and we find suppression of logical errors compared to static error models. Our window-based estimation methods and adaptive decoding offer new insights into noise spectroscopy and decoder optimization under drift using only syndrome data.

The investigation of strongly-correlated quantum matter is difficult due to the curse of dimensionality and intricate entanglement structures. These challenges are particularly pronounced in the vicinity of continuous quantum phase transitions, where quantum fluctuations manifest across all length scales. While quantum simulators give controlled access to a number of strongly correlated systems, the study of critical phenomena has been hampered by finite-size effects arising from diverging correlation lengths. Moreover, the experimental investigation of entanglement in many-body systems has been hindered by limitations in measurement protocols. To address these challenges, we employ the multiscale entanglement renormalization ansatz (MERA) and implement a holographic scheme for subsystem tomography on a fully-connected trapped-ion quantum computer. Our method accurately represents infinite systems and long-range correlations with few qubits, facilitating the efficient extraction of observables and entanglement properties, even at criticality. We observe a quantum phase transition with spontaneous symmetry breaking and reveal the evolution of entanglement properties across the critical point. For the first time, we demonstrate log-law scaling of subsystem entanglement entropies at criticality on a digital quantum computer. This achievement highlights the potential of MERA for the investigation of strongly-correlated many-body systems on quantum computers.

Calculating the quantum weight enumerator polynomial (WEP) is a valuable tool for characterizing quantum error-correcting (QEC) codes, but it is computationally hard for large or complex codes. The Quantum LEGO (QL) framework provides a tensor network approach for WEP calculation, in some cases offering superpolynomial speedups over brute-force methods, provided the code exhibits area law entanglement, that a good QL layout is used, and an efficient tensor network contraction schedule is found. We analyze the performance of a hyper-optimized contraction schedule framework across QL layouts for diverse stabilizer code families. We find that the intermediate tensors in the QL networks for stabilizer WEPs are often highly sparse, invalidating the dense-tensor assumption of standard cost functions. To address this, we introduce an exact, polynomial-time Sparse Stabilizer Tensor (SST) cost function based on the rank of the parity check matrices for intermediate tensors. The SST cost function correlates perfectly with the true contraction cost, providing a significant advantage over the default cost function, which exhibits large uncertainty. Optimizing contraction schedules using the SST cost function yields substantial performance gains, achieving up to orders of magnitude improvement in actual contraction cost compared to using the dense tensor cost function. Furthermore, the precise cost estimation from the SST function offers an efficient metric to decide whether the QL-based WEP calculation is computationally superior to brute force for a given QL layout. These results, enabled by PlanqTN, a new open-source QL implementation, validate hyper-optimized contraction as a crucial technique for leveraging the QL framework to explore the QEC code design space.

Distributed quantum computing can potentially address the scalability challenge by networking processors through photon-mediated remote entanglement. Prior approaches assumed that remote Bell pairs require distillation, resulting in substantial overhead, to achieve sufficiently high fidelity before use. However, recent results show that lattice-surgery operations at logical qubit boundaries tolerate significantly higher error rates than previously assumed. We quantify the resource trade-offs between distillation overhead and surface-code distance requirements under realistic constraints including probabilistic entanglement generation and memory decoherence. We identify the fidelity crossover point separating the two regimes and show that choosing the right strategy can reduce resource overhead by up to two orders of magnitude at low fidelities and up to 68

The open quantum Rabi model describes a two-level system coupled to a harmonic oscillator. A Gaussian phase transition for the nonequilibrium steady states has been predicted when the bosonic mode is soft and subject to damping. We show that oscillator dephasing is a relevant perturbation, which leads to a non-Gaussian phase transition and an intriguing cascade of instabilities for k-th order bosonic operators, as well as a jump in the steady-state qubit polarization. For the soft-mode limit, the equations of motion form a closed hierarchy and spectral properties can be efficiently studied. To this purpose, we establish a fruitful connection to non-Hermitian Hamiltonians. The results for the phase diagram, stability boundaries, and relevant observables are based on mean-field analysis, exact diagonalization, perturbation theory, and Keldysh field theory.

Decoders for quantum error correction (QEC) experiments rely on detector error models (DEMs), which encode, for each error, its probability and the detectors and logical observables it flips. Here we show that estimating DEM event probabilities from experimental syndromes is feasible, avoids independent device benchmarking, and produces useful decoder priors for estimating and reducing decoded logical error probabilities. We evaluate our methods using open-source data from surface-code memory experiments performed on Google's Willow chip, and we carry out analogous surface-code experiments on IBM's processor. Despite the different physical error scales of the Google and IBM devices, in both cases our estimated DEMs improve logical error probabilities relative to baseline device-informed DEMs, typically at the 5%-10% level and with larger gains in some IBM cases, without additional calibration circuits, decoder fine-tuning, or supervised fitting to logical outcomes.

Unitary errors, such as those arising from fault-tolerant (FT) compilation of quantum algorithms, systematically bias observable estimates. Correcting this bias typically requires additional resources, such as an increased number of non-Clifford gates. In this work, we present an alternative method for correcting bias in the expectation values of observables. The method leverages a decomposition of the ideal quantum channel into a probabilistic mixture of noisy quantum channels. Using this decomposition, we construct unbiased estimators as weighted sums of expectation values obtained from the noisy channels. We provide a detailed analysis of the method, identify the conditions under which it is effective, and validate its performance through numerical simulations. In particular, we demonstrate unbiased observable estimation in the presence of unitary errors by simulating the time dynamics of the Ising Hamiltonian. Our strategy offers a resource-efficient way to reduce the impact of unitary errors, improving methods for estimating observables in noisy near-term quantum devices and FT implementation of quantum algorithms.

We report the observation of charge-exchange collisions between trapped calcium monohydride molecular ions (40CaH+) and ultracold potassium atoms (39K) in a hybrid ion-atom trap. The measured charge-exchange rate coefficient is significantly suppressed relative to the Langevin rate constant for the system. We use ab initio quantum-chemical calculations to model the (CaH-K)+ complex in the ground and excited electronic states and to identify possible charge-exchange mechanisms. Our calculations rule out a direct nonradiative charge-exchange reaction and instead point to a radiative mechanism, but do not quantitatively reproduce the measured rate, highlighting the need for a full-dimensional quantum dynamics treatment that includes vibrational motion and intermediate complex formation. Our work demonstrates that cold hybrid ion-atom platforms with molecular ions enable access to richer chemical complexity and collisional dynamics inaccessible in purely atomic systems.

We introduce heterogeneous quantum error-correcting codes composed of qubit types with distinct error channels and study their performance in the code-capacity regime using maximum-likelihood tensor network decoding. In the regime where both qubit types share the same noise bias but differ in physical error rate, placing noisier qubits in the bulk – where each error triggers more syndrome bits – and cleaner qubits on the boundary yields thresholds exceeding 0.4 (compared to 0.2 for the reverse placement) and improvements exceeding three orders of magnitude in logical error rate at high bias, with the advantage growing exponentially with code distance. In the regime where both types share the same error rate but differ in bias, the optimal strategy reverses: placing high-bias (more predictable) qubits on the boundary increases the threshold from 0.292(5) to 0.360(9) at a bias ratio of 100, and from 0.29(1) to 0.398(4) at a bias ratio of 1000. We also observe a striking bias-inversion property: the logical error channel becomes strongly XX X- and YY Y-biased despite the physical noise being ZZ Z-biased. We propose a stabilizer-ratio hypothesis that provides a unified information-theoretic explanation for both placement rules and predicts even larger advantages for code families such as color codes.

Quantum error correction (QEC) is often implemented on hardware that experiences biased noise, where dephasing errors occur more frequently than other errors. This has motivated many recent efforts to develop bias-tailored QEC codes, such as the Clifford-deformed compass codes: a family of codes that achieve high thresholds under biased dephasing noise. We perform circuit-level simulations of the Clifford-deformed elongated compass codes under a biased noise model and evaluate code thresholds using standard minimum weight perfect matching (MWPM) and correlated MWPM. We find that correlated decoding enhances thresholds for all noise biases relative to standard MWPM under circuit-level noise. Our results demonstrate that correlated decoding leads to a higher relative gain in thresholds compared to standard MWPM when applied to codes with asymmetric stabilizers under biased noise.

We can design efficient quantum error-correcting (QEC) codes by tailoring them to our choice of quantum architecture. Useful tools for constructing such codes include Clifford deformations and appropriate gauge fixings of compass codes. In this work, we find Clifford deformations that can be applied to elongated compass codes resulting in QEC codes with improved performance under noise models with errors biased towards dephasing commonly seen in quantum computing architectures. These Clifford deformations enhance decoder performance by introducing symmetries, while the stabilizers of compass codes can be selected to obtain more information on high-rate errors. As a result, the codes exhibit thresholds that increase with bias and lower logical error rates under both code capacity and phenomenological noise models. One of the Clifford deformations we explore yields QEC codes with better thresholds and logical error rates than those of the XZZX surface code at moderate biases under code capacity noise.

Quantum benchmarks provide compact measures of performance that are important for evaluating and comparing quantum systems. Circuit-level benchmarks are particularly valuable because they capture the accumulated effects of noise across interacting operations, but existing approaches may require structured gate sets and costly compilation, classical simulation of reference outputs, or subsystem decompositions that do not capture full-register behavior. We introduce Error Per Circuit Layer (EPCL), an overlap-based circuit-level benchmark that estimates an effective layer polarization by applying identical random circuits to two disjoint quantum registers and measuring the overlap between their output states as a function of circuit depth. EPCL avoids classical simulation of ideal output distributions and recovery to a known reference state, and is compatible with arbitrary gate sets, including non-Clifford gates. We derive the expected overlap decay under an ensemble-averaged depolarizing model and identify the assumptions under which the fitted decay parameter represents an effective layer polarization. Numerical simulations show that EPCL recovers the predicted polarization under weak local stochastic noise and remains well described by a single-exponential decay at stronger stochastic noise levels. The simulations further show that coherent errors associated with fixed entangling layers may require Pauli twirling or randomized compiling to produce the expected decay, while inter-register correlations contribute an additional covariance term to the measured overlap. Finally, experiments on IBM quantum hardware demonstrate clear EPCL decay in 8- and 16-qubit implementations. These results support EPCL as a method for measuring aggregate register performance without requiring classical simulation of ideal circuit outputs or restriction to structured gate sets.

Quantum error correction typically requires repeated syndrome extraction due to measurement noise, which results in substantial time overhead in fault-tolerant computation. Single-shot error correction aims to suppress errors using only one round of syndrome extraction. However, for most codes, it requires high-weight checks, which significantly degrade, and often eliminate, single-shot performance at the circuit level. In this work, we introduce local single-shot checks, where we impose constraints on check weights. Using a dynamic measurement scheme, we show that the number of required measurement rounds can be reduced by a factor determined by this constraint. As an example, we show through numerical simulation that our scheme can improve decoding performance compared to conventional checks when using sliding-window decoding with a reduced window size under circuit-level noise models for toric codes. Our work provides a new direction for constructing checks that can reduce time overhead in large-scale fault-tolerant quantum computation.

Two-dimensional compass codes are a family of quantum error-correcting codes that contain the Bacon-Shor codes, the X-Shor and Z-Shor codes, and the rotated surface codes. Previous numerical results suggest that the surface code has a constant accuracy and coherence threshold under uniform coherent rotation. However, having analytical proof supporting a constant threshold is still an open problem. It is analytically proven that the toric code can exponentially suppress logical coherence in the code distance L. However, the current analytical lower bound on the threshold for the rotation angle theta is | sin(theta)| < 1/L, which linearly vanishes in L instead of being constant. We show that this lower bound is achievable by the Z-Shor code, which does not have a threshold under stochastic noise. Compass codes provide a promising direction to improve on the previous bounds. We analytically determine thresholds for two new compass code families that provide upper and lower bounds to the rotated surface code's numerically established infidelity threshold. Furthermore, using a Majorana mode-based simulator, we use random families of compass codes to smoothly interpolate between the Z-Shor codes and the X-Shor codes.

Quantum devices require precisely calibrated analog signals, a process that is complex and time-consuming. Many calibration strategies exist, and all require careful analysis and tuning to optimize system availability. To enable rigorous statistical evaluation of quantum calibration procedures, we leverage statistical model checking (SMC), a technique used in fields that require statistical guarantees. SMC allows for probabilistic evaluation of properties of interest, such as a certain parameter's time to failure. We extend the SMC for Processor Analysis (SPA) framework, which uses SMC for evaluation of classical systems, to create SPA for Quantum calibration (SPAQ) enabling simplified tuning and analysis of quantum system calibration. We focus on a directed acyclic graph-based calibration optimization scheme and demonstrate how to craft properties of interest for its analysis. We show how to use SPAQ to find lower bounds of time to failure information, hidden node dependencies, and parameter threshold values and use that information to improve simulated quantum system availability through calibration scheme adjustments.

We present the design and characterization of individual addressing optics based on a multi-channel acousto-optic modulator (AOM) for trapped ytterbium-171 ions. The design parameters of the individual addressing system were determined based on the tradeoff between the expected crosstalk and the required numerical aperture of the projection objective lens. The target beam diameter and separation were 1.90 $\mu$m and 4.28 $\mu$m, respectively. The individual beams shaped by the projection optics were characterized by an imaging sensor and a field probe ion. The resulting effective beam diameters and separations were approximately 2.34--2.36 $\mu$m and 4.31 $\mu$m, respectively, owing to residual aberration.