Scholarlink

<p>Multipartite entangled states, such as Greenberger–Horne–Zeilinger (GHZ) states, are important resources in multiparty quantum networking tasks. We consider protocols for generating such states from networks of Bell pairs and local operations and classical communication. We present a computationally-efficient protocol for generating GHZ states that is also efficient with respect to the number of consumed Bell pairs, (local) gates, and Bell-pair sources. Our protocol: (1) requires <i>O</i>(<i>N</i>) gates in a network with <i>N</i> nodes, independent of the network topology; (2) has time complexity <i>O</i>(<i>N</i><sup>2</sup>), avoiding the Steiner tree and any other computationally-hard problem; (3) maintains a near-optimal number of consumed Bell pairs. Numerically, our protocol outperforms those based on (approximate) Steiner trees with respect to the number of gates and Bell-pair sources. We prove that the minimal Bell-pair source cost is given by solving the graph-theoretic dominating set problem, and we demonstrate numerically that our protocol is nearly optimal for this quantity. Finally, we analytically characterize the impact of noisy Bell pairs and gates on the fidelity of the distributed GHZ states.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年7月8日

查看全文
  • S. Siddardha Chelluri,
  • Sumeet Khatri,
  • Peter van Loock

摘要

Multipartite entangled states, such as Greenberger–Horne–Zeilinger (GHZ) states, are important resources in multiparty quantum networking tasks. We consider protocols for generating such states from networks of Bell pairs and local operations and classical communication. We present a computationally-efficient protocol for generating GHZ states that is also efficient with respect to the number of consumed Bell pairs, (local) gates, and Bell-pair sources. Our protocol: (1) requires O(N) gates in a network with N nodes, independent of the network topology; (2) has time complexity O(N2), avoiding the Steiner tree and any other computationally-hard problem; (3) maintains a near-optimal number of consumed Bell pairs. Numerically, our protocol outperforms those based on (approximate) Steiner trees with respect to the number of gates and Bell-pair sources. We prove that the minimal Bell-pair source cost is given by solving the graph-theoretic dominating set problem, and we demonstrate numerically that our protocol is nearly optimal for this quantity. Finally, we analytically characterize the impact of noisy Bell pairs and gates on the fidelity of the distributed GHZ states.