QuPort introduces a three-level graph model and TPCCAP optimizer for compiling circuits on modular multi-QPU systems while balancing topology, port usage, and link congestion.
Distributed quantum computing: A survey
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 4roles
background 1polarities
background 1representative citing papers
A hybrid GHZ-BSM routing strategy outperforms pure BSM routing in square grid quantum networks but requires global-information adaptations to beat BSM in complex topologies such as Waxman, scale-free, and SURFnet.
A hardware-based emulation framework for quantum data centers is developed by splitting qubit coupling maps on one processor and using ancilla qubits to simulate transduction and fiber noise, with demonstrations on IBM hardware and ion-trap systems for algorithms like Grover's search and QFT.
A pruned distributed inverse quantum Fourier transform reduces inter-node communication from quadratic to linear scaling in the number of nodes while preserving functional correctness.
citing papers explorer
-
QuPort: Topology-, Port-, and Congestion-Aware Compilation for Modular Multi-QPU Quantum Systems
QuPort introduces a three-level graph model and TPCCAP optimizer for compiling circuits on modular multi-QPU systems while balancing topology, port usage, and link congestion.
-
Routing Entanglement in Complex Quantum Networks Using GHZ States
A hybrid GHZ-BSM routing strategy outperforms pure BSM routing in square grid quantum networks but requires global-information adaptations to beat BSM in complex topologies such as Waxman, scale-free, and SURFnet.
-
A Framework for Quantum Data Center Emulation Using Digital Quantum Computers
A hardware-based emulation framework for quantum data centers is developed by splitting qubit coupling maps on one processor and using ancilla qubits to simulate transduction and fiber noise, with demonstrations on IBM hardware and ion-trap systems for algorithms like Grover's search and QFT.
-
Communication-Efficient Distributed Inverse Quantum Fourier Transform
A pruned distributed inverse quantum Fourier transform reduces inter-node communication from quadratic to linear scaling in the number of nodes while preserving functional correctness.