More Like this

1. Toward a 2D Local Implementation of Quantum Low-Density Parity-Check Codes

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

   Berthusen, Noah; Devulapalli, Dhruv; Schoute, Eddie; Childs, Andrew M; Gullans, Michael J; Gorshkov, Alexey V; Gottesman, Daniel (January 2025, PRX Quantum)

   Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes that affects code performance and ease of physical realization. For device architectures restricted to two-dimensional (2D) local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error-correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investigate the family of bivariate-bicycle qLDPC codes and show that they are well suited for a parallel syndrome-measurement scheme using fast routing with local operations and classical communication (LOCC). Through circuit-level simulations, we find that in some parameter regimes, bivariate-bicycle codes implemented with this protocol have logical error rates comparable to the surface code while using fewer physical qubits. Published by the American Physical Society2025 

   more » « less
2. 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
3. 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
4. Universal gate set for optical lattice based atom interferometry

   https://doi.org/10.1103/PhysRevResearch.7.013246  

   LeDesma, Catie; Mehling, Kendall; Wilson, John Drew; Nicotra, Marco; Holland, Murray (March 2025, Physical Review Research)

   In this paper, we propose a paradigm for atom interferometry and demonstrate that there exists a universal set of atom optic components for inertial sensing. These components constitute gates with which we carry out quantum operations and represent input-output matter wave transformations between lattice eigenstates. Each gate is associated with a modulation pattern of the position of the optical lattice according to machine-designed protocols. In this methodology, a sensor can be reprogramed to respond to an evolving set of design priorities without modifying the hardware. We assert that such a gate set is metrologically universal, in analogy to universal gate sets for quantum computing. Experimental confirmation of the designed operation is demonstrated via imaging of the spatial evolution of a Bose-Einstein condensate in an optical lattice and by measurement of the momentum probabilities following time-of-flight expansion. The representation of several basic quantum sensing circuits is presented for the measurement of inertial forces, rotating reference frames, and gravity gradients. Published by the American Physical Society2025 

   more » « less
5. Diagnostics of Mixed-State Topological Order and Breakdown of Quantum Memory

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

   Fan, Ruihua; Bao, Yimu; Altman, Ehud; Vishwanath, Ashvin (May 2024, PRX Quantum)

   Topological quantum memory can protect information against local errors up to finite error thresholds. Such thresholds are usually determined based on the success of decoding algorithms rather than the intrinsic properties of the mixed states describing corrupted memories. Here we provide an intrinsic characterization of the breakdown of topological quantum memory, which both gives a bound on the performance of decoding algorithms and provides examples of topologically distinct mixed states. We employ three information-theoretical quantities that can be regarded as generalizations of the diagnostics of ground-state topological order, and serve as a definition for topological order in error-corrupted mixed states. We consider the topological contribution to entanglement negativity and two other metrics based on quantum relative entropy and coherent information. In the concrete example of the two-dimensional (2D) Toric code with local bit-flip and phase errors, we map three quantities to observables in 2D classical spin models and analytically show they all undergo a transition at the same error threshold. This threshold is an upper bound on that achieved in any decoding algorithm and is indeed saturated by that in the optimal decoding algorithm for the Toric code. Published by the American Physical Society2024 

   more » « less