Multipartite multiplexing strategies for quantum routers

• URL: http://arxiv.org/abs/2406.13492v1
• Date: Wed, 19 Jun 2024 12:26:33 GMT
• Title: Multipartite multiplexing strategies for quantum routers
• Authors: Julia A. Kunzelmann, Hermann Kampermann, Dagmar Bruß,
• Abstract summary: This work explores the role of quantum routers in communication networks and investigates the increase in efficiency using memories and multiplexing strategies. We present a general protocol for N parties after defining the underlying matching problem and we calculate the router rate for different N. We analyze the improvement due to multiplexing, and analyze the secret key rate with explicit results for the tripartite network.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work explores the important role of quantum routers in communication networks and investigates the increase in efficiency using memories and multiplexing strategies. Motivated by the bipartite setup introduced by Abruzzo et al. (2013) for finite-range multiplexing in quantum repeaters, we extend the study to an N-partite network with a router as a central station. We present a general protocol for N parties after defining the underlying matching problem and we calculate the router rate for different N. We analyze the improvement due to multiplexing, and analyze the secret key rate with explicit results for the tripartite network. Investigating strategic qubit selection for the GHZ measurements, we show that using cutoffs to remove qubits after a certain number of rounds and consistently combining qubits with the lowest number of storage rounds leads to an optimal secret key rate.

Related papers

• Multiplexed multipartite quantum repeater rates in the stationary regime [0.0]
  Multipartite quantum repeaters play an important role in quantum communication networks.<n>We show that the rate saturates for large number of memories.
  arXiv  Detail & Related papers  (2025-05-23T15:36:22Z)
• Comparing GHZ-Based Strategies for Multipartite Entanglement Distribution in 2D Repeater Networks [0.17811840395202347]
  We conduct a comparative study to determine the initial quality necessary to extend the distance range of an $N$-qubit GHZ state.<n>We analyze two strategies for distributing initial GHZ states using a centralized quantum switch.
  arXiv  Detail & Related papers  (2025-05-16T18:50:50Z)
• Improving and benchmarking NISQ qubit routers [0.0]
  We benchmark various routing techniques considering random quantum circuits on one-dimensional and square lattice connectivities. We introduce circuit fidelity as a comprehensive metric that captures the effects of SWAP and circuit depth overheads.
  arXiv  Detail & Related papers  (2025-02-06T09:31:51Z)
• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Advantage of multi-partite entanglement for quantum cryptography over long and short ranged networks [0.3683202928838613]
  We show the security of a variant of the GHZ state based secret sharing protocol against general attacks. We then identify parameters for a performance advantage over realistic bottleneck networks. The addition of quantum repeaters unlocks the performance advantage of multi-partite entanglement over point-to-point approaches.
  arXiv  Detail & Related papers  (2023-12-20T19:04:17Z)
• MBQuant: A Novel Multi-Branch Topology Method for Arbitrary Bit-width Network Quantization [51.85834744835766]
  We propose MBQuant, a novel method for arbitrary bit-width quantization. We show that MBQuant achieves significant performance gains compared to existing arbitrary bit-width quantization methods.
  arXiv  Detail & Related papers  (2023-05-14T10:17:09Z)
• A Modular Quantum Compilation Framework for Distributed Quantum Computing [0.0]
  Distributed Quantum Computing is a scalable approach for increasing the number of available qubits for computational tasks. We present a modular quantum compilation framework for DQC that takes into account both network and device constraints. We also devised a strategy for remote scheduling that can exploit both TeleGate and TeleData operations.
  arXiv  Detail & Related papers  (2023-05-04T16:13:23Z)
• 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)
• 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)
• Cluster-Promoting Quantization with Bit-Drop for Minimizing Network Quantization Loss [61.26793005355441]
  Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks. DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons. We experimentally validate our method on various benchmark datasets and network architectures.
  arXiv  Detail & Related papers  (2021-09-05T15:15:07Z)
• Quantum repeaters with encoding on nitrogen-vacancy center platforms [1.218340575383456]
  We investigate quantum repeater protocols that rely on three-qubit repetition codes using nitrogen-vacancy (NV) centers in diamond as quantum memories. We study two NV-center based repeater structures that enable such deterministic joint operations. One structure offers less consumption of classical communication, at the cost of more computation overhead, whereas the other one relies on a fewer number of physical resources and operations.
  arXiv  Detail & Related papers  (2021-05-28T21:58:49Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Efficient Routing for Quantum Key Distribution Networks [3.5766737249359544]
  We model the performance of the E91 entanglement based QKD protocol when operating in a network consisting of both quantum repeaters and trusted nodes. We propose a number of routing protocols for this network and compare their performance under different usage scenarios.
  arXiv  Detail & Related papers  (2020-05-25T21:03:42Z)

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.