Distributed quantum computing allows the modular construction of large-scale quantum computers and enables new protocols for blind quantum computation.However, such applications in the large-scale, fault-tolerant regime place stringent demands on the fidelity and rate of entanglement generation, which are not met by existing methods for quantum interconnects.In this work, we develop constant-rate entanglement distillation methods to address this bottleneck in the setting of noisy local operations.By using a sequence of two-way entanglement distillation protocols based on quantum error detecting codes with increasing rate, and combining with standard fault tolerance techniques, we achieve constant-rate entanglement distillation.We show that the scheme has constant-rate in expectation, and further numerically optimize to achieve low practical overhead under memory constraints.We find that compared to existing quantum interconnect * Both authors contributed equally to this research.

Neutral atom arrays have recently emerged as a promising platform for fault-tolerant quantum computing.Based on these advances, including dynamically-reconfigurable connectivity and fast transversal operations, we present a low-overhead architecture that supports the layout and resource estimation of large-scale fault-tolerant quantum algorithms.Utilizing recent advances in fault tolerance with transversal gate operations, this architecture achieves a run time speed-up on the order of the code distance 𝑑, which we find directly translates to run time improvements of large-scale quantum algorithms.Our architecture consists of functional building blocks of key algorithmic subroutines, including magic state factories, quantum arithmetic units, and quantum look-up tables.These building blocks are implemented using efficient transversal operations, and we design space-time efficient versions of them that minimize interaction We acknowledge helpful discussions with M. Beverland, A.