Strategy optimization for quantum conference key agreement in asymmetric star networks

• URL: http://arxiv.org/abs/2605.18677v1
• Date: Mon, 18 May 2026 17:18:23 GMT
• Title: Strategy optimization for quantum conference key agreement in asymmetric star networks
• Abstract summary: We analyze a quantum conference agreement protocol based on GHZ states in a network with a central station to which multiple clients are connected.<n>Using comprehensive numerical simulations, we investigate how minor variations in the scenario-such as the number of parties, the number of memories, and asymmetric distances from the central station-can drastically influence the performance of the protocol.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The distribution of entangled states is a core task for quantum networks facilitating quantum communication, and the use of multipartite entangled states comes with its own set of considerations. In this work, we analyze a quantum conference agreement protocol based on GHZ states in a network with a central station to which multiple clients are connected. Using comprehensive numerical simulations, we investigate how minor variations in the scenario-such as the number of parties, the number of memories, and asymmetric distances from the central station-can drastically influence the performance of the protocol. In particular, we demonstrate that it is crucial to adjust the strategy by optimizing cutoff times. From a broader perspective, we argue that numerical simulations are an indispensable tool for protocol design for devising realistic schemes for quantum communication.

Related papers

• GHZ-Equivalent State Distribution in Quantum Networks: Reducing Decoherence and Quantum Resource Consumption [0.0]
  This study proposes a novel scheme for distributing GHZ-equivalent states across repeater-based quantum networks.<n>The proposed scheme enables remote users to share graph states, which can be leveraged to implement various quantum communication protocols.
  arXiv  Detail & Related papers  (2026-07-19T07:05:36Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• Quantum Entanglement Allocation through a Central Hub [12.641563181229623]
  We propose local operations and classical communication protocols for allocating $N$-qubit W states within a centralized hub architecture. Results show that these protocols deterministically and exactly distribute states using only $N$ qubits of quantum memory within the central system, with communication costs of $2N - 2$ and $N$ classical bits for the W and GHZ states, respectively.
  arXiv  Detail & Related papers  (2024-09-12T16:06:28Z)
• Deterministic multipartite entanglement via fractional state transfer across quantum networks [0.0]
  We propose a fractional quantum state transfer, in which the excitation of an emitter is partially transmitted through the quantum communication channel. We show that genuine multipartite entangled states can be faithfully prepared within current experimental platforms.
  arXiv  Detail & Related papers  (2024-08-02T10:59:16Z)
• Repeater-like asynchronous measurement-device-independent quantum conference key agreement [14.261895897404726]
  Quantum conference key agreement enables secure communication among multiple parties by leveraging multipartite entanglement.<n>We propose a measurement-device-independent quantum conference key agreement protocol that employs asynchronous Greenberger-Horne-Zeilinger state measurement.<n>Our method provides insights for various quantum tasks beyond quantum communication, including multiparty computing and quantum repeaters.
  arXiv  Detail & Related papers  (2024-06-22T13:57:21Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Breaking universal limitations on quantum conference key agreement without quantum memory [6.300599548850421]
  We report a measurement-device-independent quantum conference key agreement protocol with enhanced transmission efficiency over lossy channel. Our protocol can break key rate bounds on quantum communication over quantum network without quantum memory. Based on our results, we anticipate that our protocol will play an indispensable role in constructing multipartite quantum network.
  arXiv  Detail & Related papers  (2022-12-10T06:37:53Z)
• 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)
• A scheme for multipartite entanglement distribution via separable carriers [68.8204255655161]
  We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
  arXiv  Detail & Related papers  (2022-06-20T10:50: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)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)

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.