Simulating quantum repeater strategies for multiple satellites

• URL: http://arxiv.org/abs/2110.15806v2
• Date: Mon, 8 Aug 2022 18:13:38 GMT
• Title: Simulating quantum repeater strategies for multiple satellites
• Authors: Julius Walln\"ofer, Frederik Hahn, Mustafa G\"undo\u{g}an, Jasminder S. Sidhu, Fabian Wiesner, Nathan Walk, Jens Eisert, Janik Wolters
• Abstract summary: A global quantum repeater network involving satellite-based links is likely to have advantages over fiber-based networks in terms of long-distance communication. We introduce a scheme of large-scale event-based Monte Carlo simulation of quantum repeaters with multiple memories. We find that key rates in the kHz range are reasonably attainable for intercontinental quantum communication with three satellites, only one of which carries a quantum memory.
• Score: 0.5277024349608834
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A global quantum repeater network involving satellite-based links is likely to have advantages over fiber-based networks in terms of long-distance communication, since the photon losses in free space scale only polynomially with the distance -- compared to the exponential losses in optical fibers. To simulate the performance of such networks, we have introduced a scheme of large-scale event-based Monte Carlo simulation of quantum repeaters with multiple memories that can faithfully represent loss and imperfections in these memories. In this work, we identify the quantum key distribution rates achievable in various satellite and ground station geometries for feasible experimental parameters. The power and flexibility of the simulation toolbox allows us to explore various strategies and parameters, some of which only arise in these more complex, multi-satellite repeater scenarios. As a primary result, we conclude that key rates in the kHz range are reasonably attainable for intercontinental quantum communication with three satellites, only one of which carries a quantum memory.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum illumination networks [0.40964539027092906]
  We propose a quantum illumination network to overcome the limitations, via designing a transmitter array and a single receiver antenna. Thanks to multiple transmitters, quantum advantage is achieved even with a high total transmitted power. We generalize the parameter estimation scenario to a general hypothesis testing scenario, where the six-decibel quantum illumination advantage is achieved at a much greater total probing power.
  arXiv  Detail & Related papers  (2024-06-24T23:34:02Z)
• Entanglement Swapping in Orbit: a Satellite Quantum Link Case Study [0.3958317527488534]
  We study the performance of a quantum link between two ground stations using a quantum-memory-equipped satellite as a quantum repeater. The number of available quantum memory slots m, together with the unavoidable round-trip communication latency t of at least a few milliseconds, severely reduces the effective average repetition rate to m/t.
  arXiv  Detail & Related papers  (2024-05-13T09:52:50Z)
• Resource Placement for Rate and Fidelity Maximization in Quantum Networks [8.707824275470188]
  Existing classical optical network infrastructure cannot be immediately used for quantum network applications due to photon loss. We present a comprehensive framework for network planning, aiming to efficiently distributing quantum repeaters across existing infrastructure. We explore the effect of quantum memory multiplexing within quantum repeaters, as well as the influence of memory coherence time on quantum network utility.
  arXiv  Detail & Related papers  (2023-08-30T18:45: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)
• Simulation of Entanglement Generation between Absorptive Quantum Memories [56.24769206561207]
  We use the open-source Simulator of QUantum Network Communication (SeQUeNCe), developed by our team, to simulate entanglement generation between two atomic frequency comb (AFC) absorptive quantum memories. We realize the representation of photonic quantum states within truncated Fock spaces in SeQUeNCe. We observe varying fidelity with SPDC source mean photon number, and varying entanglement generation rate with both mean photon number and memory mode number.
  arXiv  Detail & Related papers  (2022-12-17T05:51:17Z)
• Telecom-heralded entanglement between remote multimode solid-state quantum memories [55.41644538483948]
  Future quantum networks will enable the distribution of entanglement between distant locations and allow applications in quantum communication, quantum sensing and distributed quantum computation. Here we report the demonstration of heralded entanglement between two spatially separated quantum nodes, where the entanglement is stored in multimode solid-state quantum memories. We also show that the generated entanglement is robust against loss in the heralding path, and demonstrate temporally multiplexed operation, with 62 temporal modes.
  arXiv  Detail & Related papers  (2021-01-13T14:31:54Z)
• 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)
• Experimental Quantum Generative Adversarial Networks for Image Generation [93.06926114985761]
  We experimentally achieve the learning and generation of real-world hand-written digit images on a superconducting quantum processor. Our work provides guidance for developing advanced quantum generative models on near-term quantum devices.
  arXiv  Detail & Related papers  (2020-10-13T06:57:17Z)
• Quantum repeaters in space [0.0]
  Long-distance entanglement is a very precious resource, but its distribution is difficult due to the exponential losses of light in optical fibres. We propose to combine quantum repeaters and satellite-based links, into a scheme that allows to achieve entanglement distribution over global distances. The integration of satellite-based links with ground repeater networks can be envisaged to represent the backbone of the future Quantum Internet.
  arXiv  Detail & Related papers  (2020-05-20T15:43:42Z)
• Entanglement Classification via Neural Network Quantum States [58.720142291102135]
  In this paper we combine machine-learning tools and the theory of quantum entanglement to perform entanglement classification for multipartite qubit systems in pure states. We use a parameterisation of quantum systems using artificial neural networks in a restricted Boltzmann machine (RBM) architecture, known as Neural Network Quantum States (NNS)
  arXiv  Detail & Related papers  (2019-12-31T07:40:23Z)

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.