The next generation of distributed quantum processors combines single-location quantum computing and quantum networking techniques to permit large entangled qubit groups to be established through remote processors, and quantum algorithms can be executed distributively. We present DisQ, as the first formal model of distributed quantum processors, and permit the analysis of distributed quantum programs in the new computation environment. The core of DisQ is a distributed quantum programming language that combines the concepts of Chemical Abstract Machine (CHAM) and Markov Decision Processes (MDP) with the objective of providing clearly distinguishing quantum concurrent and distributed behaviors. Based on the DisQ language, we develop a simulation relation, based on classical simulation infrastructure, to check the equivalence of a quantum algorithm and its distributed versions so that users can develop the distributed version of a sequential quantum program via a simulation check.
Distributed computing can scale the capacity of quantum computing through small quantum processors interconnected by quantum communication links. In contrast to monolithic quantum computers, it enables a large-scale, robust computing environment for practical, real-world tasks. Distributed quantum computing must overcome challenges in task distribution and resource optimization in order to obtain highfidelity results. Key tasks include managing quantum communication costs, mitigating communication noise, achieving high-fidelity entanglement, and optimizing qubit allocation. To solve these challenges, we present HiFi-DisQ, a distributed quantum computing framework that aims to provide high fidelity distributed quantum circuit performance by minimizing non-local operations, pattern-matching and circuit remapping algorithms. The proposed framework improves the circuit performance and provides faster transpilation and effective resource optimization. Our method shows
5%−20%improvement in fidelity and
4%−14%reduction in communication cost.
In the noisy intermediate scale quantum (NISQ) era, the Variational Quantum Algorithm (VQA) has emerged as one of the most promising approaches to harness the power of quantum computers. In VQA, a classical optimizer iteratively updates the parameters of a variational quantum circuit to minimize a cost objective obtained by executing the quantum circuit on real quantum hardware. However, the deployment of VQA applications on NISQ devices encounters substantial noise, which degrades training stability. Moreover, the drift of noise is particularly intractable due to its dynamic nature in duration and magnitude. Noise drift leads to significant deviations in VQA iteration's objective function estimation and shapes a dynamic noisy landscape, which poses a considerable challenge for stable VQA parameter training, thereby hampering the accurate convergence of VQA optimizations. This paper proposes DISQ to craft a stable landscape for VQA training and tackle the noise drift challenge. DISQ adopts a “drift detector” with a reference circuit to identify and skip iterations that are severely affected by noise drift errors. Specifically, the circuits from the previous training iteration are re-executed as a reference circuit in the current iteration to estimate noise drift impacts. The iteration is deemed compromised by noise drift errors and thus skipped if noise drift flips the direction of the ideal optimization gradient. To enhance noise drift detection reliability, we further propose to leverage multiple reference circuits from previous iterations to provide a well-founded judge of current noise drift. Nevertheless, multiple reference circuits also introduce considerable execution overhead. To mitigate extra overhead, we propose Pauli-term subsetting (prime and minor subsets) to execute only observable circuits with large coefficient magnitudes (prime subset) during drift detection. Only this minor subset is executed when the current iteration is drift-free. Evaluations across various applications and QPUs demonstrate that DISQ can mitigate a significant portion of the noise drift impact on VQAs and achieve 1.51-2.24× fidelity improvement over the traditional baseline. DISQ's benefit is 1.1-1.9× over the best alternative approach while boosting average noise detection speed by 2.07×.
We study space-bounded communication complexity for unitary implementation in distributed quantum processors, where we restrict the number of qubits per processor to ensure practical relevance and technical non-triviality. We model distributed quantum processors using distributed quantum circuits with nonlocal two-qubit gates, defining the distributed communication complexity of a unitary as the minimum number of such nonlocal gates required for its realization, up to permutations of data qubit positions. Our contributions are twofold. First, for general
n-qubit unitaries, we improve upon the trivial
O(4n) communication bound. Considering
k pairwise-connected processors (each with
n/k data qubits and
m ancillas), we prove the communication complexity satisfies
O(max{4(1−1/k)n−m,n}) -- for example,
O(2n) when
m=0 and
k=2 -- and establish the tightness of this upper bound. We further extend the analysis to approximation models and general network topologies. Second, for special unitaries, we show that both the Quantum Fourier Transform (QFT) and Clifford circuits admit linear upper bounds on communication complexity in the exact model, outperforming the trivial quadratic bounds applicable to these cases. In the approximation model, QFT's communication complexity reduces drastically from linear to logarithmic, while Clifford circuits retain a linear lower bound. These results offer fundamental insights for optimizing communication in distributed quantum unitary implementation, advancing the feasibility of large-scale DQC systems.