UNIQ: Communication-Efficient Distributed Quantum Computing via Unified Nonlinear Integer Programming

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Zhong, Hui, Shen, Jiachen, Fan, Lei, Zhang, Xinyue, Wang, Hao, Pan, Miao, Han, Zhu
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912738043756544
author Zhong, Hui
Shen, Jiachen
Fan, Lei
Zhang, Xinyue
Wang, Hao
Pan, Miao
Han, Zhu
author_facet Zhong, Hui
Shen, Jiachen
Fan, Lei
Zhang, Xinyue
Wang, Hao
Pan, Miao
Han, Zhu
contents Distributed quantum computing (DQC) is widely regarded as a promising approach to overcome quantum hardware limitations. A major challenge in DQC lies in reducing the communication cost introduced by remote CNOT gates, which are significantly slower and more resource-consuming than local operations. Existing DQC approaches treat the three essential components (qubit allocation, entanglement management, and network scheduling) as independent stages, optimizing each in isolation. However, we observe that these components are inherently interdependent, and therefore adopting a unified optimization strategy can be more efficient to achieve the global optimal solutions. Consequently, we propose UNIQ, a novel DQC optimization framework that integrates all three components into a non-linear integer programming (NIP) model. UNIQ aims to reduce the circuit runtime by maximizing parallel Einstein-Podolsky-Rosen (EPR) pair generation through the use of idle communication qubits, while simultaneously minimizing the communication cost of remote gates. To solve this NP-hard formulated problem, we adopt two key strategies: a greedy algorithm for efficiently mapping logical qubits to different QPUs, and a JIT (Just-In-Time) approach that builds EPR pairs in parallel within each time slot. Extensive simulation results demonstrate that our approach is widely applicable to diverse quantum circuits and QPU topologies, while substantially reducing communication cost and runtime over existing methods.
format Preprint
id arxiv_https___arxiv_org_abs_2512_00401
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle UNIQ: Communication-Efficient Distributed Quantum Computing via Unified Nonlinear Integer Programming
Zhong, Hui
Shen, Jiachen
Fan, Lei
Zhang, Xinyue
Wang, Hao
Pan, Miao
Han, Zhu
Quantum Physics
Distributed, Parallel, and Cluster Computing
Distributed quantum computing (DQC) is widely regarded as a promising approach to overcome quantum hardware limitations. A major challenge in DQC lies in reducing the communication cost introduced by remote CNOT gates, which are significantly slower and more resource-consuming than local operations. Existing DQC approaches treat the three essential components (qubit allocation, entanglement management, and network scheduling) as independent stages, optimizing each in isolation. However, we observe that these components are inherently interdependent, and therefore adopting a unified optimization strategy can be more efficient to achieve the global optimal solutions. Consequently, we propose UNIQ, a novel DQC optimization framework that integrates all three components into a non-linear integer programming (NIP) model. UNIQ aims to reduce the circuit runtime by maximizing parallel Einstein-Podolsky-Rosen (EPR) pair generation through the use of idle communication qubits, while simultaneously minimizing the communication cost of remote gates. To solve this NP-hard formulated problem, we adopt two key strategies: a greedy algorithm for efficiently mapping logical qubits to different QPUs, and a JIT (Just-In-Time) approach that builds EPR pairs in parallel within each time slot. Extensive simulation results demonstrate that our approach is widely applicable to diverse quantum circuits and QPU topologies, while substantially reducing communication cost and runtime over existing methods.
title UNIQ: Communication-Efficient Distributed Quantum Computing via Unified Nonlinear Integer Programming
topic Quantum Physics
Distributed, Parallel, and Cluster Computing
url https://arxiv.org/abs/2512.00401