Improved Simulation of Asynchronous Entanglement Distribution in Noisy Quantum Networks

• URL: http://arxiv.org/abs/2507.22992v1
• Date: Wed, 30 Jul 2025 18:00:05 GMT
• Title: Improved Simulation of Asynchronous Entanglement Distribution in Noisy Quantum Networks
• Authors: Emma Hughes, William Munizzi, Prineha Narang,
• Abstract summary: This work introduces a lightweight simulation framework for evaluating asynchronous entanglement distribution protocols.<n>We focus on two contemporary protocols: sequential, where entanglement is established one node at a time, and parallel, where all nodes attempt to generate entanglement simultaneously.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work introduces a lightweight simulation framework for evaluating asynchronous entanglement distribution protocols under realistic error models. We focus on two contemporary protocols: sequential, where entanglement is established one node at a time, and parallel, where all nodes attempt to generate entanglement simultaneously. We evaluate the performance of each protocol using two key metrics: the fidelity of distributed entangled states, and the hashing rate, a measure of entanglement efficiency. These metrics are compared between both protocols across a range of network sizes and noise parameters. We demonstrate that the parallel protocol consistently outperforms the sequential, particularly in the hashing rate metric due to reduced runtime, suggesting that parallel protocols are a strong candidate for a realizable quantum Internet. Our framework offers an accessible and scalable tool for evaluating entanglement distribution strategies, by reducing the simulation of complex quantum processes to simple memory time calculations.

Related papers

• Logical entanglement distribution between distant 2D array qubits [0.803311301885066]
  We propose an efficient logical entanglement distribution protocol based on surface codes for two distant 2D qubit array with nearest-neighbor interaction.<n>A notable feature of our protocol is that it allows post-selection according to error estimations.<n>We numerically evaluated the performance of our protocol and the trade-off relationship, and found that our protocol enables us to prepare logical entangled states while improving fidelity in feasible experimental parameters.
  arXiv  Detail & Related papers  (2025-03-19T04:39:32Z)
• Bayesian Optimization for Repeater Protocols [0.0]
  "First-generation" quantum repeater chains distribute entanglement by executing protocols composed of probabilistic entanglement generation, swapping and distillation operations.<n>We show that calculating the secretkey rate for a given protocol is non-trivial due to experimental imperfections and the probabilistic nature of the operations.<n>We use our framework to extract insight on how to maximize the efficiency of repeater protocols across varying node configurations and hardware conditions.
  arXiv  Detail & Related papers  (2025-02-04T10:46:12Z)
• Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks [9.971549076128268]
  We explore two minimal asynchronous protocols for entanglement in quantum networks. A parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation.
  arXiv  Detail & Related papers  (2024-05-03T18:04:11Z)
• Quantum Benchmarking via Random Dynamical Quantum Maps [3.5297361401370044]
  We present a benchmarking protocol for universal quantum computers. This protocol provides a holistic assessment of system-wide error rates. We implement the protocol on state-of-the-art transmon qubits provided by IBM Quantum.
  arXiv  Detail & Related papers  (2024-04-29T16:37:11Z)
• Secure and robust randomness with sequential quantum measurements [0.0]
  We prove a Tsirelson-like boundary for sequential quantum correlations, which represents a trade-off in nonlocality shared by sequential users.<n>Our simple qubit protocol reaches this boundary, and numerical analysis shows improved robustness under realistic noise.<n>This study advances understanding of sequential quantum correlations and offers insights for efficient device-independent protocols.
  arXiv  Detail & Related papers  (2023-09-21T17:50:29Z)
• Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement [33.2699333323263]
  We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs.<n>The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol.<n>We present the results of implementing the protocol in a computer simulation based on the NetSquid framework.
  arXiv  Detail & Related papers  (2023-09-06T08:48:07Z)
• 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)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Parallel Simulation of Quantum Networks with Distributed Quantum State Management [56.24769206561207]
  We identify requirements for parallel simulation of quantum networks and develop the first parallel discrete event quantum network simulator. Our contributions include the design and development of a quantum state manager that maintains shared quantum information distributed across multiple processes. We release the parallel SeQUeNCe simulator as an open-source tool alongside the existing sequential version.
  arXiv  Detail & Related papers  (2021-11-06T16:51:17Z)
• 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)
• Accelerating Feedforward Computation via Parallel Nonlinear Equation Solving [106.63673243937492]
  Feedforward computation, such as evaluating a neural network or sampling from an autoregressive model, is ubiquitous in machine learning. We frame the task of feedforward computation as solving a system of nonlinear equations. We then propose to find the solution using a Jacobi or Gauss-Seidel fixed-point method, as well as hybrid methods of both. Our method is guaranteed to give exactly the same values as the original feedforward computation with a reduced (or equal) number of parallelizable iterations, and hence reduced time given sufficient parallel computing power.
  arXiv  Detail & Related papers  (2020-02-10T10:11: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.