Synapse
⌘+K
Synapse
PulseExploreJournal ClubResearchersJournals
Instagram
HomeJournal ClubExplore
September 10, 2025ACM Transactions on Quantum Computing

DQC-QR: Distributing and Routing Quantum Circuits with Minimum Execution Time

View Full Paper
Ask AI
Bookmark
Share

Authors

RSRanjani G. SundaramHGHimanshu GuptaCRCR Ramakrishnan

Discussion

Loading...

Member takes

Overview

Analysis shows reduced execution time for quantum circuits in quantum networks, suggesting improved efficiency. Two-step algorithms enhance circuit mapping and entanglement generation.

Key Points

  • Distributed quantum computations can significantly reduce execution time, improving efficiency in large-scale quantum processing.
  • An efficient algorithm based on the max-quadratic-assignment problem effectively allocates qubits to memories, minimizing execution time.
  • The developed techniques outperform previous schemes by an average of 40 to 50%, with maximum improvements reaching up to 95% in specific cases.
  • Simulation results using NetSquid validate the proposed solutions under decoherence and resource constraints.

Cite This Study

Sundaram et al. (2025) studied this question.

synapsesocial.com/papers/68c1a12754b1d3bfb60dbe47https://doi.org/10.1145/3757069
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Distributed Quantum Computation with Minimum Circuit Execution Time over Quantum Networks2024 · 1 citations
  2. 2Entanglement-Efficient Distribution of Quantum Circuits over Large-Scale Quantum Networks2025
  3. 3A Genetic Approach to Minimising Gate and Qubit Teleportations for Multi-Processor Quantum Circuit Distribution2024
  4. 4Generalised Circuit Partitioning for Distributed Quantum Computing2024
  5. 5Distributed quantum computing via enhanced connectivity2026