Suppressing errors is the central challenge for useful quantum computing¹, requiring quantum error correction (QEC)^2–6for large-scale processing. However, the overhead in the realization of error-corrected ‘logical’ qubits, in which information is encoded across many physical qubits for redundancy^2–4, poses substantial challenges to large-scale logical quantum computing. Here we report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Using logical-level control and a zoned architecture in reconfigurable neutral-atom arrays⁷, our system combines high two-qubit gate fidelities⁸, arbitrary connectivity^7,9, as well as fully programmable single-qubit rotations and mid-circuit readout^10–15. Operating this logical processor with various types of encoding, we demonstrate improvement of a two-qubit logic gate by scaling surface-code⁶distance fromd = 3 tod = 7, preparation of colour-code qubits with break-even fidelities⁵, fault-tolerant creation of logical Greenberger–Horne–Zeilinger (GHZ) states and feedforward entanglement teleportation, as well as operation of 40 colour-code qubits. Finally, using 3D [[8,3,2]] code blocks^16,17, we realize computationally complex sampling circuits¹⁸with up to 48 logical qubits entangled with hypercube connectivity¹⁹with 228 logical two-qubit gates and 48 logical CCZ gates²⁰. We find that this logical encoding substantially improves algorithmic performance with error detection, outperforming physical-qubit fidelities at both cross-entropy benchmarking and quantum simulations of fast scrambling^21,22. These results herald the advent of early error-corrected quantum computation and chart a path towards large-scale logical processors.

Synthesizing topological order: Topologically ordered matter exhibits long-range quantum entanglement. However, measuring this entanglement in real materials is extremely tricky. Now, two groups take a different approach and turn to synthetic systems to engineer the topological order of the so-called toric code type (see the Perspective by Bartlett). Satzinger et al . used a quantum processor to study the ground state and excitations of the toric code. Semeghini et al . detected signatures of a toric code–type quantum spin liquid in a two-dimensional array of Rydberg atoms held in optical tweezers. —JS

The ability to perform entangling quantum operations with low error rates in a scalable fashion is a central element of useful quantum information processing¹. Neutral-atom arrays have recently emerged as a promising quantum computing platform, featuring coherent control over hundreds of qubits^2,3and any-to-any gate connectivity in a flexible, dynamically reconfigurable architecture⁴. The main outstanding challenge has been to reduce errors in entangling operations mediated through Rydberg interactions⁵. Here we report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel, surpassing the surface-code threshold for error correction^6,7. Our method uses fast, single-pulse gates based on optimal control⁸, atomic dark states to reduce scattering⁹and improvements to Rydberg excitation and atom cooling. We benchmark fidelity using several methods based on repeated gate applications^10,11, characterize the physical error sources and outline future improvements. Finally, we generalize our method to design entangling gates involving a higher number of qubits, which we demonstrate by realizing low-error three-qubit gates^12,13. By enabling high-fidelity operation in a scalable, highly connected system, these advances lay the groundwork for large-scale implementation of quantum algorithms¹⁴, error-corrected circuits⁷and digital simulations¹⁵.

Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally investigate quantum algorithms for solving the maximum independent set problem. We use a hardware-efficient encoding associated with Rydberg blockade, realize closed-loop optimization to test several variational algorithms, and subsequently apply them to systematically explore a class of graphs with programmable connectivity. We find that the problem hardness is controlled by the solution degeneracy and number of local minima, and we experimentally benchmark the quantum algorithm’s performance against classical simulated annealing. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions in the deep circuit regime and analyze its origins.

Dynamic stabilization of an array: Large-scale systems comprising one-dimensional chains and two-dimensional arrays of excited atoms held in a programmable optical lattice are a powerful platform with which to simulate emergent phenomena. Bluvstein et al. built an array of up to 200 Rydberg atoms and subjected the system to periodic excitation. Under such driven excitation, they found that the array of atoms stabilized, freezing periodically into what looked like time crystals. Understanding and controlling the dynamic interactions in quantum many-body systems lies at the heart of contemporary condensed matter physics and the exotic phenomena that can occur. Science , this issue p. 1355

Neutral-atom arrays have recently emerged as a promising platform for quantum information processing. One important remaining roadblock for the large-scale application of these systems is the ability to perform error-corrected quantum operations. To entangle the qubits in these systems, atoms are typically excited to Rydberg states, which could decay or give rise to various correlated errors that cannot be addressed directly through traditional methods of fault-tolerant quantum computation. In this work, we provide the first complete characterization of these sources of error in a neutral-atom quantum computer and propose hardware-efficient, fault-tolerant quantum computation schemes that mitigate them. Notably, we develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. These advances allow us to significantly reduce the resource cost for fault-tolerant quantum computation compared to existing, general-purpose schemes. Our protocols can be implemented in the near term using state-of-the-art neutral-atom platforms with qubits encoded in both alkali and alkaline-earth atoms.