AI 中文总结
研究量子多核架构中纠缠管理，比较反应式按需生成、主动式连续预生成和自适应连续预生成三种范式，用扩展模拟器在基准电路上评估，结果显示自适应方法显著降低平均隐形传态延迟，能大幅提高通信效率。
AI 中文摘要
可扩展量子计算架构越来越依赖多核设计，其中量子比特分布在通过量子片上网络（NoC）互连的多个处理核心上。在此类系统中，核心间通信通常通过纠缠辅助量子隐形传态实现，因此高效的纠缠生成对性能至关重要。本文对多核量子处理器的三种纠缠管理范式进行了比较研究：反应式按需生成（ODG）、主动式连续预生成（CGP）和自适应连续预生成方法（ACGP）。ODG仅在需要时生成纠缠，CGP通过在后台预生成EPR对来减少平均隐形传态延迟。为改进此方法，我们提出ACGP，它基于观察到的核心间通信模式动态调整纠缠生成概率。我们使用扩展的SeQUeNCe模拟器在基于网格的多核架构上对实际基准电路评估这些方法。结果表明，与ODG和CGP相比，ACGP显著降低了平均隐形传态延迟。尽管预生成由于存储时间会导致保真度下降，但纠缠纯化能有效恢复保真度，且对延迟影响最小。这些结果表明，自适应纠缠管理可大幅提高可扩展量子多核系统中的通信效率。
英文摘要
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.
