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.
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
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.
Partitioning a single quantum processor into logical QPUs with collisional-model noise emulates a quantum data center on real hardware.
citing papers explorer
-
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.
-
A Framework for Quantum Data Center Emulation Using Digital Quantum Computers
Partitioning a single quantum processor into logical QPUs with collisional-model noise emulates a quantum data center on real hardware.
- Resource Management and Circuit Scheduling for Distributed Quantum Computing Interconnect Networks