ATHENA: A Compiler For Optimized Scheduling In Distributed Quantum Computers
Won Joon Yun (1), Dhilan Nag (1), Sneha Ballabh (1), Jiapeng Zhao (2), Eneet Kaur (2), and Poulami Das (1) ((1) The University of Texas at Austin (2) Cisco Quantum Lab)

TL;DR
ATHENA is a novel compiler for distributed quantum computers that optimizes scheduling and teleportation to significantly reduce teleportations and latency.
Contribution
It introduces utility-driven lookahead and EPR-capacity-aware early scheduling to improve quantum program fidelity and performance.
Findings
Reduces teleportations by 34% on average
Achieves up to 65% reduction in teleportations
Doubles the latency reduction compared to prior methods
Abstract
Distributed Quantum Computers (DQCs) enable large system sizes by connecting smaller chips via photonic interconnects. DQCs use teleportation to relocate qubits and execute CNOTs between qubits on different chips. However, non-local CNOTs are 4.3-7.7 slower and 4 more error-prone than local CNOTs within a chip, which degrades program fidelities. Existing compilers group CNOTs with overlapping qubits into blocks and collectively optimize teleportations for each block. However, block-level scheduling has two key drawbacks. First, it lacks lookahead ability across blocks because it selects the optimal schedule for one block before proceeding to the next. As a result, it cannot assess the impact of a teleportation on future blocks. Our studies show that naively expanding the lookahead window to include subsequent blocks does not address this issue. Second, existing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
