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

2026-05-20

AI Summary

This work addresses the excessive consumption of EPR pairs in distributed quantum computing by proposing the dSABRE routing algorithm. dSABRE prioritizes intra-core quantum gate execution and triggers inter-core teleportation only when necessary. It incorporates a quintic gate-centric scoring function, an active congestion mitigation strategy, and a BFS-layer-based mechanism for constructing cross-core expansion sets, effectively preventing core saturation and deadlock. By integrating SABRE’s heuristic SWAP scoring, DAG-aware layering, capacity-aware penalties, and Qiskit’s SabreLayout for initial qubit placement, dSABRE reduces EPR pair consumption by 41–44% compared to TeleSABRE and by 16–68% relative to pytket-dqc on the MQT-Bench benchmark. The algorithm also demonstrates strong scalability on quantum Fourier transform circuits ranging from 100 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.

Problem

• distributed quantum computing
• quantum circuit routing
• EPR consumption
• multi-core quantum processors
• quantum teleportation

Innovation

• distributed quantum computing
• quantum circuit routing
• EPR consumption minimization
• teleportation scoring
• congestion relief