Simulation of fidelity in entanglement-based networks with repeater chains

• URL: http://arxiv.org/abs/2410.09779v2
• Date: Sun, 3 Nov 2024 14:51:07 GMT
• Title: Simulation of fidelity in entanglement-based networks with repeater chains
• Authors: David Pérez Castro, Ana Fernández Vilas, Manuel Fernández-Veiga, Mateo Blanco Rodríguez, Rebeca P. Díaz Redondo,
• Abstract summary: We implement a simulation environment on top of NetSquid that is specifically designed for estimating the end-to-end fidelity across a path of quantum repeaters or quantum switches. The switch model includes several generalizations which are not currently available in other tools.
• Score: 2.6214349237099164
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We implement a simulation environment on top of NetSquid that is specifically designed for estimating the end-to-end fidelity across a path of quantum repeaters or quantum switches. The switch model includes several generalizations which are not currently available in other tools, and are useful for gaining insight into practical and realistic quantum network engineering problems: an arbitrary number of memory registers at the switches, simplicity in including entanglement distillation mechanisms, arbitrary switching topologies, and more accurate models for the depolarization noise. An illustrative case study is presented, namely a comparison in terms of performance between a repeater chain where repeaters can only swap sequentially, and a single switch equipped with multiple memory registers, able to handle multiple swapping requests.

Related papers

• Comparing One- and Two-way Quantum Repeater Architectures [9.942288691108914]
  Quantum repeaters are an essential building block for realizing long-distance quantum communications. Due to the fragile nature of quantum information, these repeaters suffer from loss and operational errors. Recent increases in the number of available memories, and introduction of entanglement generation through multiplexing motivate a re-comparison of one-way and two-way repeater architectures.
  arXiv  Detail & Related papers  (2024-09-10T01:55:01Z)
• Generalized quantum repeater graph states [1.7635061227370266]
  We present a new approach to ensure the loss tolerance of distributing a single ebit. We demonstrate that our new scheme significantly outperforms the previous work with much flexibility. These findings offer new insights into the scalability and reliability of loss-tolerant quantum networks.
  arXiv  Detail & Related papers  (2024-07-01T16:21:37Z)
• Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust Closed-Loop Control [63.310780486820796]
  We show how a parameterization of recurrent connectivity influences robustness in closed-loop settings. We find that closed-form continuous-time neural networks (CfCs) with fewer parameters can outperform their full-rank, fully-connected counterparts.
  arXiv  Detail & Related papers  (2023-10-05T21:44:18Z)
• Vertical Layering of Quantized Neural Networks for Heterogeneous Inference [57.42762335081385]
  We study a new vertical-layered representation of neural network weights for encapsulating all quantized models into a single one. We can theoretically achieve any precision network for on-demand service while only needing to train and maintain one model.
  arXiv  Detail & Related papers  (2022-12-10T15:57:38Z)
• ReQuSim: Faithfully simulating near-term quantum repeaters [0.2796197251957244]
  We present ReQuSim, a comprehensive Monte-Carlo based simulation platform for quantum repeaters. Our platform allows us to perform an analysis for quantum repeater setups and strategies that go far beyond known analytic results.
  arXiv  Detail & Related papers  (2022-12-07T19:00:13Z)
• Over-the-Air Split Machine Learning in Wireless MIMO Networks [56.27831295707334]
  In split machine learning (ML), different partitions of a neural network (NN) are executed by different computing nodes. To ease communication burden, over-the-air computation (OAC) can efficiently implement all or part of the computation at the same time of communication.
  arXiv  Detail & Related papers  (2022-10-07T15:39:11Z)
• Interference-Limited Ultra-Reliable and Low-Latency Communications: Graph Neural Networks or Stochastic Geometry? [45.776476161876204]
  We build a cascaded Random Edge Graph Neural Network (REGNN) to represent the repetition scheme and train it. We analyze the violation probability using geometry in a symmetric scenario and apply a model-based Exhaustive Search (ES) method to find the optimal solution.
  arXiv  Detail & Related papers  (2022-07-11T05:49:41Z)
• Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible [0.0]
  We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. We consider additional tools and parameters such as memory cut-offs, multiplexing, initial state and swapping gate fidelities.
  arXiv  Detail & Related papers  (2022-03-19T12:55:56Z)
• 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)
• 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)
• Optimising repeater schemes for the quantum internet [0.0]
  We study three different experimental quantum repeater implementations on their ability to distribute entanglement. We use the algorithm to study three different experimental quantum repeater implementations on their ability to distribute entanglement.
  arXiv  Detail & Related papers  (2020-06-22T13:18:49Z)

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.