QuPort: Topology-, Port-, and Congestion-Aware Compilation for Modular Multi-QPU Quantum Systems

• URL: http://arxiv.org/abs/2605.12583v1
• Date: Tue, 12 May 2026 17:12:30 GMT
• Title: QuPort: Topology-, Port-, and Congestion-Aware Compilation for Modular Multi-QPU Quantum Systems
• Abstract summary: QuPort is a Python and Qiskit-based compilation framework.<n>It studies the setting through a weighted logical interaction graph, a directed physical coupling map, and an undirected QPU-level interconnect graph.<n>The framework also includes heavy-edge clustering, balanced greedy partitioning, simulated-annealing refinement, communication-port-aware layout, and extraction of remote two-qubit operations.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Modular quantum processors require a compiler to reason about two resources at the same time: local device connectivity and communication across QPUs. A mapping that is acceptable on a single coupling graph may be unsuitable for a modular machine if it creates excessive cross-QPU traffic, concentrates that traffic on a small number of interconnect links, or assigns many boundary qubits to a QPU with few communication ports. This paper presents QuPort, a Python and Qiskit-based compilation framework that studies this setting through an explicit three-level model: a weighted logical interaction graph, a directed physical coupling map, and an undirected QPU-level interconnect graph. The main partitioning method, TPCCAP, optimizes the implemented objective formed by weighted cut distance, communication-port overflow, and routed link-load congestion. The framework also includes heavy-edge clustering, balanced greedy partitioning, simulated-annealing refinement, communication-port-aware layout, extraction of remote two-qubit operations, local-only routing of per-QPU circuits, and topology-aware schedule estimation. The model is a compiler-level abstraction. It does not claim a calibrated hardware runtime or an implementation of a physical remote-gate protocol.

Related papers

• A Modular, Topology-Aware Software Stack for Entanglement-Based Distributed Quantum Computing [0.7344283583396618]
  We present an open-source framework for the compilation and scheduling of distributed quantum programs.<n>We show that the best-performing compilation strategy varies across the tested circuits and network configurations.
  arXiv  Detail & Related papers  (2026-09-14T15:24:47Z)
• Architectural scaling tradeoffs in modular 3D bosonic quantum processors [60.61253784194378]
  We propose a three-dimensional bosonic quantum processor built from coupled-cavity modules linked by interconnect networks.<n>We compare nearest-neighbor, hub-based, and hybrid architectures in terms of interconnect count, communication distance, resource concentration, and implementation complexity.
  arXiv  Detail & Related papers  (2026-08-22T02:31:24Z)
• Performance Analysis of QAOA Across Distributed Quantum Network Topologies Using SwitchQNet [0.32622301272834514]
  We study the Quantum Approximate Optimization Algorithm (QAOA) as a graph-structured optimization workload for QDC-based quantum computing.<n>We adapt QAOA to SwitchQNet, a distributed quantum compiler framework that schedules communication and entanglement generation over switch-based QDC networks.<n>We evaluate QAOA instances across Clos, fat-tree, and spine-leaf topologies, measuring communication latency, EPR-pair overhead, EPR wait time, retry overhead, and sensitivity to buffer size.
  arXiv  Detail & Related papers  (2026-07-26T01:45:57Z)
• InterQ: Communication-Aware Scheduling Across Modular QPUs with Classical and Quantum Links [9.431066688492217]
  We present InterQ, a communication-aware scheduler for modular QPU architectures with heterogeneous communication models.<n>We show how communication models and scheduler-driven cutting decisions affect throughput, latency, and fidelity.
  arXiv  Detail & Related papers  (2026-05-18T02:39:36Z)
• QuMod: Parallel Quantum Job Scheduling on Modular QPUs using Circuit Cutting [9.668642748122506]
  Many real-world applications require scaling to realize logical qubits via error correction.<n> hardware vendors are moving beyond single, monolithic QPUs toward modular architectures connected via interconnects.<n>We develop a multi-programmable scheduler for modular quantum systems that jointly considers qubit mapping, parallel circuit execution, measurement synchronization across subcircuits.
  arXiv  Detail & Related papers  (2026-04-13T05:27:30Z)
• Chipmunq: A Fault-Tolerant Compiler for Chiplet Quantum Architectures [40.10865338207471]
  We present Chipmunq, the first hardware-aware compiler for mapping and routing fault-tolerant circuits onto modular architectures.<n>Chipmunq achieves a 13.5x speedup in compilation time compared to state-of-the-art tools.
  arXiv  Detail & Related papers  (2026-03-17T11:20:37Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Network Operations Scheduling for Distributed Quantum Computing [0.0]
  We compare and contrast two approaches to solving the make span minimization problem.<n>One approach is based on the resource constrained project scheduling (RCPSP) framework, and another based on a greedy algorithm.<n>Our results illustrate the effectiveness of the RCPSP framework, while also underlining the relevance and usefulness of greedy algorithms.
  arXiv  Detail & Related papers  (2025-11-17T18:40:50Z)
• ConQuER: Modular Architectures for Control and Bias Mitigation in IQP Quantum Generative Models [40.972673943861075]
  Quantum generative models based on instantaneous quantum (IQP) circuits show great promise in learning complex distributions.<n>Current implementations suffer from lack of controllability over generated outputs and severe generation bias towards certain expected patterns.<n>We present a Controllable Quantum Generative Framework, ConQuER, which addresses both challenges through a modular circuit architecture.
  arXiv  Detail & Related papers  (2025-09-26T16:32:41Z)
• Generalised Circuit Partitioning for Distributed Quantum Computing [0.30723404270319693]
  This work introduces a graph-based formulation which allows joint optimisation of gate and state teleportation cost.<n>Using a basic genetic algorithm, improved performance over state-of-the-art methods is obtained in terms of both average e-bit cost and time scaling.
  arXiv  Detail & Related papers  (2024-08-02T17:59:51Z)
• A Modular Quantum Compilation Framework for Distributed Quantum Computing [0.0]
  Distributed Quantum Computing is a scalable approach for increasing the number of available qubits for computational tasks. We present a modular quantum compilation framework for DQC that takes into account both network and device constraints. We also devised a strategy for remote scheduling that can exploit both TeleGate and TeleData operations.
  arXiv  Detail & Related papers  (2023-05-04T16:13:23Z)
• An Adaptive Device-Edge Co-Inference Framework Based on Soft Actor-Critic [72.35307086274912]
  High-dimension parameter model and large-scale mathematical calculation restrict execution efficiency, especially for Internet of Things (IoT) devices. We propose a new Deep Reinforcement Learning (DRL)-Soft Actor Critic for discrete (SAC-d), which generates the emphexit point, emphexit point, and emphcompressing bits by soft policy iterations. Based on the latency and accuracy aware reward design, such an computation can well adapt to the complex environment like dynamic wireless channel and arbitrary processing, and is capable of supporting the 5G URL
  arXiv  Detail & Related papers  (2022-01-09T09:31:50Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.