More Like this

1. Spectroscopy and Modeling of ${}^{171}\mathrm{Yb}$ Rydberg States for High-Fidelity Two-Qubit Gates

   https://doi.org/10.1103/PhysRevX.15.011009  

   Peper, Michael; Li, Yiyi; Knapp, Daniel Y; Bileska, Mila; Ma, Shuo; Liu, Genyue; Peng, Pai; Zhang, Bichen; Horvath, Sebastian P; Burgers, Alex P; et al (January 2025, Physical Review X)

   Highly excited Rydberg states and their interactions play an important role in quantum computing and simulation. These properties can be predicted accurately for alkali atoms with simple Rydberg level structures. However, an extension of these methods to more complex atoms such as alkaline-earth atoms has not been demonstrated or experimentally validated. Here, we present multichannel quantum defect models for highly excited ${}^{174}\mathrm{Yb}$and ${}^{171}\mathrm{Yb}$Rydberg states with $L\le 2$. The models are developed using a combination of existing literature data and new, high-precision laser and microwave spectroscopy in an atomic beam, and validated by detailed comparison with experimentally measured Stark shifts and magnetic moments. We then use these models to compute interaction potentials between two Yb atoms, and find excellent agreement with direct measurements in an optical tweezer array. From the computed interaction potential, we identify an anomalous Förster resonance that likely degraded the fidelity of previous entangling gates in ${}^{171}\mathrm{Yb}$using $F=3/2$Rydberg states. We then identify a more suitable $F=1/2$state, and achieve a state-of-the-art controlled- gate fidelity of $\mathcal{F}=0.994\left(1\right)$, with the remaining error fully explained by known sources. This work establishes a solid foundation for the continued development of quantum computing, simulation, and entanglement-enhanced metrology with Yb neutral atom arrays. Published by the American Physical Society2025 

   more » « less
2. Optimization Tools for Distance-Preserving Flag Fault-Tolerant Error Correction

   https://doi.org/10.1103/PRXQuantum.5.020336  

   Pato, Balint; Tansuwannont, Theerapat; Huang, Shilin; Brown, Kenneth R (May 2024, PRX Quantum)

   Lookup-table decoding is fast and distance preserving, making it attractive for near-term quantum computer architectures with small-distance quantum error-correcting codes. In this work, we develop several optimization tools that can potentially reduce the space and time overhead required for flag fault-tolerant quantum error correction (FTQEC) with lookup-table decoding on Calderbank-Shor-Steane (CSS) codes. Our techniques include the compact lookup-table construction, the meet-in-the-middle technique, the adaptive time decoding for flag FTQEC, the classical processing technique for flag information, and the separate $X$- and $Z$-counting technique. We evaluate the performance of our tools using numerical simulation of hexagonal color codes of distances 3, 5, 7, and 9 under circuit-level noise. Combining all tools can result in an increase of more than an order of magnitude in the pseudothreshold for the hexagonal color code of distance 9, from $(1.34\pm 0.01)\times {10}^{-4}$to $(1.43\pm 0.07)\times {10}^{-3}$. Published by the American Physical Society2024 

   more » « less
3. Efficiently Verifiable Quantum Advantage on Near-Term Analog Quantum Simulators

   https://doi.org/10.1103/PRXQuantum.6.010341  

   Liu, Zhenning; Devulapalli, Dhruv; Hangleiter, Dominik; Liu, Yi-Kai; Kollár, Alicia J; Gorshkov, Alexey V; Childs, Andrew M (March 2025, PRX Quantum)

   Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on verification of an analog quantum simulation, in which the verifier need only run an $O\left({\lambda }^2\right)$-time classical computation, and the prover need only prepare $O\left(1\right)$samples of a history state and perform $O\left({\lambda }^2\right)$single-qubit measurements, for a security parameter $\lambda$. We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations. Published by the American Physical Society2025 

   more » « less
4. Fast and Parallelizable Logical Computation with Homological Product Codes

   https://doi.org/10.1103/PhysRevX.15.021065  

   Xu, Qian; Zhou, Hengyun; Zheng, Guo; Bluvstein, Dolev; Ataides, J_Pablo Bonilla; Lukin, Mikhail D; Jiang, Liang (May 2025, Physical Review X)

   Quantum error correction is necessary to perform large-scale quantum computation but requires extremely large overheads in both space and time. High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit numbers, but performing computation while maintaining low space cost has required serialization of operations and extra time costs. In this work, we design fast and parallelizable logical gates for qLDPC codes and demonstrate their utility for key algorithmic subroutines such as the quantum adder. Our gate gadgets utilize transversal logical s between a data qLDPC code and a suitably constructed ancilla code to perform parallel Pauli product measurements (PPMs) on the data logical qubits. For hypergraph product codes, we show that the ancilla can be constructed by simply modifying the base classical codes of the data code, achieving parallel PPMs on a subgrid of the logical qubits with a lower space-time cost than existing schemes for an important class of circuits. Generalizations to 3D and 4D homological product codes further feature fast PPMs in constant depth. While prior work on qLDPC codes has focused on individual logical gates, we initiate the study of fault-tolerant compilation with our expanded set of native qLDPC code operations, constructing algorithmic primitives for preparing $k$-qubit Greenberger-Horne-Zeilinger states and distilling or teleporting $k$magic states with $O\left(1\right)$space overhead in $O\left(1\right)$and $O\left(\sqrt{k}\log k\right)$logical cycles, respectively. We further generalize this to key algorithmic subroutines, demonstrating the efficient implementation of quantum adders using parallel operations. Our constructions are naturally compatible with reconfigurable architectures such as neutral atom arrays, paving the way to large-scale quantum computation with low space and time overheads. Published by the American Physical Society2025 

   more » « less
5. Symmetries as Ground States of Local Superoperators: Hydrodynamic Implications

   https://doi.org/10.1103/PRXQuantum.5.040330  

   Moudgalya, Sanjay; Motrunich, Olexei I (November 2024, PRX Quantum)

   Symmetry algebras of quantum many-body systems with locality can be understood using commutant algebras, which are defined as algebras of operators that commute with a given set of local operators. In this work, we show that these symmetry algebras can be expressed as frustration-free ground states of a local superoperator, which we refer to as a “super-Hamiltonian.” We demonstrate this for conventional symmetries such as ${\mathbb{Z}}_2$, $U\left(1\right)$, and $SU\left(2\right)$, where the symmetry algebras map to various kinds of ferromagnetic ground states, as well as for unconventional ones that lead to weak ergodicity-breaking phenomena of Hilbert-space fragmentation (HSF) and quantum many-body scars. In addition, we show that the low-energy excitations of this super-Hamiltonian can be understood as approximate symmetries, which in turn are related to slowly relaxing hydrodynamic modes in symmetric systems. This connection is made precise by relating the super-Hamiltonian to the superoperator that governs the operator relaxation in noisy symmetric Brownian circuits and this physical interpretation also provides a novel interpretation for Mazur bounds for autocorrelation functions. We find examples of gapped (gapless) super-Hamiltonians indicating the absence (presence) of slow modes, which happens in the presence of discrete (continuous) symmetries. In the gapless cases, we recover hydrodynamic modes such as diffusion, tracer diffusion, and asymptotic scars in the presence of $U\left(1\right)$symmetry, HSF, and a tower of quantum scars, respectively. In all, this demonstrates the power of the commutant-algebra framework in obtaining a comprehensive understanding of exact symmetries and associated approximate symmetries and hydrodynamic modes, and their dynamical consequences in systems with locality. Published by the American Physical Society2024 

   more » « less