Multipartite entanglement distribution in Bell-pair networks without Steiner trees and with reduced gate cost

• URL: http://arxiv.org/abs/2412.04252v2
• Date: Mon, 13 Jan 2025 16:37:18 GMT
• Title: Multipartite entanglement distribution in Bell-pair networks without Steiner trees and with reduced gate cost
• Authors: S. Siddardha Chelluri, Sumeet Khatri, Peter van Loock,
• Abstract summary: We present a protocol for producing GHZ states in arbitrary Bell-pair networks provably requiring only $O(N)$ gates. We present numerical evidence that our protocol indeed reduces the gate cost on real-world network models.
• Score: 0.6827423171182154
• License:
• 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. Although an optimal protocol (in terms of time steps and consumed Bell pairs) for generating GHZ states in Bell-pair networks has been identified in [Phys. Rev. A 100, 052333 (2019)], it makes use of at most $O(N^2)$ gates, where $N$ is the number of nodes in the network. It also involves solving the NP-hard Steiner tree problem as an initial step. Reducing the gate cost is an important consideration now and into the future, because both qubits and gate operations are noisy. To this end, we present a protocol for producing GHZ states in arbitrary Bell-pair networks that provably requires only $O(N)$ gates, and we present numerical evidence that our protocol indeed reduces the gate cost on real-world network models, compared to prior work. Notably, the gate cost of our protocol depends only on the number of nodes and is independent of the topology of the network. At the same time, our protocol maintains nearly the optimal number of consumed Bell pairs, and it avoids finding a Steiner tree or solving any other computationally hard problem by running in polynomial time with respect to $N$. By considering the number of gates as a figure of merit, our work approaches entanglement distribution from the perspective that, in practice, unlike the traditional information-theoretic setting, local operations and classical communications are not free.

Related papers

• 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. In the local protocol, the intermediary node creates and directly transmits the logical Bell states to quantum memories. 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)
• 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)
• 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)
• 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.