A comparative study of three entanglement management paradigms for multi-core quantum processors shows that adaptive entanglement managements can substantially improve communication efficiency in scalable quantum multi-core systems.
Abstract
Scalable quantum computing architectures increasingly rely on multi-core designs, where qubits are distributed across multiple processing cores interconnected through a quantum Network-on-Chip (NoC). In such systems, inter-core communication is typically realized through entanglement-assisted quantum teleportation, making efficient entanglement generation critical for performance. In this paper, we perform a comparative study of three entanglement management paradigms for multi-core quantum processors: reactive on-demand generation (ODG), proactive continuous pre-generation (CGP), and an adaptive continuous pre-generation approach (ACGP). While ODG generates entanglement only when required, CGP reduces average teleportation latency by pre-generating EPR pairs in the background. To improve upon this, we propose ACGP which dynamically adjusts entanglement generation probabilities based on observed inter-core communication patterns. We evaluate these approaches using an extended SeQUeNCe simulator on mesh-based multi-core architectures on real benchmark circuits. Results show that ACGP significantly reduces average teleportation latency compared to ODG and CGP. Although pre-generation introduces fidelity degradation due to storage time, entanglement purification effectively restores fidelity with minimal impact on latency. These results demonstrate that adaptive entanglement managements can substantially improve communication efficiency in scalable quantum multi-core systems.
An economic order quantity model from perishable inventory theory is proposed to optimize the trade-off between entanglement distribution latency and the time cost of decoherence, offering a dual application for the hardware-software co-design of high-performance DQC.
Raymond P. H. Wu, Chathurika Ranaweera, Sutharshan Rajasegarar et al.· arXiv.org· 0 citations
The results show that QAOA obtains modest but consistent latency reductions, highlighting its value as a diagnostic benchmark for studying the interaction between algorithm structure, entanglement management, and quantum-network architecture.
Samanvay Sharma, Si-Yuan Niu, Amin Taherkhani et al.· 0 citations
A simple repeat-until-success protocol is introduced that makes entanglement consumption adaptive to interaction strength and yields a total entanglement cost that scales linearly with evolution time and remains independent of Trotter error.
Tian-Feng Feng, Jin-Zhao Sun, Yun-Long Xiao et al.· 0 citations
This work investigates how errors at module interfaces and within individual QPUs affect fault-tolerant computation when qubits are encoded using the rotated surface code, and develops an efficient protocol for preparing distributed fault-tolerant logical GHZ states.
S. Chelluri, R. Mengoni, Tom Darras et al.· 0 citations
A metropolitan-scale entanglement-based quantum communication network enabled by a quantum reconfigurable optical add-drop multiplexer (q-ROADM), which dynamically distributes polarisation-entangled photon pairs from a broadband source to six users over deployed campus and metropolitan fibre, is demonstrated.
Rui Wang, Marcus J. Clark, O. Alia et al.· 1 citation
This work argues that the absence of utility-driven network formation is not solely a consequence of immature applications, but also of insufficient abstraction, and that quantum interconnects constitute the enabling technology required to decouple physical implementations from network functionalities.
Gustavo C. Amaral· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.