arXiv subjects

Mikhail D. Lukin

Publications and source records attributed to Mikhail D. Lukin.

At least 37 records · Page 2Linked to original sources

arXiv2026

Digital dissipative state preparation for frustration-free gapless quantum systems

Preparing algebraically correlated ground states of quantum many-body systems is an important, yet challenging task for quantum simulation. We introduce a protocol that employs local projective measurements and unitary feedback for frustration-free gapless systems. Our approach prepares a priori unknown ground states in time that scales polynomially with system size. We analytically show the performance our protocol for the dynamics of a single-particle; we argue the same mechanism generalizes to many-body systems based on the physics of quasiparticles. Our theory predicts that a transient cooling dynamics directly reveals the system's universal critical properties. In particular, the state preparation time is linear in the inverse of the finite-size gap (up to log correction) when the system's dynamical critical exponent is larger or equal the effective spatial dimension explored by the quasiparticles. We verify these predictions in numerical simulations of ferromagnetic Heisenberg models in one- and two dimensions, a Fredkin spin chain, and a two-dimensional model of resonating valence bond states. Our protocol stabilizes gapless many-body ground states fully digitally without requiring analog rotations, enabling access to high-fidelity states beyond conventional adiabatic approaches in near-term experiments.

quant-ph↗

arXiv2026

Engineering quantum criticality and dynamics on an analog-digital simulator

Understanding emergent phenomena in out-of-equilibrium interacting many-body systems is an exciting frontier in physical science. While quantum simulators represent a promising approach to this long-standing problem, in practice it can be challenging to directly realize the required interactions, measure arbitrary observables, and mitigate errors. Here we use coherent mapping between the Rydberg and hyperfine qubits in a neutral atom array simulator to engineer and probe complex quantum dynamics. We combine efficient analog dynamics with fully programmable state preparation and measurement, leverage non-destructive readout for loss information and atomic qubit reuse, and use an atom reservoir for replacing lost atoms. With this analog-digital approach, we first demonstrate dynamical engineering of ring-exchange and particle hopping dynamics via Floquet driving and measure the spectral function of single excitations by evolving initial superposition states. Extending these techniques to a 271-site kagome lattice, we employ closed-loop optimization to target an out-of-equilibrium critical quantum spin liquid of the Rokhsar-Kivelson type. We observe the key features of such a state, including the absence of local order, many-body coherences between nearly equal-amplitude dimer configurations over up to 18 sites, and universal correlations consistent with predictions from field theory. Together, these results pave the way for using dynamical control in analog-digital quantum simulators to study complex quantum many-body systems.

quant-ph↗

arXiv2026

In-situ benchmarking of fault-tolerant quantum circuits. I. Clifford circuits

Benchmarking physical devices and verifying logical algorithms are important tasks for scalable fault-tolerant quantum computing. Numerous protocols exist for benchmarking devices before running actual algorithms. In this work, we show that both physical and logical errors of fault-tolerant circuits can even be characterized in-situ using syndrome data. To achieve this, we map general fault-tolerant Clifford circuits to subsystem codes using the spacetime code formalism and develop a scheme for estimating Pauli noise in Clifford circuits using syndrome data. We give necessary and sufficient conditions for the learnability of physical and logical noise from given syndrome data, and show that we can accurately predict logical fidelities from the same data. Importantly, our approach requires only a polynomial sample size, even when the logical error rate is exponentially suppressed by the code distance, and thus gives an exponential advantage against methods that use only logical data such as direct fidelity estimation. We demonstrate the practical applicability of our methods in various scenarios using synthetic data as well as the experimental data from a recent demonstration of fault-tolerant circuits by Bluvstein et al. [Nature 626, 7997 (2024)]. Our methods provide an efficient, in-situ way of characterizing a fault-tolerant quantum computer to help gate calibration, improve decoding accuracy, and verify logical circuits.

quant-ph↗

arXiv2026

Entangling logical qubits without physical operations

Fault-tolerant logical entangling gates are essential for scalable quantum computing, but are limited by the error rates and overheads of physical two-qubit gates and measurements. To address this limitation, we introduce phantom codes-quantum error-correcting codes that realize entangling gates between all logical qubits in a code block purely through relabelling of physical qubits during compilation, yielding perfect fidelity with no spatial or temporal overhead. We present a systematic study of such codes. First, we identify phantom codes using complementary numerical and analytical approaches. We exhaustively enumerate all $2.71 \times 10^{10}$ inequivalent CSS codes up to $n=14$ and identify additional instances up to $n=21$ via SAT-based methods. We then construct higher-distance phantom-code families using quantum Reed-Muller codes and the binarization of qudit codes. Across all identified codes, we characterize other supported fault-tolerant logical Clifford and non-Clifford operations. Second, through end-to-end noisy simulations with state preparation, full QEC cycles, and realistic physical error rates, we demonstrate scalable advantages of phantom codes over the surface code across multiple tasks. We observe a one-to-two order-of-magnitude reduction in logical infidelity at comparable qubit overhead for GHZ-state preparation and Trotterized many-body simulation tasks, given a modest preselection acceptance rate. Our work establishes phantom codes as a viable architectural route to fault-tolerant quantum computation with scalable benefits for workloads with dense local entangling structure, and introduces general tools for systematically exploring the broader landscape of quantum error-correcting codes.

quant-ph↗

arXiv2026

Leveraging Qubit Loss Detection in Fault Tolerant Quantum Algorithms

Qubit loss errors constitute a dominant source of noise in many quantum hardware systems, particularly in neutral atom quantum computers. We develop a theoretical framework to effectively detect and correct loss errors in logical algorithms and leverage such loss information in decoding. Considering general quantum error correction codes and logical circuits, we introduce a delayed-erasure decoder for experimentally-motivated error models which leverages information from delayed loss detection to accurately correct loss errors, even when the precise moment of the error is unknown. Using this decoder, we identify strategies for detecting and correcting loss errors based on the logical circuit structure. For deep circuits prior to logical measurement, we explore methods to integrate loss detection into syndrome extraction with minimal overhead, identifying optimal strategies depending on the qubit loss fraction in the noise and hardware capabilities. In contrast, we find that many key algorithmic subroutines involve frequent gate teleportation, shortening the circuit depth before logical measurement and naturally replacing qubits with no additional experimental overhead. We simulate this setting using a toy model algorithm for small-angle synthesis, and find a significant performance improvement as the loss fraction increases. These results provide a path forward for advancing large-scale fault tolerant quantum computation in systems with loss error detection.

quant-ph↗

arXiv2026

Inverse Quantum Simulation for Quantum Material Design

Quantum simulation provides a powerful route for exploring many-body phenomena beyond the capabilities of classical computation. Existing approaches typically proceed in the forward direction: a model Hamiltonian is specified, implemented on a programmable quantum platform, and its phase diagram and properties are explored. Here we present a quantum algorithmic framework for inverse quantum simulation, enabling quantum material design with desired properties. Target material characteristics are encoded as a cost function, which is minimized on quantum hardware to prepare a many-body state with the desired properties in quantum memory. Hamiltonian learning is then used to reconstruct a low-energy Hamiltonian for which this state is an approximate ground state, yielding a physically interpretable model that can guide experimental synthesis. As illustrative applications, we outline how the method can be used to search for high-temperature superconductors within the fermionic Hubbard model, enhancing $d$-wave correlations over a broad range of dopings and temperatures, design quantum phases by stabilizing a topological order through continuous Hamiltonian modifications, and optimize dynamical properties relevant for photochemistry and frequency- and momentum-resolved condensed-matter data. These results extend the scope of quantum simulators from exploring quantum many-body systems to designing and discovering new quantum materials.

quant-ph↗

arXiv2026

Controlling Rydberg atom-polariton interactions: from exceptional points to fast readout

Rydberg atoms represent a platform underpinning many recent developments in quantum computation, simulation, sensing, and metrology. They further facilitate optical nonlinearity at the single-photon level when coupled to photons propagating in atomic clouds, which form collective atomic excitations called Rydberg polaritons, strongly interacting with each other. Here, we experimentally explore interactions between a Rydberg polariton in an atomic ensemble and a single, adjacent, Rydberg atom. We discover three different regimes of quantum dynamics corresponding to polariton blockade, coherent exchange, and probabilistic hopping, which are defined by their distinct transmission characteristics, with a transition through an exceptional point occurring between blockade and coherent exchange. We investigate the applications of such interactions for fast, non-destructive detection of Rydberg atoms and present proof-of-principle demonstrations for their potential application in nonlinear photonic networks.

physics.atom-ph↗

arXiv2025

Enhancing Optical Imaging via Quantum Computation

Extracting information from weak optical signals is a critical challenge across a broad range of technologies. Conventional imaging techniques, constrained to integrating over detected signals and classical post-processing, are limited in signal-to-noise ratio (SNR) from shot noise accumulation in the post-processing algorithms. We show that these limitations can be circumvented by coherently encoding photonic amplitude information into qubit registers and applying quantum algorithms to process the stored information from asynchronously arriving optical signals. As a specific example, we develop a quantum algorithm for imaging unresolved point sources and apply it to exoplanet detection. We demonstrate that orders-of-magnitude improvements in performance can be achieved under realistic imaging conditions using relatively small scale quantum processors.

quant-ph↗

arXiv2025

Dressed-state Hamiltonian engineering in a strongly interacting solid-state spin ensemble

In quantum science applications, ranging from many-body physics to quantum metrology, dipolar interactions in spin ensembles are controlled via Floquet engineering. However, this technique typically reduces the interaction strength between spins, and effectively weakens the coupling to a target sensing field, limiting the metrological sensitivity. In this work, we develop and demonstrate a method for direct tuning of the native interaction in an ensemble of nitrogen-vacancy (NV) centers in diamond. Our approach utilizes dressed-state qubit encoding under a magnetic field perpendicular to the crystal lattice orientation. This method leads to a $3.2\times$ enhancement of the dimensionless coherence parameter $JT_2$ compared to state-of-the-art Floquet engineering, and a $2.6\times$ ($8.3~$dB) enhanced sensitivity in AC magnetometry. Utilizing the extended coherence we experimentally probe spin transport at intermediate to late times. Our results provide a powerful Hamiltonian engineering tool for future studies with NV ensembles and other interacting higher-spin ($S>\frac{1}{2}$) systems.

quant-ph↗

arXiv2025

Deconfined quantum criticality on a triangular Rydberg array

Fluctuations can drive continuous phase transitions between two distinct ordered phases -- so-called deconfined quantum critical points (DQCPs) -- which lie beyond the Landau-Ginzburg-Wilson paradigm. Despite several theoretical predictions over the past decades, experimental evidence of DQCPs remains elusive. We show that a DQCP can be explored in a system of Rydberg atoms arranged on a triangular lattice and coupled through van der Waals interactions. Specifically, we investigate the nature of the phase transition between two ordered phases at 1/3 and 2/3 Rydberg excitation density, which were recently probed experimentally in [P. Scholl et al., Nature 595, 233 (2021)]. Using a field-theoretical analysis, we predict both the critical exponents for infinitely long cylinders of increasing circumference and the emergence of a conformal field theory near criticality showing an enlarged U(1) symmetry -- a signature of DQCPs -- and confirm these predictions numerically. Finally, we extend these results to ladder geometries and show how the emergent U(1) symmetry could be probed experimentally using finite tweezer arrays.

quant-ph↗

arXiv2025

Local arrows of time in quantum many-body systems

We demonstrate that in quantum many-body systems, local arrows of time can differ from the global time $t$ induced by Hamiltonian evolution. That is, within a quantum many-body system, the flow of time can be relative to each observer or by proxy each local subsystem. We provide a definition of local arrows of time in quantum many-body systems, and explain their relation to spacetime quantum entropies. Then we give a variety of numerical and analytical examples which explore different ways in which local arrows of time can manifest in quantum many-body dynamics, including exotic arrows of time arising from quantum thermalization and quantum error correction.

quant-ph↗

arXiv2025

Constant-Overhead Fault-Tolerant Bell-Pair Distillation using High-Rate Codes

We present a fault-tolerant Bell-pair distillation scheme achieving constant overhead through high-rate quantum low-density parity-check (qLDPC) codes. Our approach maintains a constant distillation rate equal to the code rate while requiring no additional overhead beyond the physical qubits of the code. Full circuit-level analysis demonstrates fault-tolerance for input Bell pair infidelities below a threshold $\sim 10\%$, readily achievable with near-term capabilities. Unlike previous proposals, our scheme keeps the output Bell pairs encoded in qLDPC codes at each node, eliminating un-encoding overhead and enabling direct use in distributed quantum applications through recent advances in qLDPC computation. These results establish qLDPC-based distillation as a practical route toward resource-efficient quantum networks and distributed quantum computing.

quant-ph↗

arXiv2025

Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes

The preparation of high-fidelity non-Clifford (magic) states is an essential subroutine for universal quantum computation, but imposes substantial space-time overhead. Magic state factories based on high rate and distance quantum low-density parity check (LDPC) codes equipped with transversal non-Clifford gates can potentially reduce these overheads significantly, by circumventing the need for multiple rounds of distillation and by producing a large number of magic states in a single code-block. As a step towards realizing efficient, fault-tolerant magic state production, we introduce a class of finite block-length quantum LDPC codes which we name tricycle codes, generalizing the well-known bicycle codes to three homological dimensions. These codes can support constant-depth physical circuits that implement logical $CCZ$ gates between three code blocks. To construct these constant-depth $CCZ$ circuits, we develop new analytical and numerical techniques that apply to a broad class of three-dimensional homological and balanced product codes. We further show that tricycle codes enable single-shot state-preparation and error correction, leading to a highly efficient magic-state generation protocol. Numerical simulations of specific codes confirm robust performance under circuit-level noise, demonstrating a high circuit-noise threshold of $>0.5\%$. With modest post-selection, certain tricycle codes of block-lengths of only $50-100$ qubits are shown to achieve logical error-rates of $6\times 10^{-10}$ or lower. Finally, we construct optimal depth syndrome extraction circuits for tricycle codes and present a protocol for implementing them efficiently on a reconfigurable neutral atom platform.

quant-ph↗

arXiv2025

Counterdiabatic Driving with Performance Guarantees

Counterdiabatic (CD) driving has the potential to speed up adiabatic quantum state preparation by suppressing unwanted excitations. However, existing approaches either require intractable classical computations or are based on approximations which do not have performance guarantees. We propose and analyze a non-variational, system-agnostic CD expansion method and analytically show that it converges exponentially quickly in the expansion order. In finite systems, the required resources scale inversely with the spectral gap, which we argue is asymptotically optimal. To extend our method to the thermodynamic limit and suppress errors stemming from high-frequency transitions, we leverage finite-time adiabatic protocols. In particular, we show that a time determined by the quantum speed limit is sufficient to prepare the desired ground state, without the need to optimize the adiabatic trajectory. Numerical tests of our method on the quantum Ising chain show that our method can outperform state-of-the-art variational CD approaches.

quant-ph↗

arXiv2025

Collective many-body dynamics in a solid-state quantum sensor controlled through nanoscale magnetic gradients

Coherent collective dynamics of strongly interacting qubits are a central resource in quantum information science, with applications from quantum computing and simulation to metrology. While electronic spins interact strongly via dipolar couplings in dense solid-state ensembles, imperfections and positional disorder pose major obstacles to coherent correlated behavior, limiting their usefulness. Here, we realize collective many-body dynamics by combining time-dependent magnetic field gradients with global coherent control of dense electron spin ensembles in diamond. We control and probe the dynamics of nanometer-scale spin spirals, and, by exploiting Hamiltonian engineering that enhances the microscopic symmetry of the interactions, we observe a disorder-resilient collective spin evolution. Our results establish a pathway to interaction-enhanced quantum metrology and nanoscale imaging of materials and biological systems under ambient conditions.

quant-ph↗

arXiv2025

Probing emergent prethermal dynamics and resonant melting on a programmable quantum simulator

The dynamics of isolated quantum systems following a sudden quench plays a central role in many areas of material science, high-energy physics, and quantum chemistry. Featuring complex phenomena with implications for thermalization, non-equilibrium phase transitions, and Floquet phase engineering, such far-from-equilibrium quantum dynamics is challenging to study numerically, in particular, in high-dimensional systems. Here, we use a programmable neutral atom quantum simulator to systematically explore quench dynamics in spin models with up to 180 qubits. By initializing the system in a product state and performing quenches across a broad parameter space, we discover several stable, qualitatively distinct dynamical regimes. We trace their robustness to Floquet-like prethermal steady states that are stabilized over long emergent timescales by strong dynamical constraints. In addition, we observe sharp peaks in the dynamical response that are quantitatively explained by the structured melting of prethermalization through resonances. In two dimensions, we uncover a sharp dynamical response change that converges with increased system size, that is linked to the proliferation of Néel-order defects and indicative of a dynamical phase transition with no equilibrium analogs. Uncovering an intricate interplay between quantum prethermalization and emergent dynamical phases, our results demonstrate the use of quantum simulators for revealing complex non-equilibrium quantum many-body phenomena.

quant-ph↗

arXiv2025

Batched high-rate logical operations for quantum LDPC codes

High-rate quantum LDPC (qLDPC) codes reduce memory overhead by densely packing many logical qubits into a single block of physical qubits. Here we extend this concept to high-rate computation by constructing \emph{batched} fault-tolerant operations that apply the same logical gate across many code blocks in parallel. By leveraging shared physical resources to execute many logical operations in parallel, these operations realize high rates in space-time and significantly reduce computational costs. For \emph{arbitrary} CSS qLDPC codes, we build batched gadgets with \emph{constant space-time overhead} (assuming fast classical computation) for (i) single-shot error correction, state preparation, and code surgeries (ii) code switching, and (iii) addressable Clifford gates. Using these batched gadgets we also construct parallel non-Clifford gates with low space-time cost. We outline principles for designing parallel quantum algorithms optimized for a batched architecture, and show in particular how lattice Hamiltonian dynamical simulations can be compiled efficiently. We also propose a near-term implementation using new self-dual Bivariate-Bicycle codes with high encoding rates ($\sim 1/10$), transversal Clifford gates, and global $T$ gates via parallel magic state cultivation, enabling Hamiltonian simulations with a lower space-time cost than analogous surface-code protocols and low-rate qLDPC protocols. These results open new paths toward scalable quantum computation via co-design of parallel quantum algorithms and high-rate fault-tolerant protocols.

quant-ph↗

arXiv2025

Probing the Kitaev honeycomb model on a neutral-atom quantum computer

Quantum simulations of many-body systems are among the most promising applications of quantum computers. In particular, models based on strongly-correlated fermions are central to our understanding of quantum chemistry and materials problems, and can lead to exotic, topological phases of matter. However, due to the non-local nature of fermions, such models are challenging to simulate with qubit devices. Here we realize a digital quantum simulation architecture for two-dimensional fermionic systems based on reconfigurable atom arrays. We utilize a fermion-to-qubit mapping based on Kitaev's model on a honeycomb lattice, in which fermionic statistics are encoded using long-range entangled states. We prepare these states efficiently using measurement and feedforward, realize subsequent fermionic evolution through Floquet engineering with tunable entangling gates interspersed with atom rearrangement, and improve results with built-in error detection. Leveraging this fermion description of the Kitaev spin model, we efficiently prepare topological states across its complex phase diagram and verify the non-Abelian spin liquid phase by evaluating an odd Chern number. We further explore this two-dimensional fermion system by realizing tunable dynamics and directly probing fermion exchange statistics. Finally, we simulate strong interactions and study dynamics of the Fermi-Hubbard model on a square lattice. These results pave the way for digital quantum simulations of complex fermionic systems for materials science, chemistry, and high-energy physics.

quant-ph↗