Constant-Rate Entanglement Distillation for Fast Quantum Interconnects
Name
3695053.3731069.pdf
Size
4.2 MB
Format
Adobe PDF
Checksum (MD5)
83a95639246c71465d4ca80d7a35d5f5
Author(s)
Pattison, Christopher
Baranes, Gefen
Bonilla Ataides, Juan Pablo
Lukin, Mikhail D.
Zhou, Hengyun
Date Issued
June 20, 2025
Publisher
ACM|Proceedings of the 52nd Annual International Symposium on Computer Architecture
Citation
Christopher Pattison, Gefen Baranes, Juan Pablo Bonilla Ataides, Mikhail D. Lukin, and Hengyun Zhou. 2025. Constant-Rate Entanglement Distillation for Fast Quantum Interconnects. In Proceedings of the 52nd Annual International Symposium on Computer Architecture (ISCA '25). Association for Computing Machinery, New York, NY, USA, 257–270.
Version
Final published version
Abstract
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 schemes, our methods reduce the communication overhead by more than 10 × in relevant regimes, leading to a direct speed-up in the execution of distributed quantum algorithms.
Description
ISCA ’25, Tokyo, Japan
MIT Department
Massachusetts Institute of Technology. Department of Physics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3695053.3731069
