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.
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 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
A new routing framework exploits multipartite entanglement complementation to enable direct 1-hop connectivity for non-adjacent pairs in quantum networks and supplies a polynomial-time algorithm that achieves up to 60% hop reduction while bypassing NP-complete path discovery.
Simulations identify anisotropic ground stations, multi-inclination LEO orbits, and multi-party service policies as key to achieving concurrent global quantum connectivity with acceptable latency and link strength.
MILP-based scheduling algorithms for heterogeneous DQC networks improve makespan, throughput, and reduce inter-QPU communication overhead compared to baselines in simulations.
citing papers explorer
-
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.
-
Quantum Routing Beyond Pathfinding: Multipartite Entanglement Complementation
A new routing framework exploits multipartite entanglement complementation to enable direct 1-hop connectivity for non-adjacent pairs in quantum networks and supplies a polynomial-time algorithm that achieves up to 60% hop reduction while bypassing NP-complete path discovery.
-
Designing a Satellite Serviced Quantum Network Backbone for Concurrent Global Connectivity
Simulations identify anisotropic ground stations, multi-inclination LEO orbits, and multi-party service policies as key to achieving concurrent global quantum connectivity with acceptable latency and link strength.
-
Resource Management and Circuit Scheduling for Distributed Quantum Computing Interconnect Networks
MILP-based scheduling algorithms for heterogeneous DQC networks improve makespan, throughput, and reduce inter-QPU communication overhead compared to baselines in simulations.