Skip to content

A Resource Estimation Model for the Hardware-Software Co-Design of Distributed Quantum Architectures

Jul 2026 · arXiv.org · Vol abs/2607.22998 · 0 citations · 24 references
Physics Computer Science

TL;DR

An economic order quantity model from perishable inventory theory is proposed to optimize the trade-off between entanglement distribution latency and the time cost of decoherence, offering a dual application for the hardware-software co-design of high-performance DQC.

Abstract

In distributed quantum computing (DQC), executing monolithic quantum circuits across multiple interconnected quantum processing units (QPUs) requires dedicated communication qubits to generate and distribute entanglement. Because the number of physical qubits within a QPU is finite, a trade-off emerges where allocating more communication qubits increases the capacity of quantum channels for concurrent non-local operations, but reduces the number of computational qubits available for local gate operations. Distributed quantum compilation routinely ignores this channel capacity, while hardware architects lack a method to determine it prior to quantum circuit partitioning. Moreover, scheduling entanglement on demand introduces severe latency, whereas pre-fetching exposes stored pairs to decoherence. We propose an economic order quantity model from perishable inventory theory to optimize the trade-off between entanglement distribution latency and the time cost of decoherence. The resulting estimate is driven by algorithmic demand and physical constraints, offering a dual application for the hardware-software co-design of high-performance DQC: for hardware architects, it gives the optimal allocation of dedicated communication qubits in static heterogeneous architectures; for compiler developers, it gives the optimal number to reserve dynamically in homogeneous architectures.

View source

Similar papers

#software testing Preprint Sep 2026

A Modular, Topology-Aware Software Stack for Entanglement-Based Distributed Quantum Computing

It is shown that the best-performing compilation strategy varies across the tested circuits and network configurations, and that both network topology and intra-QPU connectivity substantially affect the entanglement cost of execution.

Luke Andreesen, Shobhit Gupta, Sean E. Sullivan et al. · 0 citations
Preprint Sep 2026

Error Correction in a Distributed Quantum Computer

The first experimental demonstration of distributed quantum error detection and correction is reported, providing an experimental foundation for quantum error correction (QEC) across modular quantum architectures.

E. M. Ainley, A. Agrawal, T. Araki et al. · 2 citations
Preprint Jul 2026

Fault-Tolerant Logical Operations and Efficient State Preparation in Modular Quantum Architectures with Noisy Interfaces

This work investigates how errors at module interfaces and within individual QPUs affect fault-tolerant computation when qubits are encoded using the rotated surface code, and develops an efficient protocol for preparing distributed fault-tolerant logical GHZ states.

S. Chelluri, R. Mengoni, Tom Darras et al. · 0 citations
Preprint Aug 2026

Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms

This study systematically assesses diverse partitioning algorithms across standardized workloads and quantum network topologies to quantify the performance impact of network constraints and demonstrates that comprehensive circuit-level metrics are essential for guiding the future design of DQC compilers.

Javier Vela-Tambo, Davud Azizov, Tian Guo · 0 citations
Open access Aug 2026

Distributed variational quantum computing with deterministic entanglement tuning

This work proposes a distributed variational quantum computing protocol based on deterministic entanglement tuning that deterministically modulates pre-shared entanglement using only local operations and classical communication and suggests a practical alternative for near-term distributed quantum applications.

Ilhwan Kim, Yong-Su Kim, Kwang Jo Lee et al. · 0 citations
Preprint Sep 2026

Parallel Circuit Execution for Scalable Quantum Computation

The results show that circuit-level parallelism can reduce execution cost on current quantum hardware and simulation time on GPU clusters, with the potential for greater benefits as device quality and qubit counts increase.

Avimita Chatterjee, W. M. Brown, Si-Yuan Niu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.