Quantum simulation promises to advance materials discovery by accurately simulating complex states of matter, their microscopic excitations, and macroscopic response functions. The central challenge in resolving the underlying interacting dynamics is to combine high-fidelity evolution with the sophisticated control necessary to manipulate individual quasi-particles in quantum many-body states. Here, we report on high-precision simulation of both linear and non-linear response functions in a 2D XY spin-1/2 magnet using an analog-digital superconducting processor of up to 97 qubits. By interleaving digital gates with analog evolution precisely characterized via Hamiltonian learning, we selectively excite magnons at tunable energy densities. Measuring first the linear magnon response – a central probe in neutron-scattering experiments – we extract temperature-dependent spectra and lifetimes. Our results reveal stark variations in magnon decay rates across the Brillouin zone, with enhancement near van Hove singularities and suppression for edge-localized modes. Next, we perform a suite of nonlinear measurements, including the study of self-scattering mechanisms, as well as pump-probe spectroscopy to directly characterize the magnon interactions. While matrix-product state simulations capture the dynamics well in either small systems or at low temperatures, their predictions become inaccurate away from these limits. This work demonstrates precise simulation of the interacting dynamics in quantum magnets, and provides key insights into quasi-particles and their microscopic scattering mechanisms.

Disorder in quantum many-body systems can drive transitions between ergodic and non-ergodic phases, yet the nature–and even the existence–of these transitions remains intensely debated. Using a two-dimensional array of superconducting qubits, we study an interacting spin model at finite temperature in a disordered landscape, tracking dynamics both in real space and in Hilbert space. Over a broad disorder range, we observe an intermediate non-ergodic regime with glass-like characteristics: physical observables become broadly distributed and some, but not all, degrees of freedom are effectively frozen. The Hilbert-space return probability shows slow power-law decay, consistent with finite-temperature quantum glassiness. In the same regime, we detect the onset of a finite Edwards-Anderson order parameter and the disappearance of spin diffusion. By contrast, at lower disorder, spin transport persists with a nonzero diffusion coefficient. Our results show that there is a transition out of the ergodic phase in two-dimensional systems.

One of the roadblocks towards the implementation of a fault-tolerant superconducting quantum processor is impacts of ionizing radiation with the qubit substrate. Such impacts temporarily elevate the density of quasiparticles (QPs) across the device, leading to correlated qubit error bursts. The most damaging errors, $T_1$ errors, stem from QP tunneling across the qubit Josephson junctions (JJs). Recently, we demonstrated that this type of error can be strongly suppressed by engineering the profile of superconducting gap at the JJs in a way that prevents QP tunneling. In this work, we identify a new type of impact-induced correlated error that persists in the presence of gap engineering. We observe that impacts shift the frequencies of the affected qubits, and thus lead to correlated phase errors. The frequency shifts are systematically negative, reach values up to $3\,{\rm MHz}$, and last for $\sim 1\,{\rm ms}$. We provide evidence that the shifts originate from QP-qubit interactions in the JJ region. Further, we demonstrate that the shift-induced phase errors can be detrimental to the performance of quantum error correction protocols.

This tutorial offers a pedagogical guide to hybrid quantum processors that integrate discrete-variable (DV) qubits and continuous-variable (CV) oscillators. Aimed at computer scientists, engineers, and physicists, it provides an overview of the experimental, algorithmic, and architectural aspects of this novel and rapidly developing hardware model. Experimental realizations of this model include superconducting, trapped-ion, and neutral-atom platforms. By combining DV and CV components, hybrid oscillator-qubit processors enable a powerful new paradigm that offers complementary strengths for quantum control, error correction, computation, and simulation. Working toward the goal of a full-stack system connecting applications to CV-DV hardware, we define and formulate abstract machine models and instruction set architectures. These essential abstractions enable codesign of hardware and software, and resource estimation for exploring the potential of current and future hardware for computational and simulation tasks. Using these abstractions, we present both new and existing examples that illustrate the benefits of hybrid CV-DV processors relative to traditional DV-only hardware in computation as well as quantum simulation of physical models. Examples include algorithms for transferring states between DV and CV systems, performing the quantum Fourier transform, and simulation of lattice gauge theories. Relative to qubit-only hardware, the bosonic degrees of freedom natively available in hybrid architectures can substantially reduce the circuit complexity of simulations for physical models containing bosons. A key technique is the extension of quantum signal processing ideas to CV-DV systems. This work is intended to serve as a timely and comprehensive guide to this relatively unexplored yet promising approach to quantum computation and to provide a road map to guide future development.

Disorder-induced phenomena in quantum many-body systems pose significant challenges for analytical methods and numerical simulations at relevant time and system scales. To reduce the cost of disorder-sampling, we investigate quantum circuits initialized in states tunable to superpositions over all disorder configurations. In a translationally-invariant lattice gauge theory (LGT), these states can be interpreted as a superposition over gauge sectors. We observe localization in this LGT in the absence of disorder in one and two dimensions: perturbations fail to diffuse despite fully disorder-free evolution and initial states. However, Rényi entropy measurements reveal that superposition-prepared states fundamentally differ from those obtained by direct disorder sampling. Leveraging superposition, we propose an algorithm with a polynomial speedup in sampling disorder configurations, a longstanding challenge in many-body localization studies.

Quantum error correction (QEC) is the primary strategy for protecting a quantum computer from the environment1,2. The prerequisite of QEC is that errors must remain sufficiently rare, which requires perpetually adapting the control parameters of the computer to the drifting environmental conditions. The current solution to this problem is to terminate the entire quantum computation for recalibration, but it is incompatible with the long runtimes of future quantum algorithms3,4. Here we address this challenge by unifying calibration with computation. We grant the QEC process5-11 a dual role: its error-detection events are not only used to correct the logical quantum state but are also repurposed as a learning signal, teaching a reinforcement learning agent12-16 to continuously steer the control parameters and stabilize the quantum system during computation. We experimentally demonstrate this framework on a Willow superconducting processor, improving the logical stability of the surface code 3.5-fold against injected drift. By synthesizing our full suite of technological advances, we achieve record performance of the surface and colour codes, with average logical error per cycle of 7.72(9) × 10-4 and 8.19(14) × 10-3, respectively. Numerical simulations of large codes with tens of thousands of control parameters confirm the scalability of our RL framework, revealing an optimization speed that is independent of system size. This work thus enables a new paradigm: a quantum computer that learns from its errors and never stops computing.

Understanding how interacting particles approach thermal equilibrium is a major challenge of quantum simulators1,2. Unlocking the full potential of such systems towards this goal requires flexible initial state preparation, precise time evolution and extensive probes for final state characterization. Here we present a quantum simulator comprising 69 superconducting qubits that supports both universal quantum gates and high-fidelity analogue evolution, with performance beyond the reach of classical simulation in cross-entropy benchmarking experiments. This hybrid platform features more versatile measurement capabilities compared with analogue-only simulators, which we leverage here to reveal a coarsening-induced breakdown of Kibble-Zurek scaling predictions3 in the XY model, as well as signatures of the classical Kosterlitz-Thouless phase transition4. Moreover, the digital gates enable precise energy control, allowing us to study the effects of the eigenstate thermalization hypothesis5-7 in targeted parts of the eigenspectrum. We also demonstrate digital preparation of pairwise-entangled dimer states, and image the transport of energy and vorticity during subsequent thermalization in analogue evolution. These results establish the efficacy of superconducting analogue-digital quantum processors for preparing states across many-body spectra and unveiling their thermalization dynamics.

The prevailing view is that quantum phenomena can be harnessed to tackle certain problems beyond the reach of classical approaches. Quantifying this capability as a quantum-classical separation and demonstrating it on current quantum processors has remained elusive. Using a superconducting qubit processor, we show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits. With a few qubits, we illustrate quantum contextuality with the magic square game, as well as quantify it through a Kochen–Specker–Bell inequality violation. To examine many-body contextuality, we implement the N-player GHZ game and separately solve a 2D hidden linear function problem, exceeding classical success rate in both. Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.

Quantum observables in the form of few-point correlators are the key to characterizing the dynamics of quantum many-body systems. In dynamics with fast entanglement generation, quantum observables generally become insensitive to the details of the underlying dynamics at long times due to the effects of scrambling. In experimental systems, repeated time-reversal protocols have been successfully implemented to restore sensitivities of quantum observables. Using a 103-qubit superconducting quantum processor, we characterize ergodic dynamics using the second-order out-of-time-order correlators, OTOC^(2). In contrast to dynamics without time reversal, OTOC^(2) are observed to remain sensitive to the underlying dynamics at long time scales. Furthermore, by inserting Pauli operators during quantum evolution and randomizing the phases of Pauli strings in the Heisenberg picture, we observe substantial changes in OTOC^(2) values. This indicates that OTOC^(2) is dominated by constructive interference between Pauli strings that form large loops in configuration space. The observed interference mechanism endows OTOC^(2) with a high degree of classical simulation complexity, which culminates in a set of large-scale OTOC^(2) measurements exceeding the simulation capacity of known classical algorithms. Further supported by an example of Hamiltonian learning through OTOC^(2), our results indicate a viable path to practical quantum advantage.

Hilbert space dimension is a key resource for quantum information processing1,2. Not only is a large overall Hilbert space an essential requirement for quantum error correction, but a large local Hilbert space can also be advantageous for realizing gates and algorithms more efficiently3-7. As a result, there has been considerable experimental effort in recent years to develop quantum computing platforms using qudits (d-dimensional quantum systems with d > 2) as the fundamental unit of quantum information8-19. Just as with qubits, quantum error correction of these qudits will be necessary in the long run, but so far, error correction of logical qudits has not been demonstrated experimentally. Here we report the experimental realization of an error-corrected logical qutrit (d = 3) and ququart (d = 4), which was achieved with the Gottesman-Kitaev-Preskill bosonic code20. Using a reinforcement learning agent21,22, we optimized the Gottesman-Kitaev-Preskill qutrit (ququart) as a ternary (quaternary) quantum memory and achieved beyond break-even error correction with a gain of 1.82 ± 0.03 (1.87 ± 0.03). This work represents a novel way of leveraging the large Hilbert space of a harmonic oscillator to realize hardware-efficient quantum error correction.

The promise of fault-tolerant quantum computing is challenged by environmental drift that relentlessly degrades the quality of quantum operations. The contemporary solution, halting the entire quantum computation for recalibration, is unsustainable for the long runtimes of the future algorithms. We address this challenge by unifying calibration with computation, granting the quantum error correction process a dual role: its error detection events are not only used to correct the logical quantum state, but are also repurposed as a learning signal, teaching a reinforcement learning (RL) agent to continuously steer the physical control parameters and stabilize the quantum system during the computation. We experimentally demonstrate this framework on a Willow superconducting processor, improving the logical stability of the surface code 3.5-fold against injected drift. By synthesizing our full suite of technological advances, including RL fine-tuning of the entire system and near-optimal decoding, we achieve record performance of the surface and color codes, with average logical error per cycle of ε_L=7.72(9)×10^-4 and ε_L=8.19(14)×10^-3 respectively. Simulations of surface codes up to distance-15 with tens of thousands control parameters confirm the scalability of our RL framework, revealing an optimization speed that is independent of the system size. This work thus enables a new paradigm: a quantum computer that learns from its errors and never stops computing.

A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome checks, permitting correction of logical information. Recently, the development of time-dynamic approaches to error correction has uncovered new codes and new code implementations. In this work, we experimentally demonstrate three time-dynamic implementations of the surface code, each offering a unique solution to hardware design challenges and introducing flexibility in surface code realization. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Finally, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead. We measure the error suppression factor when scaling from distance-3 to distance-5 codes of Λ_35,hex = 2.15(2), Λ_35,walk = 1.69(6), and Λ_35,iSWAP = 1.56(2), achieving state-of-the-art error suppression for each. With detailed error budgeting, we explore their performance trade-offs and implications for hardware design. This work demonstrates that dynamic circuit approaches satisfy the demands for fault-tolerance and opens new alternative avenues for scalable hardware design.

Lattice gauge theories (LGTs)1-4 can be used to understand a wide range of phenomena, from elementary particle scattering in high-energy physics to effective descriptions of many-body interactions in materials5-7. Studying dynamical properties of emergent phases can be challenging, as it requires solving many-body problems that are generally beyond perturbative limits8-10. Here we investigate the dynamics of local excitations in a Z 2 LGT using a two-dimensional lattice of superconducting qubits. We first construct a simple variational circuit that prepares low-energy states that have a large overlap with the ground state; then we create charge excitations with local gates and simulate their quantum dynamics by means of a discretized time evolution. As the electric field coupling constant is increased, our measurements show signatures of transitioning from deconfined to confined dynamics. For confined excitations, the electric field induces a tension in the string connecting them. Our method allows us to experimentally image string dynamics in a (2+1)D LGT, from which we uncover two distinct regimes inside the confining phase: for weak confinement, the string fluctuates strongly in the transverse direction, whereas for strong confinement, transverse fluctuations are effectively frozen11,12. We also demonstrate a resonance condition at which dynamical string breaking is facilitated. Our LGT implementation on a quantum processor presents a new set of techniques for investigating emergent excitations and string dynamics.

Bosonic codes offer a hardware-efficient strategy for quantum error correction by redundantly encoding quantum information in the large Hilbert space of a harmonic oscillator. However, experimental realizations of these codes are often limited by ancilla errors propagating to the encoded logical qubit during syndrome measurements. The Kerr-cat qubit has been proposed as an ancilla for these codes due to its theoretically-exponential noise bias, which would enable fault-tolerant error syndrome measurements, but the coupling required to perform these syndrome measurements has not yet been demonstrated. In this work, we experimentally realize driven parametric coupling of a Kerr-cat qubit to a high-quality-factor microwave cavity and demonstrate a gate set that would enable universal quantum control of the cavity. We measure the decoherence of the cavity in the presence of the Kerr-cat and discover excess dephasing due to heating of the Kerr-cat to excited states. By engineering frequency-selective dissipation to counteract this heating, we are able to eliminate this dephasing, thereby demonstrating a high on-off ratio of control. Our results pave the way toward using the Kerr-cat to fault-tolerantly measure error syndromes of bosonic codes.

Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient alternative to resource-intensive distillation protocols; however, testing the proposal's assumptions represents a challenging departure from quantum memory experiments. We present an experimental study of magic state cultivation on a superconducting quantum processor. We implement cultivation, including code-switching into a surface code, and develop a fault-tolerant measurement protocol to bound the magic state fidelity. Cultivation reduces the error by a factor of 40, with a state fidelity of 0.9999(1) (retaining 8

Quantum error correction1-4 is essential for bridging the gap between the error rates of physical devices and the extremely low error rates required for quantum algorithms. Recent error-correction demonstrations on superconducting processors5-8 have focused primarily on the surface code9, which offers a high error threshold but poses limitations for logical operations. The colour code10 enables more efficient logic, but it requires more complex stabilizer measurements and decoding. Measuring these stabilizers in planar architectures such as superconducting qubits is challenging, and realizations of colour codes11-19 have not addressed performance scaling with code size on any platform. Here we present a comprehensive demonstration of the colour code on a superconducting processor8. Scaling the code distance from three to five suppresses logical errors by a factor of Λ3/5 = 1.56(4). Simulations indicate this performance is below the threshold of the colour code, and the colour code may become more efficient than the surface code following modest device improvements. We test transversal Clifford gates with logical randomized benchmarking20 and inject magic states21, a key resource for universal computation, achieving fidelities exceeding 99% with post-selection. Finally, we teleport logical states between colour codes using lattice surgery22. This work establishes the colour code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors in the near future.

Quantum computing with discrete variable (DV, qubit) hardware is approaching the large scales necessary for computations beyond the reach of classical computers. However, important use cases such as quantum simulations of physical models containing bosonic modes, and quantum error correction are challenging for DV-only systems. Separately, hardware containing native continuous-variable (CV, oscillator) systems has received attention as an alternative approach, yet the universal control of such systems is non-trivial. In this work, we show that hybrid CV-DV hardware offers a great advantage in meeting these challenges, offering a powerful computational paradigm that inherits the strengths of both DV and CV processors. We provide a pedagogical introduction to CV-DV systems and the multiple abstraction layers needed to produce a full software stack connecting applications to hardware. We present a variety of new hybrid CV-DV compilation techniques, algorithms, and applications, including the extension of quantum signal processing concepts to CV-DV systems and strategies to simulate systems of interacting spins, fermions, and bosons. To facilitate the development of hybrid CV-DV processor systems, we introduce formal Abstract Machine Models and Instruction Set Architectures – essential abstractions that enable developers to formulate applications, compile algorithms, and explore the potential of current and future hardware for realizing fault-tolerant circuits, modules, and processors. Hybrid CV-DV quantum computations are beginning to be performed in superconducting, trapped ion, and neutral atom platforms, and large-scale experiments are set to be demonstrated in the near future. We present a timely and comprehensive guide to this relatively unexplored yet promising approach to quantum computation and providing an architectural backbone to guide future development.

Three-dimensional microwave cavity resonators have been shown to reach lifetimes of the order of a second by maximizing the cavity volume relative to its surface, using better materials, and improving surface treatments. Such cavities represent an ideal platform for quantum computing with bosonic qubits, but their efficient control remains an outstanding problem since the large mode volume results in inefficient coupling to nonlinear elements used for their control. Moreover, this coupling induces additional cavity decay via the inverse Purcell effect which can easily destroy the advantage of {a} long intrinsic lifetime. Here, we discuss conditions on, and protocols for, efficient utilization of these ultra-high-quality microwave cavities as memories for conventional superconducting qubits. We show that, surprisingly, efficient write and read operations with ultra-high-quality cavities does not require similar quality factors for the qubits and other nonlinear elements used to control them. Through a combination of analytical and numerical calculations, we demonstrate that efficient coupling to cavities with second-scale lifetime is possible with state-of-the-art transmon and SNAIL devices and outline a route towards controlling cavities with even higher quality factors. Our work explores a potentially viable roadmap towards using ultra-high-quality microwave cavity resonators for storing and processing information encoded in bosonic qubits.

Many proposals to scale quantum technology rely on modular or distributed designs where individual quantum processors, called nodes, are linked together to form one large multinode quantum computer (MNQC). One scalable method to construct an MNQC is using superconducting quantum systems with optical interconnects. However, a limiting factor of these machines will be internode gates, which may be two to three orders of magnitude noisier and slower than local operations. Surmounting the limitations of internode gates will require a range of techniques, including improvements in entanglement generation, the use of entanglement distillation, and optimized software and compilers, and it remains unclear how improvements to these components interact to affect overall system performance, what performance from each is required, or even how to quantify the performance of each. In this paper, we employ a `co-design' inspired approach to quantify overall MNQC performance in terms of hardware models of internode links, entanglement distillation, and local architecture. In the case of superconducting MNQCs with microwave-to-optical links, we uncover a tradeoff between entanglement generation and distillation that threatens to degrade performance. We show how to navigate this tradeoff, lay out how compilers should optimize between local and internode gates, and discuss when noisy quantum links have an advantage over purely classical links. Using these results, we introduce a roadmap for the realization of early MNQCs which illustrates potential improvements to the hardware and software of MNQCs and outlines criteria for evaluating the landscape, from progress in entanglement generation and quantum memory to dedicated algorithms such as distributed quantum phase estimation. While we focus on superconducting devices with optical interconnects, our approach is general across MNQC implementations.

We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons that avoids the boson-to-qubit mapping overhead encountered in qubit hardware. This framework gives exact decompositions of particle interactions such as density-density terms and gauge-invariant hopping, as well as approximate methods based on the Baker-Campbell Hausdorff formulas including the magnetic field term for the U(1) quantum link model in (2+1)D. We use this framework to show how to simulate dynamics using Trotterisation, perform ancilla-free partial error detection using Gauss's law, measure non-local observables, estimate ground state energies using a oscillator-qubit variational quantum eigensolver as well as quantum signal processing, and we numerically study the influence of hardware errors in circuit QED experiments. To show the advantages over all-qubit hardware, we perform an end-to-end comparison of the gate complexity for the gauge-invariant hopping term and find an improvement of the asymptotic scaling with the boson number cutoff S from 𝒪(log(S)^2) to 𝒪(1) in our framework as well as, for bosonic matter, a constant factor improvement of better than 10^4. We also find an improvement from 𝒪(log(S)) to 𝒪(1) for the U(1) magnetic field term. While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware. This work establishes digital quantum simulation with hybrid oscillator-qubit hardware as a viable and advantageous method for the study of qubit-boson models in materials science, chemistry, and high-energy physics.