Optimization of Quantum-Repeater Networks using Stochastic Automatic Differentiation

• URL: http://arxiv.org/abs/2501.06291v1
• Date: Fri, 10 Jan 2025 19:00:01 GMT
• Title: Optimization of Quantum-Repeater Networks using Stochastic Automatic Differentiation
• Authors: Guus Avis, Stefan Krastanov,
• Abstract summary: Quantum repeaters are envisioned to enable long-distance entanglement distribution. Here we use a technique, automatic differentiation, to automatically extract derivatives from discrete Monte Carlo simulations of networks. In particular, the technique enabled us to discover how the best achievable quality of service, the minimal number of repeaters required to improve a network, and the number of repeaters required to saturate the network scale with the physical size of the network.
• Score: 0.0
• License:
• Abstract: Quantum repeaters are envisioned to enable long-distance entanglement distribution. Analysis of quantum-repeater networks could hasten their realization by informing design decisions and research priorities. Determining derivatives of network properties is crucial towards that end, facilitating optimizations and revealing parameter sensitivity. Doing so, however, is difficult because the networks are discretely random. Here we use a recently developed technique, stochastic automatic differentiation, to automatically extract derivatives from discrete Monte Carlo simulations of repeater networks. With these derivatives, we optimize rate-fidelity tradeoffs in a repeater chain, determine the chain's sensitivity with respect to the coherence times of different nodes, and finally choose the locations of quantum repeaters in a two-dimensional plane to optimize the guaranteed quality of service between four end nodes. In particular, the technique enabled us to discover how the best achievable quality of service, the minimal number of repeaters required to improve a network, and the number of repeaters required to saturate the network scale with the physical size of the network.

Related papers

• Analytical Performance Estimations for Quantum Repeater Network Scenarios [1.9608333229350179]
  Quantum repeater chains will form the backbone of future quantum networks that distribute entanglement between network nodes. By using Markov chains to model the dynamics in quantum repeater chains, we offer analytical estimations for long-run throughput and on-demand latency.
  arXiv  Detail & Related papers  (2024-07-16T04:41:29Z)
• Enhancing the expressivity of quantum neural networks with residual connections [0.0]
  We propose a quantum circuit-based algorithm to implement quantum residual neural networks (QResNets) Our work lays the foundation for a complete quantum implementation of the classical residual neural networks.
  arXiv  Detail & Related papers  (2024-01-29T04:00:51Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
  Quantum networks rely on entanglement between qubits at distant nodes to transmit information. We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links. We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
  arXiv  Detail & Related papers  (2022-12-17T05:40:09Z)
• 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)
• Entanglement Distribution in Multi-Platform Buffered-Router-Assisted Frequency-Multiplexed Automated Repeater Chains [0.0]
  We propose a quantum network architecture based on quantum processing devices based on NV$-$ colour centers. Long-distance entanglement distribution is enabled by spectrally-multiplexed quantum repeaters based on rare-earth ion-doped crystals and imperfect entangled photon-pair sources.
  arXiv  Detail & Related papers  (2021-06-08T20:25:43Z)
• Entanglement Rate Optimization in Heterogeneous Quantum Communication Networks [79.8886946157912]
  Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes.
  arXiv  Detail & Related papers  (2021-05-30T11:34:23Z)
• 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)
• Optimizing Entanglement Generation and Distribution Using Genetic Algorithms [0.640476282000118]
  Long-distance quantum communication via entanglement distribution is of great importance for the quantum internet. Quantum repeaters could in theory be used to extend the distances over which entanglement can be distributed, but in practice hardware quality is still lacking. We propose a methodology based on genetic algorithms and simulations of quantum repeater chains for optimization of entanglement generation and distribution.
  arXiv  Detail & Related papers  (2020-10-30T17:09:34Z)
• 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)
• Wireless Power Control via Counterfactual Optimization of Graph Neural Networks [124.89036526192268]
  We consider the problem of downlink power control in wireless networks, consisting of multiple transmitter-receiver pairs communicating over a single shared wireless medium. To mitigate the interference among concurrent transmissions, we leverage the network topology to create a graph neural network architecture. We then use an unsupervised primal-dual counterfactual optimization approach to learn optimal power allocation decisions.
  arXiv  Detail & Related papers  (2020-02-17T07:54:39Z)

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.