Electron-on-neon (eNe) qubits have recently emerged as a compelling platform for quantum computing, which combines the vacuum isolation advantages of trapped-ion qubits with the good scaling prospects of superconducting circuits. In current implementations, electrons are trapped in vacuum above a solid neon film deposited on superconducting microwave resonators, where they exhibit strong coupling to the resonators, long coherence times, and high single-qubit gate fidelities. A central challenge, however, is the spontaneous binding of electrons to neon surface bumps. These bumps, originating from substrate roughness, vary in size: electrons on bumps of suitable sizes within the resonator can couple to microwave photons and function as qubits, whereas those on unfavorable bumps remain inactive yet contribute to background charge noise. Moreover, both the bump landscape and the sites where electrons bind differ from run to run, leading to variable qubit characteristics that hinder scalability. To address this challenging issue, we present an on-chip magnetic-levitation architecture in which arrays of solid-neon microparticles are suspended above the processor chip to act as electron carriers. This design eliminates substrate effects while retaining strong qubit-resonator coupling and supporting inter-qubit connectivity. Our analysis further shows that the qubit transition frequency can be tuned across the gigahertz range and its anharmonicity can reach $\sim 0.8\mathrm{GHz}$ by tuning the resonator bias voltage. Together, these features suggest a promising pathway toward robust, reproducible, and scalable eNe-based quantum computing.

Hamiltonian simulation using product formulas is arguably the most straightforward and practical approach for algorithmic simulation of a quantum system’s dynamics on a quantum computer. Here we present corrected product formulas (CPFs), a variation of product formulas achieved by injecting auxiliary terms called correctors into standard product formulas. We establish several correctors that improve the accuracy of standard product formulas by orders of magnitude when simulating Hamiltonians comprised of two exactly simulatable partitions, a common structure of lattice Hamiltonians. Importantly, injecting these correctors increases the overall simulation cost by only a small additive or multiplicative factor. We show that correctors are particularly advantageous for perturbed systems, where one partition has a relatively small norm compared to the other, as they allow the small norm to be utilized as an additional parameter for controlling the simulation error. We demonstrate the performance of CPFs by numerical simulations for several lattice Hamiltonians. Numerical results show that our theoretical error bounds for CPFs match or outperform the empirical error scaling of standard product formulas for these systems. We also demonstrate improvements offered by CPFs by implementing small-size systems on actual quantum hardware, as well as on noisy and noiseless quantum simulators. CPFs could be a valuable algorithmic tool for early fault-tolerant quantum computers with limited computing resources. As for standard product formulas, CPFs could also be used for simulations on a classical computer.

Dispersive readout of superconducting qubits relies on a transverse capacitive coupling that hybridizes the qubit with the readout resonator, subjecting the qubit to Purcell decay and measurement-induced state transitions (MIST). Despite the widespread use of Purcell filters to suppress qubit decay and near-quantum-limited amplifiers, dispersive readout often lags behind single- and two-qubit gates in both speed and fidelity. Here, we experimentally demonstrate junction readout, a simple readout architecture that realizes a strong qubit-resonator cross-Kerr interaction without relying on a transverse coupling. This interaction is achieved by coupling a transmon qubit to its readout resonator through both a capacitance and a Josephson junction. By varying the qubit frequency, we show that this hybrid coupling provides intrinsic Purcell protection and enhanced resilience to MIST, enabling readout at high photon numbers. While junction readout is compatible with conventional linear measurement, in this work we exploit the nonlinear coupling to intentionally engineer a large Kerr nonlinearity in the resonator, enabling bifurcation-based readout. Using this approach, we achieve a 99.4% assignment fidelity with a 68 ns integration time and a 98.4% quantum non-demolition (QND) fidelity without an external Purcell filter or a near-quantum-limited amplifier. These results establish the junction readout architecture with bifurcation-based readout as a scalable and practical alternative to dispersive readout, enabling fast, high-fidelity qubit measurement with reduced hardware overhead.

We introduce a mixed-state magic criterion, the Triangle Criterion, which plays a role for magic analogous to the positive partial transposition (PPT) criterion for entanglement: it combines strong detection capability, a clear geometric interpretation, and an operational link to magic distillation. Using this criterion, we uncover several new features of multi-qubit magic distillation and detection. We prove that genuinely multi-qubit magic distillation protocols are strictly more powerful than all single-qubit schemes by showing that the Triangle Criterion is not stable under tensor products. Moreover, we show that, with overwhelming probability, multi-qubit magic states with relatively low rank cannot be distilled by any single-qubit distillation protocol. We derive an upper bound on the minimal purity of magic states, which is conjectured to be tight with both numerical and constructive evidence. Using this minimal-purity result, we predict the existence of unfaithful magic states, namely states that cannot be detected by any fidelity-based magic witness, and reveal fundamental limitations of mixed-state magic detection in any single-copy scheme.

We present a family of simple three-dimensional stabilizer codes, called the chiral color codes, that realize fermionic and chiral topological orders. In the qubit case, the code realizes the topological phase of a single copy of the fermionic toric code. For qudit systems with local dimension $d$, the model features a chiral parameter $\alpha$ and realizes 3D topological phases characterized by ${\mathbb{Z}}_d^{(\alpha )}$ anyon theories with anomalous chiral surface topological order. On closed manifolds, the code has a unique ground state after removing bulk transparent fermions or bosons. Furthermore, we prove that the bulk is short-range entangled (for odd $d$, coprime $\alpha$) by constructing an explicit local quantum channel that prepares the ground state. The chiral color codes are constructed within the gauge color code and hence inherit its fault-tolerant features: they admit single-shot error correction and allow code switching to other stabilizer color codes. These properties position the chiral color codes as particularly useful platforms for realizing and manipulating fermions and chiral anyons.

Circuit quantum acoustodynamics (cQAD) devices have a wide range of applications in quantum science, all of which depend crucially on the quantum coherence of the mechanical subsystem. In this context, high-overtone bulk acoustic-wave resonators (HBARs) are particularly promising, since they have shown very high quality factors with negligible dephasing. However, the introduction of piezoelectric films, which are necessary for coupling to a superconducting circuit, can lead to additional loss channels, such as surface scattering and two-level systems. Here, we study the acoustic dissipation of HBAR resonators in cQAD systems and find that the defect density of the piezoelectric material and its interface with the bulk are limiting factors for the coherence. We measure acoustic modes with phonon lifetimes up to $400\mathrm{\mu }\mathrm{s}$ and lifetime-limited coherence times approaching 1 ms in the quantum regime. When coupled to a superconducting qubit, this leads to a hybrid system with a large quantum coherence cooperativity of $C_{T_2}=1.1\times {10}^5$. These results represent a new milestone for the performance of cQAD devices and offer concrete paths forward for further improvements.

Distributed architecture is a promising route to scaling fault-tolerant quantum computing (FTQC) beyond the inherent limitations of single processors, for which high-fidelity logical Bell pairs need to be prepared from many noisy physical Bell pairs with high efficiency. For practical implementation of distributed FTQC, logical Bell pair preparation must be designed not only for efficient Bell pair consumption but also for the spacetime volume of the protocol; however, entanglement distillation protocols have primarily focused on minimizing the consumption of Bell pairs, often resulting in protocols that require a substantial number of local operations. A key challenge is to find an appropriate balance between these two contrasting features. To resolve this issue, we introduce a metric for characterizing the practical cost of preparing high-fidelity logical Bell pairs, link-limited volume (LLV), which is a circuit-volume metric incorporating, in a single quantity, both the cost of physical Bell pair consumption and the volume associated with local operations. Guided by this metric, we propose the entanglement boosting protocol that achieves efficient preparation of logical Bell pairs encoded in rotated surface code, with LLV reduced by orders of magnitude compared to prior state-of-the-art methods. In this protocol, paralleling recent advances in magic state cultivation, we employ soft-information decoders and postselection to suppress the logical error rates of Bell pairs to practical levels, e.g. less than ${10}^{-10}$ from 86 noisy physical Bell pairs at 1% error, while all local operations are implementable within a spatial region of a single surface-code patch with two-dimensional local connectivity. This is a substantial reduction from other protocols, such as remote lattice surgery operations requiring nearly 1000 physical Bell pairs under the same setting. To further augment the entanglement boosting, we also present a pipelined implementation of entanglement distillation using high-rate quantum error-correcting codes, enabling arbitrarily low logical error rates while also maintaining physically efficient implementations. These results pave the way for the practical implementation of distributed FTQC, reinforcing the benefits of fast interconnect technologies and serving as a guiding principle for the efficient design of protocols and devices.

Tensor network contraction on arbitrary graphs is a fundamental computational challenge with applications ranging from quantum simulation to error correction. While belief propagation (BP) provides a powerful approximation algorithm for this task, its accuracy limitations are poorly understood and systematic improvements remain elusive. Here, we develop a rigorous theoretical framework for BP in tensor networks, leveraging insights from statistical mechanics to devise a cluster expansion that systematically improves the BP approximation. We prove that the cluster expansion converges exponentially fast if an object called the loop contribution decays sufficiently fast with the loop size, giving a rigorous error bound on BP. We also provide a simple and efficient algorithm to compute the cluster expansion to arbitrary order. We demonstrate the efficacy of our method on the two-dimensional Ising model, where we find that our method significantly improves upon BP and existing corrective algorithms such as loop series expansion. Our work opens the door to a systematic theory of BP for tensor networks and its applications in decoding quantum error-correcting codes and simulating quantum systems.

We propose a fault-tolerant quantum computation scheme that is broadly applicable to quantum low-density parity-check (qLDPC) codes. The scheme achieves constant qubit overhead and a time overhead of $O(d^{a+o(1)})$ for any $[[n,k,d]]$ qLDPC code with constant encoding rate and distance $d=\mathrm{\Omega }(n^{1/a})$. For good qLDPC codes, the time overhead is minimized and reaches $O(d^{1+o(1)})$. In contrast, code surgery based on gauging measurement and brute-force branching requires a time overhead of $O(d{w}^{1+o(1)})$, where $d\le w\le n$. Thus, our scheme is asymptotically faster for all codes with $a<2$. This speedup is achieved by developing techniques that enable parallelized code surgery under constant qubit overhead and leverage classical locally testable codes for efficient resource state preparation. These results establish a new paradigm for accelerating fault-tolerant quantum computation on qLDPC codes, while maintaining low overhead and broad applicability.

The motion of atoms in programmable optical tweezer arrays offers many new opportunities for neutral-atom quantum science. These include inter- and intra-site atom motion for resource-efficient implementations of fermionic and bosonic modes, respectively, as well as tweezer transport for efficient compilation of arbitrary circuits. However, the exploitation of atomic motion for all these purposes and others is limited by the inertia of the atoms. We present a comprehensive architectural blueprint for the use of fermionic metastable helium-3 (${}^3{\text{He}}^{*}$) atoms—the lightest trappable atomic species—in programmable optical tweezer arrays. This includes a concrete analysis of atomic structure considerations as well as Rydberg-mediated interactions. We show that inter-tweezer hopping of ${}^3{\text{He}}^{*}$ atoms can be $\gtrsim 3\times$ faster than previous demonstrations with lithium-6. We also demonstrate a new toolbox for encoding and manipulating qubits directly in the tweezer trap potential, uniquely enabled by the light mass of ${}^3{\text{He}}^{*}$. Finally, we provide several examples of new opportunities for fermionic quantum simulation and computation that leverage the transport and inter-tweezer hopping of ${}^3{\text{He}}^{*}$ atom arrays. These tools present new methods to improve the resource efficiency of neutral-atom quantum science that may also enable quantum simulations of lattice gauge theories and quantum chemistry outside the Born-Oppenheimer approximation.

We report on the realization of a ${}^{133}\mathrm{Cs}$ optical tweezer array in a cryogenic blackbody radiation (BBR) environment. By enclosing the array within a 4 K radiation shield, we measure long Rydberg lifetimes, up to $406(36)\mathrm{\mu }\mathrm{s}$ for the $55P_{3/2}$ Rydberg state, a factor of 3.3(3) longer than the room-temperature value. We employ single-photon coupling for coherent manipulation of the ground-Rydberg qubit. We measure a small differential dynamic polarizability of the transition, beneficial for reducing dephasing due to light intensity fluctuations. Our results pave the path for advancing neutral-atom two-qubit gate fidelities as their error budgets become increasingly dominated by $T_1$ relaxation of the ground-Rydberg qubit.

We demonstrate a neutral atom networking node that combines high photon collection efficiency with high atom-photon entanglement fidelity in a compact, fiber-integrated platform. A parabolic mirror is used both to form the trap and to collect fluorescence from a single rubidium atom, intrinsically mode-matching $\sigma$ polarized emitted photons to the fiber and rendering the system largely insensitive to small imperfections or drifts. The core optics consist of millimeter-scale components that are pre-aligned, rigidly bonded on a monolithic in-vacuum assembly, and interfaced entirely via optical fibers. With this design, we measure an overall photon collection and detection efficiency of 5%, from which we infer an overall collection efficiency of 9% after the single-mode fiber coupling. We generate atom-photon entangled states with a raw Bell-state fidelity of 0.93 and an inferred fidelity of 0.98 after correcting for atom readout errors. The same node design has been realized in two independent setups with comparable performance and is compatible with adding high-NA objective lenses to create and control atomic arrays at each node. Our results establish a robust, cavity-free neutral atom interface that operates near the limit set by the collection optics numerical aperture and provides a practical building block for scalable quantum network nodes and repeaters.

We propose a scheme for accumulating entanglement between long-lived qudits provided by central nuclear spins of defect centers. Assuming a generic setting, the electron spin of each node acts as the communication qubit and may be entangled with other nodes, e.g., through a spin-photon interface. The generally available Ising component of the hyperfine interaction is shown to facilitate repeated entanglement transfer onto memory qudits of arbitrary dimension $d\le 2I+1$ with $I$ the nuclear spin quantum number. When $d$ is set to an integer power of two, maximal entanglement can be generated deterministically and without intermittent driving of nuclear spins. The scheme is applicable to several candidate systems, including the ${}^{73}\mathrm{Ge}$ germanium vacancy in diamond.

Magic state cultivation is a state-of-the-art protocol to prepare ultra-high fidelity non-Clifford resource states for universal quantum computation. It offers a significant reduction in spacetime overhead compared to traditional magic state distillation techniques. Cultivation protocols involve measuring a transversal logical Clifford operator on an initial small-distance code and then rapidly growing to a larger-distance code. In this work, we present a new cultivation scheme in which we measure the fold-transversal Hadamard of the unrotated surface code, and leverage unitary techniques to grow within the surface code family. Using both stabilizer and state vector simulations we find that this approach achieves the lowest known spacetime overhead for magic state cultivation. Practical implementation of our protocol is best suited to architectures with nonlocal connectivity, showing the strength of architectures where such connectivity is readily available.

Determining the conditions under which positive operator-valued measures (POVMs), the most general class of quantum measurements, outperform projective measurements remains a challenging and largely unresolved problem. Of particular interest are projectively simulable POVMs, which can be realized through probabilistic mixtures of projective measurements and therefore offer no advantage over projective schemes. Characterizing the boundary between simulable and non-simulable POVMs is, however, a difficult task, and existing tools either fail to scale efficiently, provide limited experimental feasibility, or work only for specific POVMs. Here, we introduce and demonstrate a general method to certify non-simulability of a POVM by introducing a complete hierarchy of semidefinite programs. It provides upper bounds on the non-simulability measure of critical visibility of arbitrary POVMs, which are tight in many cases and outperform previously known criteria. We experimentally certify the non-simulability of two- and three-dimensional POVMs using a trapped-ion qudit quantum processor by constructing non-simulability witnesses and introducing a modification of our framework that makes them robust against state preparation errors. Finally, we extend our results to the setting where an additional ancilla system is available.

The pursuit of topological phenomena in non-Hermitian systems has unveiled new physics beyond the conventional Hermitian paradigm, yet their realization in interacting many-body platforms remains a critical challenge. Exploring this interplay is essential to understand how strong interactions and dissipation collectively shape topological phases in open quantum systems. Here, we experimentally demonstrate dynamical spectral topology in a dissipative Rydberg atomic gas and characterize parameter-dependent winding numbers, which quantify a geometric winding of the spectral topology. By increasing the interaction strength, the system evolves from Hermitian to non-Hermitian regime, accompanying emergence of trajectory loop in the complex energy plane. As the scanning time is varied, the spectral topology becomes twisted in the complex energy plane, forming enclosed sub-loops characterized by opposite winding numbers. Furthermore, by changing the scanning direction, we observe the differentiated spectral loops, revealing a signature of scan-direction-dependent nonreciprocity. This work establishes cold Rydberg gases as a versatile platform for exploring the rich interplay between non-Hermitian topology, strong interactions, and dissipative quantum dynamics.

Artificial intelligence in dynamic, real-world environments requires the capacity for continual learning. However, standard deep learning suffers from a fundamental issue: loss of plasticity, in which networks gradually lose their ability to learn from new data. Here we show that quantum learning models naturally overcome this limitation, preserving plasticity over long timescales. We demonstrate this advantage systematically across a broad spectrum of tasks from multiple learning paradigms, including supervised learning and reinforcement learning, and diverse data modalities, from classical high-dimensional images to quantum-native datasets. Although classical models exhibit performance degradation correlated with unbounded weight and gradient growth, quantum neural networks maintain consistent learning capabilities regardless of the data or task. We identify the origin of the advantage as the intrinsic physical constraints of quantum models. Unlike classical networks where unbounded weight growth leads to landscape ruggedness or saturation, the unitary constraints confine the optimization to a compact manifold. Our results suggest that the utility of quantum computing in machine learning extends beyond potential speedups, offering a robust pathway for building adaptive artificial intelligence and lifelong learners.

We propose a decoder for quantum low-density parity-check (LDPC) codes based on a beam search heuristic guided by belief propagation (BP). Our beam search decoder applies to all quantum LDPC codes and achieves different speed-accuracy tradeoffs by tuning its parameters such as the beam width. We perform numerical simulations under circuit level noise for the $[[144,12,12]]$ bivariate bicycle (BB) code at noise rate $p={10}^{-3}$ to estimate the logical error rate and the 99.9 percentile runtime and we compare with the BP-OSD decoder which has been the default quantum LDPC decoder for the past six years. A variant of our beam search decoder with a beam width of 64 achieves a $17\times$ reduction in logical error rate. With a beam width of 8, we reach the same logical error rate as BP-OSD with a $26.2\times$ reduction in the 99.9 percentile runtime. We identify the beam search decoder with beam width of 32 as a promising candidate for trapped ion architectures because it achieves a $5.6\times$ reduction in logical error rate with a 99.9 percentile runtime per syndrome extraction round below 1 ms at $p=5\times {10}^{-4}$. Remarkably, this is achieved in software on a single core, without any parallelization or specialized hardware (FPGA, ASIC), suggesting one might only need three 32-core CPUs to decode a trapped ion quantum computer with 1000 logical qubits.

We formulate a minimal model of a quantum particle detector as an autonomous quantum thermal machine. Our goal is to establish how entropy production, which is needed to maintain the detector out of equilibrium, is linked to the quality of the measurement process. Using our model, we perform a detailed investigation of the detector’s key performance characteristics: namely, detection efficiency, gain, jitter, dead time, and dark counts. We find that entropy production constrains both the efficiency and temporal precision of the detection process, in the sense that improved performance generally requires more dissipation. We also find that reducing either the detection jitter or dead time unavoidably increases the rate of dark counts. Our work establishes a quantitative connection between entropy production and the quality of the irreversible detection process, highlights fundamental tradeoffs in the performance of particle detectors, and provides a framework for further investigations of the non-equilibrium thermodynamics of quantum measurement and amplification.

Quantum field simulators provide unique opportunities for investigating the dynamics of quantum fields through tabletop experiments. A primary drawback of standard encoding schemes is their rigidity: altering the theory, its coupling geometry, metric structure, or simulation time typically requires redesigning the experimental setup, which imposes strong constraints on the types of dynamics and theories that can be simulated. Here, we introduce the Optical Time Algorithm (OTA) as a unifying framework, enabling the efficient simulation of large classes of free quantum field dynamics using a single optical circuit design that separates the time from the Hamiltonian’s structure. By modifying the parameters of the optical elements, our method allows us to engineer timescales, coupling graphs, spacetime metrics, and boundary conditions, thereby facilitating the implementation of relativistic and nonrelativistic, real- and complex-valued, short- and long-range quantum field theories on both flat and curved spacetimes. We exploit the OTA’s configurability to investigate the spreading of quantum correlations in space and time for theories with continuously varying coupling ranges. Relevant features predicted by quantum field theory can be observed in systems with 10 to 20 modes under realistic conditions, paving the way for experimental implementations.