Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

DPRQ: A Dynamic Programming-based Compiler for Collective Communication in Distributed Quantum Computing.

Dhaval Kalpesh Vaidya

Published Mar 18, 2026• 0 citations
OpenAlex

Abstract

North Carolina State University Theses Computer Science

Related papers

DisQ: A Model of Distributed Quantum Processors

Le Chang (429190), Saitej Yavvari, Rance Cleaveland Y +3 more

Lecture notes in computer science•Jan 1, 2026•0 citations

DPRQ: A Dynamic Programming-based Qubit Routing Algorithm for Collective Communication in Distributed Quantum Computing

Dhaval Vaidya, Ruozhou Yu

Distributed quantum computing (DQC) offers a promising approach to scale quantum computing by overcoming the resource limitations of a single quantum processor. However, inter-node communication remains a major bottleneck of DQC due to inefficient and error-prone entanglement distribution. Optimizing inter-node communication can not only reduce the amount of entanglement resource needed to execute a quantum circuit but also improve execution speed and accuracy of the results. This paper proposes DPRQ, a qubit routing algorithm for minimizing inter-node communication in distributed quantum circuits divided into collective communication blocks. Unlike current approaches that utilize greedy block-level qubit routing strategies, DPRQ employs a dynamic programming-based technique focused on global circuit-level optimization, while capturing inter-block dependencies. We evaluated DPRQ on four sets of quantum circuits and a variety of DQC configurations. The results demonstrate that DPRQ's innovative routing strategy achieves an average of 24.40% reduction with a maximum of 85.06% reduction in inter-node communication, when compared to the state-of-the-art collective communication-based DQC compiler QuComm.

quant-pharXiv:2609.04524•Sep 7, 2026•0 citations

Noise-Parameterized Objectives for Variational Quantum Algorithms.

Aditya Baradwaj Rajan

North Carolina State University Theses Computer Science

•Mar 19, 2026•0 citations

OptQC : An optimized parallel quantum compiler

T. Loke, Jingbo B. Wang, Y.H. Chen

arXiv:1408.1612•Computer Physics Communications•Aug 7, 2014•6 citations

The Bounds of Quantum Computing in the Context of the B-SAT Problem and Optimizing FPGA-based State Vector Simulation.

Ahmad Bennakhi

North Carolina State University Theses Computer and Computer Engineering.

•Mar 27, 2025•0 citations

StateQ: A novel framework for intuitive and accessible quantum programming

J L Li, Dongdong Li, Ziyang Wang +4 more

Quantum Machine Intelligence•Jun 1, 2026•0 citations
Distributed quantum computing (DQC) offers a promising approach to scale quantum computing by overcoming the resource limitations of a single quantum processor. However, inter-node communication remains a major bottleneck of DQC due to inefficient and error-prone entanglement distribution. Optimizing inter-node communication can not only reduce the amount of entanglement resource needed to execute a quantum circuit but also improve execution speed and accuracy of the results. This paper proposes DPRQ, a qubit routing algorithm for minimizing inter-node communication in distributed quantum circuits divided into collective communication blocks. Unlike current approaches that utilize greedy block-level qubit routing strategies, DPRQ employs a dynamic programming-based technique focused on global circuit-level optimization, while capturing inter-block dependencies. We evaluated DPRQ on four sets of quantum circuits and a variety of DQC configurations. The results demonstrate that DPRQ's innovative routing strategy achieves an average of 24.40% reduction with a maximum of 85.06% reduction in inter-node communication, when compared to the state-of-the-art collective communication-based DQC compiler QuComm.