跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2503.14712 · v3

Near-Optimal Techniques for Distributed Entanglement Generation and Purification

首次提交 2025-03-19 04:19
版本更新 2026-11-15 08:54
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

We develop a purification-aware optimization framework for distributing high-fidelity entangled states over quantum networks. In repeater-based architectures, the framework jointly selects entanglement swapping, fusion or graph-state growth, and purification operations to maximize generation rate under a fidelity threshold. Different purification models can be incorporated through their fidelity-update, success-probability, and latency rules. We introduce purification-augmented generation trees and dynamic programming (DP) algorithms for entangled-pair (EP) distribution. Hypergraph-flow linear programming (LP) formulations support level-based structures and concurrent generation across multiple trees and demands. We extend the framework to GHZ states and arbitrary graph states constructed from remote EP resources, introduce graph-state construction primitives, and derive closed-form fidelity-vector updates for GHZ fusion and purification and graph-state growth and purification. We provide optimal formulations under the adopted models, discretization, and purification bounds, together with efficient DP and LP heuristics. We bound fidelity- and rate-discretization errors and establish convergence for fixed constructions under stated regularity conditions. NetSquid simulations of EP generation using our LP approach show an average 160% increase in generation rate over the compared prior approaches, with gains up to 330% in some scenarios. GHZ and graph-state simulations demonstrate the heuristics' effectiveness in balancing generation rate, output fidelity, and computational overhead.

作者备注:52 pages. Substantially expanded journal manuscript, extending the conference version in v1-v2 with arbitrary graph-state generation and purification, full fidelity-vector analysis, discretization bounds, additional proofs, and expanded evaluations. Title and author order updated

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-15 08:54 · 最新观测版本

Near-Optimal Techniques for Distributed Entanglement Generation and Purification

We develop a purification-aware optimization framework for distributing high-fidelity entangled states over quantum networks. In repeater-based architectures, the framework jointly selects entanglement swapping, fusion or graph-state growth, and purification operations to maximize generation rate under a fidelity threshold. Different purification models can be incorporated through their fidelity-update, success-probability, and latency rules. We introduce purification-augmented generation trees and dynamic programming (DP) algorithms for entangled-pair (EP) distribution. Hypergraph-flow linear programming (LP) formulations support level-based structures and concurrent generation across multiple trees and demands. We extend the framework to GHZ states and arbitrary graph states constructed from remote EP resources, introduce graph-state construction primitives, and derive closed-form fidelity-vector updates for GHZ fusion and purification and graph-state growth and purification. We provide optimal formulations under the adopted models, discretization, and purification bounds, together with efficient DP and LP heuristics. We bound fidelity- and rate-discretization errors and establish convergence for fixed constructions under stated regularity conditions. NetSquid simulations of EP generation using our LP approach show an average 160% increase in generation rate over the compared prior approaches, with gains up to 330% in some scenarios. GHZ and graph-state simulations demonstrate the heuristics' effectiveness in balancing generation rate, output fidelity, and computational overhead.

查看此版本解读 →查看此版本原文 ↗