ReQuSim: Faithfully simulating near-term quantum repeaters

• URL: http://arxiv.org/abs/2212.03896v3
• Date: Wed, 3 Apr 2024 13:36:55 GMT
• Title: ReQuSim: Faithfully simulating near-term quantum repeaters
• Authors: Julius Wallnöfer, Frederik Hahn, Fabian Wiesner, Nathan Walk, Jens Eisert,
• Abstract summary: 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.
• Score: 0.2796197251957244
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum repeaters have long been established to be essential for distributing entanglement over long distances. Consequently, their experimental realization constitutes a core challenge of quantum communication. However, there are numerous open questions about implementation details for realistic, near-term experimental setups. In order to assess the performance of realistic repeater protocols, we here present ReQuSim, a comprehensive Monte-Carlo based simulation platform for quantum repeaters that faithfully includes loss and models a wide range of imperfections such as memories with time-dependent noise. Our platform allows us to perform an analysis for quantum repeater setups and strategies that go far beyond known analytic results: This refers to being able to both capture more realistic noise models and analyse more complex repeater strategies. We present a number of findings centered around the combination of strategies for improving performance, such as entanglement purification and the use of multiple repeater stations, and demonstrate that there exist complex relationships between them. We stress that numerical tools such as ours are essential to model complex quantum communication protocols aimed at contributing to the quantum internet.

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)
• Asynchronous Quantum Repeater using Multiple Quantum Memory [0.6445605125467574]
  A full-fledged quantum network relies on the formation of entangled links between remote location with the help of quantum repeaters. We propose a quantum repeater protocol using the idea of post-matching, which retains the same efficiency as the single-photon interference protocol.
  arXiv  Detail & Related papers  (2024-01-11T08:24:37Z)
• Quantum topological data analysis via the estimation of the density of states [17.857341127079305]
  We develop a quantum topological data analysis protocol based on the estimation of the density of states (DOS) of the Laplacian. We test our protocol on noiseless and noisy quantum simulators and run examples on IBM quantum processors.
  arXiv  Detail & Related papers  (2023-12-12T09:43:04Z)
• Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
  Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
  arXiv  Detail & Related papers  (2023-11-07T04:35:03Z)
• Scalable Quantum Repeater Deployment Modeling [3.7710541619011737]
  Long-distance quantum communication presents a significant challenge as maintaining the fidelity of qubits can be difficult. We present novel models to quickly determine a minimum number of quantum repeaters to deploy in large-scale networks.
  arXiv  Detail & Related papers  (2023-05-16T23:54:41Z)
• 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)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Simulating quantum repeater strategies for multiple satellites [0.5277024349608834]
  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.
  arXiv  Detail & Related papers  (2021-10-29T14:13:57Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Design of a Quantum-Repeater using Quantum-Circuits and benchmarking its performance on an IBM Quantum-Computer [1.9447311464267876]
  We report the circuit-level implementation of a quantum repeater, and benchmark this protocol on IBM's cloud quantum computer - IBMQ. Our experiments indicate a 26% fidelity of shared bell-pairs for a complete on-chip quantum repeater with a yield of 49%.
  arXiv  Detail & Related papers  (2020-09-09T21:44:11Z)

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.