InterQ: Communication-Aware Scheduling Across Modular QPUs with Classical and Quantum Links
- URL: http://arxiv.org/abs/2605.17769v1
- Date: Mon, 18 May 2026 02:39:36 GMT
- Title: InterQ: Communication-Aware Scheduling Across Modular QPUs with Classical and Quantum Links
- Abstract summary: 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.
- Score: 9.431066688492217
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: As quantum computing scales toward practical workloads, future systems are expected to move beyond single monolithic processors toward modular architectures that connect multiple QPUs. Different platforms realize this modularity through different communication models: superconducting systems rely on real-time classical links and dynamic-circuit coordination, trapped-ion systems use photonic interconnects for remote entanglement, and neutral-atom systems provide strong intra-core connectivity with proposed optical links for inter-core communication. This heterogeneity makes communication-aware scheduling essential for shared modular quantum cloud environments. We present InterQ, a communication-aware scheduler for modular QPU architectures with heterogeneous communication models. InterQ jointly considers qubit capacity, placement, parallel execution, and communication-driven dependencies across distributed subcircuits, while enabling adaptive circuit cutting to reduce makespan while balancing fidelity and communication overhead. The framework distinguishes classical-link execution, where measurement and feedforward impose synchronization constraints, from quantum-link execution, where entanglement distribution and state transfer determine coordination cost. Using a unified simulation framework to compare superconducting, trapped-ion, and neutral-atom modular systems, InterQ shows how communication models and scheduler-driven cutting decisions affect throughput, latency, and fidelity. Across evaluated workloads, InterQ exposes an architecture-dependent tradeoff: neutral-atom modular QPUs achieve the highest fidelity, superconducting systems minimize runtime, and trapped-ion systems provide a balanced intermediate profile across fidelity and makespan.
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) - Impact of Network Constraints on Fault-Tolerant Distributed Quantum Computing [7.664547380829572]
We present an end-to-end simulation framework that jointly models surface-code operations, internal QPU connectivity, and realistic network constraints.<n>The framework is modular by design, allowing individual components such as routings, scheduling policies, and network topologies to be independently replaced.
arXiv Detail & Related papers (2026-06-16T04:08:19Z) - QuPort: Topology-, Port-, and Congestion-Aware Compilation for Modular Multi-QPU Quantum Systems [0.0]
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.
arXiv Detail & Related papers (2026-05-12T17:12:30Z) - 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) - Quantum Clock Synchronization Networks: A Survey [44.015977790437454]
Quantum clock synchronization (QCS) aims to establish a shared temporal reference between distant nodes.<n>QCS protocols offer the potential to surpass classical precision bounds and enhance resilience against adversarial manipulations.<n>This survey provides a unified and critical overview of the rapidly growing QCS research landscape.
arXiv Detail & Related papers (2026-04-06T05:30:54Z) - FlowNet: Modeling Dynamic Spatio-Temporal Systems via Flow Propagation [43.89691389856747]
Accurately modeling complex dynamic-temporal systems requires capturing flow-mediated interdependencies and context-sensitive interaction dynamics.<n>Existing methods, predominantly graph-based or attention-driven, rely on similarity-driven connectivity assumptions, asymmetric flow exchanges that govern system evolution.<n>We propose Spatio-Temporal Flow, a physics-inspired paradigm that explicitly coupling models dynamic node transfers through quantifiable flow transfers governed by conservation principles.<n> Experiments demonstrate that FlowNet significantly outperforms existing state-of-the-art approaches on seven metrics in the modeling of three real-world systems, validating its efficiency and physical interpretability.
arXiv Detail & Related papers (2025-11-05T14:06:19Z) - Assessing the Role of Communication in Modular Multi-Core Quantum Systems [4.18611202348891]
We introduce qcomm, a simulator designed to evaluate the role of classical communication in modular quantum computing architectures.<n>We conduct an extensive experimental analysis to quantify the impact of classical communication bandwidth, interconnect types, and quantum circuit mapping strategies on overall execution time.<n>Our results show that, while classical communication is generally not the dominant contributor to execution time, its impact becomes increasingly relevant in optimized scenarios.
arXiv Detail & Related papers (2025-10-13T06:41:41Z) - 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) - CLASS: A Controller-Centric Layout Synthesizer for Dynamic Quantum Circuits [58.16162138294308]
CLASS is a controller-centric layout synthesizer designed to reduce inter-controller communication latency in a distributed control system.<n> Evaluations demonstrate that CLASS effectively reduces communication latency by up to 100% with only a 2.10% average increase in the number of additional operations.
arXiv Detail & Related papers (2025-09-19T08:11:55Z) - Accurate and Scalable Simulation of Cavity-Based Networks in Modular Quantum Architectures [3.1433046259345625]
Cavity-mediated interconnects are a promising platform for scaling modular quantum computers.<n>We first model the dynamics of deterministic inter-chip quantum state transfer using the Stimulated Raman Adiabatic Passage (STIRAP) protocol.<n>We then extend the NetSquid simulator to support cavity-based communication channels for mediating inter-chip state transfer and entanglement generation.
arXiv Detail & Related papers (2025-08-19T15:01:54Z) - On the Impact of Classical and Quantum Communication Networks Upon Modular Quantum Computing Architecture System Performance [2.5918656634705717]
We investigate the role of the network infrastructure in modular quantum computing architectures.<n>We show that classical communication does not become a bottleneck for systems exceeding one million qubits.
arXiv Detail & Related papers (2025-07-11T07:45:48Z) - Quantum Federated Learning with Entanglement Controlled Circuits and
Superposition Coding [44.89303833148191]
We develop a depth-controllable architecture of entangled slimmable quantum neural networks (eSQNNs)
We propose an entangled slimmable QFL (eSQFL) that communicates the superposition-coded parameters of eS-QNNs.
In an image classification task, extensive simulations corroborate the effectiveness of eSQFL.
arXiv Detail & Related papers (2022-12-04T03:18:03Z) - Neural Network-based OFDM Receiver for Resource Constrained IoT Devices [44.8697473676516]
We explore a novel, modular Machine Learning (ML)-based receiver chain design for the Internet of Things (IoT)
ML blocks replace the individual processing blocks of an OFDM receiver, and we describe this swapping for the legacy channel estimation, symbol demapping, and decoding blocks with Neural Networks (NNs)
Our evaluations demonstrate that the proposed modular NN-based receiver improves bit error rate of the traditional non-ML receiver by averagely 61% and 10% for the simulated and over-the-air datasets, respectively.
arXiv Detail & Related papers (2022-05-12T15:32:35Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z)
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.