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

• URL: http://arxiv.org/abs/2607.22998v1
• Date: Sat, 25 Jul 2026 02:26:41 GMT
• Title: A Resource Estimation Model for the Hardware-Software Co-Design of Distributed Quantum Architectures
• Abstract summary: In distributed quantum computing, executing monolithic quantum circuits requires dedicated communication qubits to generate and distribute entanglement.<n>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.
• Score: 10.747369636425226
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• 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)
• Efficient Time-Aware Partitioning of Quantum Circuits for Distributed Quantum Computing [10.919776355400282]
  Distributed quantum computing (DQC) interconnects multiple smaller-scale quantum processing units (QPUs) to form a quantum network.<n>To minimize this communication overhead, DQC compilers must strategically partition quantum circuits by mapping logical qubits to distributed physical QPUs.<n>We propose a time-aware algorithm incrementally constructs a low-cost sequence of qubit assignments across successive time steps to minimize overall communication overhead.<n>Our proposed algorithm consistently achieves significantly lower communication costs than static baselines across varying circuit sizes, depths, and network topologies.
  arXiv  Detail & Related papers  (2026-03-04T14:43:10Z)
• A Framework for Quantum Data Center Emulation Using Digital Quantum Computers [4.4249067508724815]
  We propose a framework that emulates a distributed quantum computing system using a single quantum processor.<n>We introduce an experimentally grounded noise model based on quantum collision dynamics to quantify the interconnect-induced noise.<n>The framework is validated using IBM's quantum hardware, demonstrating the successful execution of remote gates.
  arXiv  Detail & Related papers  (2025-09-04T09:04:54Z)
• Hardware-Software Co-design for Distributed Quantum Computing [7.928706053656785]
  Distributed quantum computing (DQC) offers a pathway for scaling up quantum computing architectures beyond the confines of a single chip.<n> Entanglement is a crucial resource for implementing non-local operations in DQC.<n>We show that our hardware-software co-design improves both the runtime and the output fidelity under a realistic model of DQC.
  arXiv  Detail & Related papers  (2025-03-24T04:19:32Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Superconducting qubits at the utility scale: the potential and limitations of modularity [29.454068658181466]
  Fault-tolerant quantum computers (FTQCs) have the potential to address some of humanity's grand challenges.<n>This paper presents an architectural model of a potential FTQC based on superconducting qubits, divided into discrete modules and interconnected via coherent links.
  arXiv  Detail & Related papers  (2024-06-10T04:30:48Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Shuttling for Scalable Trapped-Ion Quantum Computers [2.8956730787977083]
  We propose an efficient shuttling schedule for Trapped-ion quantum computers. The proposed approach produces shuttling schedules with a close-to-minimal amount of time steps. An implementation of the proposed approach is publicly available as part of the open-source Munich Quantum Toolkit.
  arXiv  Detail & Related papers  (2024-02-21T19:00:04Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• On-Chip Hardware-Aware Quantization for Mixed Precision Neural Networks [52.97107229149988]
  We propose an On-Chip Hardware-Aware Quantization framework, performing hardware-aware mixed-precision quantization on deployed edge devices. For efficiency metrics, we built an On-Chip Quantization Aware pipeline, which allows the quantization process to perceive the actual hardware efficiency of the quantization operator. For accuracy metrics, we propose Mask-Guided Quantization Estimation technology to effectively estimate the accuracy impact of operators in the on-chip scenario.
  arXiv  Detail & Related papers  (2023-09-05T04:39:34Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation [3.8221353389253676]
  We introduce the Quantum Divide and Conquer Algorithm (QDCA), a hybrid variational approach to mapping large optimization problems onto distributed quantum architectures. This is achieved through the combined use of graph partitioning and quantum circuit cutting. We simulate the QDCA on instances of the Maximum Independent Set problem and find that it is able to outperform similar classical algorithms.
  arXiv  Detail & Related papers  (2021-07-15T18:00:32Z)

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.