Mikhail Lukin

High-rate quantum LDPC (qLDPC) codes reduce space overhead by densely packing many logical qubits into a single block of physical qubits. Here we extend such savings to computation by constructing 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 arbitrary CSS qLDPC codes, we build batched gadgets with constant space-time overhead for (i) single-shot error correction and state preparation, (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–friendly implementation using new self-dual Bivariate-Bicycle codes with high encoding rates (∼ 1/10), transversal Clifford gates, and global T gates, 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.

Performing large-scale, accurate quantum simulations of many-fermion systems is a central challenge in quantum science, with applications in chemistry, materials, and high-energy physics. Despite significant progress, realizing generic fermionic algorithms with qubit systems incurs significant space-time overhead, scaling as $O(N)$ for $N$ fermionic modes. Here we present a method for faster fermionic simulation with asymptotic space-time overhead of $O(\log(N))$ in the worst case, and $O(1)$ for circuits with additional structure, including important subroutines like the fermionic fast Fourier transform. This exponential reduction is achieved by using reconfigurable quantum systems with non-local connectivity, mid-circuit measurement, and classical feedforward, to generate dynamical fermion-to-qubit mappings. We apply this technique to achieve efficient compilation for key simulation tasks, including Hamiltonian simulation of the sparse Sachdev–Ye–Kitaev model and periodic materials, as well as free-fermion state-preparation. Moreover, we show that the algorithms themselves can be adapted to use only the $O(1)$-overhead structures to further reduce resource overhead. These techniques can lower gate counts by orders of magnitude for practical system sizes and are natively compatible with error corrected computation, making them ideal for early fault-tolerant quantum devices. Our results tightly bound the computational gap between fermionic and qubit models and open new directions in quantum simulation algorithm design and implementation.