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

• URL: http://arxiv.org/abs/2412.04252v3
• Date: Fri, 25 Jul 2025 18:50:04 GMT
• Title: A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks
• Authors: S. Siddardha Chelluri, Sumeet Khatri, Peter van Loock,
• Abstract summary: Greenberger--Horne--Zeilinger (GHZ) and other graph states are important resources in multiparty quantum network protocols and measurement-based quantum computing.<n>We consider the problem of generating such states from networks of bipartite entangled (Bell) pairs.<n>We present a protocol for producing GHZ states in arbitrary Bell-pair networks that is efficient with respect to all of these figures of merit.
• Score: 0.6827423171182154
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multipartite entangled states, particularly Greenberger--Horne--Zeilinger (GHZ) and other graph states, are important resources in multiparty quantum network protocols and measurement-based quantum computing. We consider the problem of generating such states from networks of bipartite entangled (Bell) pairs. We adopt the perspective that, in practice, unlike the traditional information-theoretic setting, local operations and classical communications are not free. Consequently, protocols should not only be efficient with respect to the number of consumed Bell pairs, as typically considered, but also efficient with respect to the number of (local) gates, number of Bell-pair sources, and computational complexity. In this work, we present a protocol for producing GHZ states in arbitrary Bell-pair networks that is efficient with respect to all of these figures of merit. We prove that our protocol: (1) requires $O(N)$ gates in a network with $N$ nodes, independent of the topology of the network; (2) has time complexity $O(N^2)$, thereby avoiding finding a Steiner tree or solving any other computationally hard problem; and (3) maintains nearly the optimal number of consumed Bell pairs. We prove that the minimal Bell-pair source cost is equivalent to the graph-theoretic dominating set problem, and via numerical simulations on real-world network models, we demonstrate that our protocol is nearly optimal with respect to Bell-pair source cost. Numerically, our protocol also outperforms existing protocols based on (approximate) Steiner trees with respect to both number of gates and Bell-pair sources. Finally, we provide a detailed analysis of the impact of noisy Bell pairs and gates on the fidelity of the distributed GHZ states.

Related papers

• Network-assisted collective operations for efficient distributed quantum computing [0.0]
  We propose protocols for the distribution of collective quantum operations between remote quantum processing units. These protocols allow for collective multicontrolled and multitarget gates to be executed in network architectures similar to those used for high-performance computing.
  arXiv  Detail & Related papers  (2025-02-26T13:13:13Z)
• Constant Overhead Entanglement Distillation via Scrambling [0.6249768559720122]
  High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing. We introduce protocols that use quantum scrambling - the spreading of quantum information under chaotic dynamics. We show this protocol remains effective even with noisy quantum gates, making it suitable for near-term devices.
  arXiv  Detail & Related papers  (2025-02-13T16:46:15Z)
• Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks [1.6249398255272316]
  Two novel lattice surgery-based protocols are introduced to establish logical Bell states between distant nodes.<n>In the local protocol, the intermediary node creates and directly transmits the logical Bell states to quantum memories.<n>The non-local protocol distributes auxiliary Bell states, merging boundaries between pre-existing codes in the quantum memories.
  arXiv  Detail & Related papers  (2024-12-02T12:16:28Z)
• Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
  CNOT circuits are a common building block of general quantum circuits. This article presents state-of-the-art algorithms for optimizing the number of CNOT gates. A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
  arXiv  Detail & Related papers  (2024-08-07T19:51:22Z)
• Experimental anonymous quantum conferencing [72.27323884094953]
  We experimentally implement the AQCKA task in a six-user quantum network using Greenberger-Horne-Zeilinger (GHZ)-state entanglement. We also demonstrate that the protocol retains an advantage in a four-user scenario with finite key effects taken into account.
  arXiv  Detail & Related papers  (2023-11-23T19:00:01Z)
• Architecture and protocols for all-photonic quantum repeaters [0.49157446832511503]
  All-photonic quantum repeater scheme promises resilience to photon losses and operational errors. We propose a new emitter-photonic qubit building block and an RGS protocol that addresses several key considerations. Our proposed building block significantly reduces the total number of emissive quantum memories required for end nodes.
  arXiv  Detail & Related papers  (2023-06-06T15:08:50Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Entanglement Routing and Bottlenecks in Grid Networks [0.0]
  Existing protocols like $X$ protocol use graph theoretic tools like local complementation to optimize the number of measurements required to extract any Bell pair among the network users. Here, the existing results are extended to establish a counter-intuitive notion that, in general, the most optimal path to perform the $X$ protocol is not along the shortest path. Bottlenecks in establishing simultaneous Bell pairs in nearest-neighbor architectures are also explored.
  arXiv  Detail & Related papers  (2022-11-22T19:09:01Z)
• Multiparty Entanglement Routing in Quantum Networks [0.0]
  A protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in quantum networks. The protocol only requires local measurements at the network nodes and just a single qubit memory per user.
  arXiv  Detail & Related papers  (2022-11-12T15:40:34Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Protocols for creating and distilling multipartite GHZ states with Bell pairs [0.0]
  distribution of high-quality Greenberger-Horne-Zeilinger (GHZ) states is at the heart of many quantum communication tasks. We introduce a dynamic programming algorithm to optimize over a large class of protocols that create and purify GHZ states.
  arXiv  Detail & Related papers  (2020-10-23T09:40:01Z)
• Distributing Graph States Across Quantum Networks [16.74626042261441]
  We consider a quantum network consisting of nodes-quantum computers within which local operations are free-and EPR pairs shared between nodes that can continually be generated. We prove upper bounds for our approach on the number of EPR pairs consumed, number of timesteps taken, and amount of classical communication required.
  arXiv  Detail & Related papers  (2020-09-23T01:36:12Z)
• Experimental quantum conference key agreement [55.41644538483948]
  Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale. Here we demonstrate quantum conference key agreement, a quantum communication protocol that exploits multi-partite entanglement. We distribute four-photon Greenberger-Horne-Zeilinger (GHZ) states generated by high-brightness, telecom photon-pair sources across up to 50 km of fibre.
  arXiv  Detail & Related papers  (2020-02-04T19:00:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.