Sampling problems are widely regarded as the task for which quantum computers can most readily provide a quantum advantage. Leveraging this feature, the quantum-enhanced Markov chain Monte Carlo [Layden et al., Nature 619, 282–287 (2023)] has been proposed recently, where sampling from a quantum computer is used as a proposal distribution and convergence to a target distribution is accelerated. However, guaranteeing convergence to the target distribution typically forces one to impose restrictive symmetry constraints on the quantum circuit, which makes it hard to design good proposal distributions and prevents making full use of the advantage of a quantum computer. We explore a hybrid quantum-classical Markov chain Monte Carlo framework that combines a quantum circuit with a generative neural sampler (GNS). The GNS is trained on quantum samples and acts as a classical surrogate to efficiently emulate quantum outputs, thereby lifting circuit constraints. We apply this method to Boltzmann sampling of spin glasses using proposals trained with a quantum approximate optimization algorithm circuit. This approach outperforms conventional methods, showing a polynomial speedup (over cubic) in spectral gap compared with uniform proposals. Notably, it maintains similar acceleration even without parameter optimization. These results establish the method as a viable sampling-based quantum algorithm for noisy intermediate-scale quantum devices and highlight its potential for solving practical problems with quantum computation.

Open quantum systems described by a non-Hermitian Hamiltonian exhibit rich dynamics due to the topology of their complex energy spectrum. By encircling an exceptional point degeneracy, this topology allows for topological state transport, chiral geometric phases, and eigenvalue braiding. To access these topological features, it is desirable to drive the system adiabatically. However, adiabatic transport in a system with a complex spectrum is conventionally only possible for the eigenstate whose eigenenergy has the lowest loss. Previous experiments have demonstrated such adiabatic evolution for the quantum state with relative gain, yet observed a breakdown in adiabaticity for quantum states with relative loss. In this work, we harness a shortcut to adiabaticity—counterdiabatic driving—to avoid the effects of loss while maintaining trajectories that follow the instantaneous eigenstates in significantly shorter timescales. We experimentally investigate the robustness of this control method using a superconducting transmon circuit with engineered dissipation. We observe that counterdiabatic driving stabilizes quasistatic transport and preserves the complex energy spectrum’s topology.

Conveyor-mode shuttling is a key approach for implementing intermediate-range coupling between electron-spin qubits in quantum dots. Initial implementations are encouraging; however, long shuttling trajectories are guaranteed to encounter regions of low conduction-band valley-energy splittings, due to the presence of random-alloy disorder in $\mathrm{Si}$/$\mathrm{Si}\mathrm{Ge}$ quantum wells. Here, we theoretically explore two schemes for avoiding valley-state excitations at these valley-splitting minima, by allowing the electrons to detour around them. A multichannel shuttling scheme allows electrons to tunnel between parallel channels, while a two-dimensional (2D) shuttler provides full omnidirectional control. Using simulations, we estimate shuttling fidelities in these two schemes, obtaining a clear preference for the 2D shuttler. Based on such encouraging results, we propose a modular qubit architecture based on 2D shuttling, which enables all-to-all connectivity within qubit plaquettes and high-fidelity communication between different plaquettes.

Transversal logical gates offer the opportunity for fast and low-noise logic, particularly when interspersed by a single round of parity check measurements of the underlying code. Using such circuits for the surface code requires decoding across logical gates, complicating the decoding task. We show how one can decode across an arbitrary sequence of transversal gates for the unrotated surface code, using a fast “logical observable” minimum-weight perfect matching-based decoder, and benchmark its performance in Clifford circuits under circuit-level noise. We propose windowed logical observable matching decoders to address the problem of fully efficient decoding: our basic windowed decoder is computationally efficient under the restriction of quiescent (slow) resets. Our “advanced” two-step windowed decoder can be computationally inefficient but allows fast resets. For both windowed decoders we identify errors which scale sublinearly in $d$—depending on the structure of the circuit—which can lead to logical failure, and we propose methods to adapt the decoding to remove such failures. Our work highlights the complexity and interest in efficient decoding of fast logic for the surface code.

Estimating observable expectation values in eigenstates of quantum systems has a broad range of applications and is an area where early fault-tolerant quantum computers may provide practical quantum advantage. We develop a hybrid quantum-classical algorithm that enables the estimation of an arbitrary observable expectation value in an eigenstate, given an initial state is supplied that has dominant overlap with the targeted eigenstate—but may overlap with any other eigenstates. Our approach builds on and is conceptually similar to purification-based error mitigation techniques; however, it achieves exponential suppression of algorithmic errors using only a single copy of the quantum state. The key innovation is that random time evolution is applied in the quantum computer to create an average mixed quantum state, which is then virtually purified with exponential efficacy. We prove rigorous performance guarantees and conclude that the complexity of our approach depends directly on the energy gap in the problem Hamiltonian and remarkably, can be compared to phase estimation combined with amplitude estimation in terms of its scaling with respect to a target precision. We demonstrate in a broad range of numerical simulations the applicability of our framework in near-term and early fault-tolerant settings. Furthermore, we demonstrate in a 100-qubit example that direct classical simulation of our approach enables the prediction of ground and excited state properties of quantum systems using tensor-network techniques, which we recognize as a quantum-inspired classical approach.

Quantum electrodynamics (QED), a cornerstone framework that describes light-matter interactions rooted in Abelian symmetries, renders the harnessing of synthetic non-Abelian gauge fields as a fundamental yet uncharted frontier. Here, we develop a general theory of light-matter interaction of quantum emitters embedded in non-Abelian photonic lattices. Based on analytical solutions to the non-Abelian Landau dressed states beyond the continuum limit, we reveal chiral photon emission and vortices with emergent nonreciprocity enabled by selective coupling between emitters and spin-momentum-locked bands. When coexisting with Abelian and non-Abelian magnetic fields, emitters hybridize with Landau dressed orbits to form spin-polarized, squeezed Landau polaritons that carry quantized angular momenta, with Rabi frequencies tunable via Landau levels and pseudospin interactions. Multiemitter dynamics further exhibit collective phenomena governed by real-space staggered phases induced by nonsymmorphic crystalline symmetry. These results bridge non-Abelian physics with quantum optics and establish non-Abelian gauge fields as a versatile tool for synthesizing topological quantum optical states, angular momentum transfer, and controlling photon-mediated correlations in QED systems, relevant for applications in quantum simulations and chiral quantum optical networks.

Kitaev’s toric code has become one of the most studied models in physics and is highly relevant to the fields of both quantum error correction and condensed matter physics. Most notably, it is the simplest known model hosting an extended, deconfined topological bulk phase. To this day, it remains challenging to reliably and robustly probe topological phases, as many state-of-the-art order parameters are sensitive to specific models and even specific parameter regimes. With the emergence of powerful quantum simulators which are approaching the regimes of topological bulk phases, there is a timely need for experimentally accessible order parameters. Here we study the ground state physics of the parallel field toric code on the honeycomb, triangular, and cubic lattices using continuous-time quantum Monte Carlo. By extending the concept of experimentally accessible percolation-inspired order parameters (POPs) we show that electric and magnetic anyons are independently confined on the honeycomb and triangular lattices, unlike on the square lattice. Our work manifestly demonstrates that, even in the ground state, we must make a distinction between topological order and (de-)confinement. Moreover, we report multicritical points in the aforementioned confinement phase diagrams. Finally, we map out the topological phase diagrams on the honeycomb, triangular, and cubic lattices and compare the performance of the POPs with other topological order parameters. Our work paves the way for studies of confinement involving dynamical matter and the associated multicritical points in contemporary quantum simulation platforms for ${\mathbb{Z}}_2$ lattice gauge theories.

Efficient and high-performance quantum error correction is essential for achieving fault-tolerant quantum computing. Low-depth random circuits offer a promising approach to identifying effective and practical encoding strategies. In this work, we rigorously prove through information-theoretic analysis that one-dimensional logarithmic-depth random Clifford encoding circuits can achieve high quantum error correction performance. We demonstrate that these random codes typically exhibit good approximate quantum error correction capability by proving that their encoding rate achieves the hashing bound for Pauli noise and the channel capacity for erasure errors. We show that the error correction inaccuracy decays once a threshold of logarithmic depth is exceeded, resulting in negligible recovery errors. This threshold is shown to be lower than that of the simple separate block encoding, and the decay rate is higher. We further establish that these codes are optimal by proving that logarithmic depth is necessary to maintain a constant encoding rate and high error correction performance. To prove our results, we propose decoupling theorems tailored for one-dimensional low-depth circuits. These results also imply strong decoupling and rapid thermalization properties in low-depth random circuits and have potential applications in quantum information science and physics.

Cluster states are a class of multiqubit entangled states with broad applications such as quantum metrology and one-way quantum computing. Here, we present a protocol to generate frequency-bin-encoded dual-rail cluster states using a superconducting circuit consisting of a fixed-frequency transmon qubit, a resonator, and a Purcell filter. We implement time-frequency multiplexing by sequentially emitting copropagating microwave photons, where each time bin contains a dual-rail qubit encoded in two distinct frequency modes, and adjacent time bins are entangled to form the cluster state. The frequency-bin dual-rail encoding enables erasure detection based on photon occupancy. We characterize the state fidelity using quantum tomography and quantify the multipartite entanglement using localizable entanglement. Our implementation achieves a state fidelity exceeding $50\mathrm{\%}$ for a cluster state consisting of up to four logical qubits. The localizable entanglement remains across chains of up to seven logical qubits. After discarding the erasure errors, the fidelity exceeds $50\mathrm{\%}$ for states with up to eight logical qubits, and the entanglement persists across chains of up to 11 qubits. These results highlight the improved robustness of frequency-bin dual-rail encoding against photon loss compared to conventional single-rail schemes. This work provides a scalable pathway toward high-dimensional entangled state generation and photonic quantum information processing in the microwave domain.

Gaussian building blocks are essential for photonic quantum information processing, and universality can be practically achieved by equipping Gaussian circuits with adaptive measurement and feedforward. The number of adaptive steps then provides a natural parameter for computational power. Rather than assessing power only through sampling problems—the usual benchmark—we follow the ongoing shift toward tasks of practical relevance and study the quantum mean-value problem, i.e., estimating observable expectation values that underpin simulation and variational algorithms. More specifically, we analyze bosonic circuits with adaptivity and prove that when the number of adaptive measurements is small, the mean-value problem admits efficient classical algorithms even if a large amount of non-Gaussian resources are present in the input state, whereas less constrained regimes are computationally hard. This yields a task-level contrast with sampling, where non-Gaussian ingredients alone often induce hardness, and provides a clean complexity boundary parameterized by the number of adaptive measurement-and-feedforward steps between classical simulability and quantum advantage. Beyond the main result, we introduce classical techniques—including a generalization of Gurvits’ second algorithm to arbitrary product inputs and Gaussian circuits—for computing the marginal quantities needed by our estimators, which may be of independent interest.

Quantum algorithms exploiting real-time evolution under a target Hamiltonian have demonstrated remarkable efficiency in extracting key spectral information. However, the broader potential of these methods, particularly beyond ground-state calculations, is underexplored. In this work, we introduce the framework of multiobservable dynamic mode decomposition (MODMD), which combines the observable dynamic mode decomposition (DMD), a measurement-driven eigensolver tailored for near-term implementation, with classical shadow tomography. MODMD leverages random scrambling in the classical shadow technique to construct, with exponentially reduced resource requirements, a signal subspace that encodes rich spectral information. Notably, we replace typical Hadamard-test circuits with a protocol designed to predict low-rank observables, thereby broadening the use of classical shadow tomography for predicting many low-rank observables. We establish theoretical guarantees on the spectral approximation from MODMD, taking into account distinct sources of error. In the ideal case, we prove that the spectral error scales as $\exp (-\mathrm{\Delta }E{t}_{\max })$, where $\mathrm{\Delta }E$ is the Hamiltonian spectral gap and $t_{\max }$ is the maximal simulation time. This analysis provides a rigorous justification of the rapid convergence observed across simulations. To demonstrate the utility of our framework, we consider its application to fundamental tasks, such as determining the low-lying, i.e., ground or excited, energies of representative many-body systems. Our work paves the path for efficient designs of measurement-driven algorithms on near-term and early fault-tolerant quantum devices.

Simulating nuclear matter described by quantum chromodynamics using quantum computers is notoriously inefficient because of the assortment of quark degrees of freedom such as matter/antimatter, flavor, color, and spin. Here, we propose to address this resource efficiency challenge by encoding three qubits within individual ytterbium-171 atoms of a neutral atom quantum processor. The three qubits are encoded in three distinct sectors: an electronic “clock” transition, the spin-1/2 nucleus, and the lowest two motional states in one radial direction of the harmonic trapping potential. We develop a family of composite sideband pulses and demonstrate a universal gate set and readout protocol for this three-qubit system. We then apply it to single-flavor quantum chromodynamics in 1+1D axial gauge for which the three qubits directly represent the occupancy of quarks in the three colors. We show that two atoms are sufficient to simulate both vacuum persistence oscillations and a screened hadron-number transition. We consider resource requirements and connections to error detection/correction. Our work is a step toward resource-efficient digital simulation of nuclear matter and opens new opportunities for versatile qubit encoding in neutral atom quantum processors.

Photonically interconnected matter qubit systems have wide-ranging applications across quantum science and technology, with entanglement between distant qubits serving as a universal resource. While state-of-the-art performance in heralded entanglement generation has thus far been achieved in trapped atomic systems modeled as stationary emitters, the improvements to fidelities and generation rates demanded by large-scale applications require consideration of their motional degrees of freedom. Here, we derive the effects of atomic motion on spontaneous emission coupled into arbitrary optical modes and study the implications for commonly used atom-atom entanglement protocols. We arrive at a coherent physical picture in the form of “kick operators” associated with each instant in the photonic wavepackets, which also suggests a method to mitigate motional errors by disentangling qubit and motion postherald. This proposed correction technique removes overheads associated with the thermal motion of atoms and may greatly increase entanglement rates in long-distance quantum network links by allowing single-photon-based protocols to be used in the high-fidelity regime.

Topologically ordered quantum systems give rise to anyonic quasiparticles, whose controlled braiding operations form the foundation of topological quantum computation. Traditionally, studies of anyons have relied on edge-state interferometry, leaving the direct detection and manipulation of anyons in the bulk a major experimental challenge. Here, we propose and theoretically investigate a pathway toward this goal by demonstrating that a long-lived, optically generated interlayer exciton can bind to a quasihole in a fractional quantum Hall state, forming a novel composite excitation: the anyon-trion. Using exact diagonalization techniques, we reveal that anyon-trions exhibit millielectronvolt-scale binding energies and a linear dependence on the fractional charge of the quasihole. This scaling offers a powerful means to optically extract the quasihole’s fractional charge through measurable shifts in exciton resonances. We outline a feasible experimental implementation via photoluminescence spectroscopy in a quantum twisting microscope setup, providing a promising route for the direct optical observation of anyon-trions within the bulk.

We propose the repetition code adapter as a way to perform joint logical Pauli measurements within a quantum low-density parity check (LDPC) codeblock or between separate such codeblocks, thus providing a flexible tool for fault-tolerant computation with quantum LDPC codes. This adapter is universal in the sense that it works regardless of the LDPC codes involved and the logical Paulis being measured. The construction achieves joint logical Pauli measurement of $t$ weight $O(d)$ operators using $O(d)$ time and $\tilde{O}(td)$ additional qubits and checks, up to a factor polylogarithmic in $d$. As a special case, for some geometrically local codes in fixed $D\ge 2$ dimensions, only $O(td)$ additional qubits and checks are required instead. By extending the adapter in the case $t=2$, we also construct a toric code adapter that uses $O(d^2)$ additional qubits and checks to perform addressable logical cnot gates on arbitrary LDPC codes via Dehn twists. To obtain these results, we develop a more general form of graph edge expansion and the $\mathsf{S}\mathsf{k}\mathsf{i}\mathsf{p}\mathsf{T}\mathsf{r}\mathsf{e}\mathsf{e}$ algorithm, which ensures a sparse transformation between different weight-2 check bases for the classical repetition code.

Entanglement among a large number of qubits is a crucial resource for many quantum algorithms. Such many-body states have been efficiently generated by entangling a chain of itinerant photonic qubits in the optical or microwave domain. However, it has remained challenging to fully characterize the generated many-body states by experimentally reconstructing their exponentially large density matrices. Here, we develop an efficient tomography method based on the matrix-product-operator formalism and demonstrate it on a cluster state of up to 35 microwave photonic qubits by reconstructing its $2^{35}\times 2^{35}$ density matrix. The full characterization enables us to detect the performance degradation of our photon source which occurs only when generating a large cluster state. This tomography method is generally applicable to various physical realizations of entangled qubits and provides an efficient benchmarking method for guiding the development of high-fidelity sources of entangled photons.

We investigate the efficiency of approximate counterdiabatic driving (CD) in accelerating adiabatic passage through exponentially small gaps. First, we analyze a minimal spin-glass bottleneck model that is analytically tractable and exhibits both an exponentially small gap at the transition point and a change in the ground state that involves a macroscopic rearrangement of spins. Using the variational Floquet-Krylov expansion to construct CD terms, we find that while the formation of excitations is significantly suppressed, achieving a fully adiabatic evolution remains challenging. Extending our investigation to realistic NP-hard spin-glass problems—specifically, the 3-regular Max Cut and 3-xorsat—we find again that local CD expansions lead to negligible improvements in the final ground-state fidelity. These results highlight the limited impact of local CD methods in overcoming the bottlenecks associated with first-order quantum phase transitions. To address this limitation, we propose an alternative method, termed quantum brachistochrone counterdiabatic driving (QBCD), which employs the approximate full CD connecting the ground state and the first-excited state at a single-parameter value close to the critical point. In the minimal spin-glass model, QBCD enables exponentially faster adiabatic evolution than the local strategies. To alleviate the challenges of its experimental and classical implementation for realistic np-hard problems, we exponentially reduce the nonlocality of the QBCD Hamiltonian by sparsifying its matrix elements to the density of the local expansions. Despite this drastic simplification, sparsified QBCD maintains finite ground-state fidelity at driving times exponentially shorter than in local strategies and counterdiabatic optimized local driving, demonstrating that even an exponentially reduced fraction of nonlocality near the critical point is sufficient to achieve significant speedup across spin-glass bottlenecks. At the same time, reduced nonlocality facilitates classical implementations via advanced numerical methods, while on quantum hardware its truncation serves as a resource-efficient approximation scheme for higher-order CD realizations.

Quantum spin models are ubiquitous in solid-state physics, but classical simulation of them remains extremely challenging. Experimental testbed systems with a variety of spin-spin interactions and measurement channels are therefore needed. One promising potential route to such testbeds is provided by microwave-photon-mediated interactions between superconducting qubits, where native strong light-matter coupling enables significant interactions even for virtual-photon-mediated processes. In this approach, the spin-model connectivity is set by the photonic mode structure, rather than the spatial structure of the qubit. Lattices of coplanar-waveguide (CPW) resonators have been demonstrated to allow extremely flexible connectivities and can therefore host a huge variety of photon-mediated spin models. However, large-scale CPW lattices with nontrivial band structures have never before been successfully combined with superconducting qubits. Here we present the first such device featuring a quasi-1D CPW lattice with multiple transmon qubits. We demonstrate that superconducting-qubit readout and diagnostic techniques can be generalized to this highly multimode environment and observe the effective qubit-qubit interaction mediated by the bands of the resonator lattice. This device completes the toolkit needed to realize CPW lattices with qubits in one or two Euclidean dimensions, or negatively curved hyperbolic space, and paves the way to driven-dissipative spin models with a large variety of connectivities.

Atomic, molecular and optical (AMO) approaches to quantum computing are promising due to their increased connectivity, long coherence times and apparent scalability. However, they have a significantly reduced cadence of syndrome extraction compared to superconducting devices, a potentially crippling slow-down given the substantial logical gate counts required for quantum advantage. Transversal logic, which exploits higher connectivity, has the potential to significantly speed up the logical clock rate by reducing the number of syndrome extraction rounds required, but current decoders for fast transversal logic are not scalable. This is not just because existing decoders are too slow to handle the large decoding volumes resulting from fast logic; transversal logic breaks the key structural properties that make real-time decoding of lattice surgery efficient. We introduce two windowed decoding protocols for transversal logic in the surface code that restore modularity and locality to the decoding problem. Using our protocols, we show that, with a very small space overhead, our scalable decoders unlock an order of magnitude speedup for transversal logic compared to lattice surgery. Taken together, our results provide key evidence for the viability of large-scale algorithms on AMO qubits.

Fault-tolerant quantum computation requires quantum error correction (QEC), which relies on entanglement to protect information from local noise. Achieving universality, however, demands overcoming the Eastin-Knill theorem. This is often accomplished through strategies like magic state distillation, a process that prepares computational resources—namely, magic states—whose power is now understood to be rooted in quantum contextuality, a fundamental nonclassical feature generalizing Bell nonlocality. Yet, the broader role of contextuality in enabling universality, including its significance as an inherent feature of QEC codes and protocols themselves, has remained largely unexplored. In this work, we develop a rigorous framework for contextuality in QEC and prove three main results. Fundamentally, we show that subsystem stabilizer codes with two or more gauge qubits are strongly contextual in their partial closure, while others are noncontextual, establishing a clear criterion for identifying contextual codes. Mathematically, we unify Abramsky-Brandenburger’s sheaf-theoretic and Kirby-Love’s tree-based definitions of contextuality, resolving a conjecture of Kim and Abramsky. Practically, we prove that many widely studied code-switching protocols which admit universal transversal gate sets, such as the doubled color codes introduced by Bravyi and Cross, are necessarily strongly contextual in their partial closure. Collectively, our results establish quantum contextuality as an intrinsic characteristic of fault-tolerant quantum codes and protocols, complementing entanglement and magic as resources for scalable quantum computation. For quantum coding theorists, this provides a new invariant: contextuality classifies which subsystem stabilizer codes can participate in universal fault-tolerant protocols. These findings position contextuality not only as a foundational concept but also as a practical guide for the design and analysis of future QEC architectures.