dSABRE: A SABRE-Style Router for Multi-Core Distributed Quantum Computers

TL;DR

dSABRE is a novel routing algorithm for multi-core distributed quantum computers that significantly reduces EPR consumption by optimizing intra- and inter-core operations using advanced scoring and congestion management techniques.

Contribution

The paper introduces dSABRE, a SABRE-style router with new scoring, congestion relief, and dependency-respecting construction methods for efficient quantum circuit routing.

Findings

Reduces EPR consumption by 41-44% over TeleSABRE.

Achieves 16-68% reduction over pytket-dqc.

Scales effectively to circuits with up to 360 qubits.

Abstract

Minimising EPR consumption is the dominant objective when routing a quantum circuit on a distributed quantum computer (DQC). We present dSABRE, a SABRE-style router for multi-core processors that, on each iteration of a lookahead-driven loop, first resolves any intra-core front-layer gates by SWAP scoring and only falls back to scoring inter-core teleportation candidates when the intra-core front is empty. Three mechanisms drive the improvement over the state of the art: a five-term gate-centric teleportation score that generalises the local SWAP heuristic to the inter-core setting, whose explicit capacity-penalty term keeps the scorer from teleporting into saturated cores; a proactive congestion-relief pass that redistributes idle qubits out of high-demand cores before deadlock; and a BFS-layer construction of the inter-core extended set that respects DAG dependencies layer by layer rather than mixing wires in topological order. Across 18 MQT-Bench circuits at 25, 36, and 64 logical qubits, dSABRE reduces geometric-mean EPR consumption by 41-44% over TeleSABRE and by 16-68% over the gate-teleportation-based pytket-dqc, using standard Qiskit SabreLayout for the initial layout. A large-circuit QFT sweep at 100-360 qubits confirms scalability. Code and online appendices are available at https://github.com/ebony72/dsabre.