Optimising repeater schemes for the quantum internet

• URL: http://arxiv.org/abs/2006.12221v1
• Date: Mon, 22 Jun 2020 13:18:49 GMT
• Title: Optimising repeater schemes for the quantum internet
• Authors: Kenneth Goodenough, David Elkouss, Stephanie Wehner
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The rate at which quantum communication tasks can be performed using direct transmission is fundamentally hindered by the channel loss. Quantum repeaters allow, in principle, to overcome these limitations, but their introduction necessarily adds an additional layer of complexity to the distribution of entanglement. This additional complexity - along with the stochastic nature of processes such as entanglement generation, Bell swaps, and entanglement distillation - makes finding good quantum repeater schemes non-trivial. We develop an algorithm that can efficiently perform a heuristic optimisation over a subset of quantum repeater schemes for general repeater platforms. We find a strong improvement in the generation rate in comparison to an optimisation over a simpler class of repeater schemes based on BDCZ repeater schemes. We use the algorithm to study three different experimental quantum repeater implementations on their ability to distribute entanglement, which we dub \emph{information processing} implementations, \emph{multiplexed} implementations, and combinations of the two. We perform this heuristic optimisation of repeater schemes for each of these implementations for a wide range of parameters and different experimental settings. This allows us to make estimates on what are the most critical parameters to improve for entanglement generation, how many repeaters to use, and which implementations perform best in their ability to generate entanglement.

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)
• Optimal control in large open quantum systems: the case of transmon readout and reset [44.99833362998488]
  We present a framework that combines the adjoint state method together with reverse-time back-propagation to solve prohibitively large open-system quantum control problems. We apply this framework to optimize two inherently dissipative operations in superconducting qubits. Our results show that, given a fixed set of system parameters, shaping the control pulses can yield 2x improvements in the fidelity and duration for both of these operations.
  arXiv  Detail & Related papers  (2024-03-21T18:12:51Z)
• Task Scheduling Optimization from a Tensor Network Perspective [41.94295877935867]
  We present a novel method for task optimization in industrial plants using quantum-inspired tensor network technology. We simulate a quantum system with all possible combinations, perform an imaginary time evolution and a series of projections to satisfy the constraints.
  arXiv  Detail & Related papers  (2023-11-17T10:10:46Z)
• CORE: Common Random Reconstruction for Distributed Optimization with Provable Low Communication Complexity [110.50364486645852]
  Communication complexity has become a major bottleneck for speeding up training and scaling up machine numbers. We propose Common Om REOm, which can be used to compress information transmitted between machines.
  arXiv  Detail & Related papers  (2023-09-23T08:45:27Z)
• Optimal entanglement swapping in quantum repeaters [0.0]
  We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process. We show that the commonly used "doubling" scheme does not always produce the best possible raw rate. Our approach provides the minimal possible waiting time of quantum repeaters in a fairly general physical setting.
  arXiv  Detail & Related papers  (2021-09-02T09:02:40Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Simple efficient decoders for quantum key distribution over quantum repeaters with encoding [1.218340575383456]
  We study the implementation of quantum key distribution systems over quantum repeater infrastructures. We propose two decoder structures for encoded repeaters that improve system performance. We quantify the regimes of operation, where one class of repeater outperforms the other.
  arXiv  Detail & Related papers  (2020-12-23T22:45:25Z)
• 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)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Decentralised Learning with Random Features and Distributed Gradient Descent [39.00450514924611]
  We investigate the generalisation performance of Distributed Gradient Descent with Implicit Regularisation and Random Features in a homogenous setting. We establish high probability bounds on the predictive performance for each agent as a function of the step size, number of iterations, inverse spectral gap of the communication matrix and number of Random Features. We present simulations that show how the number of Random Features, iterations and samples impact predictive performance.
  arXiv  Detail & Related papers  (2020-07-01T09:55:09Z)
• Quantum repeater for continuous variable entanglement distribution [0.0]
  We present an improved continuous variable repeater scheme using optimal Gaussian entanglement swapping. We show that our scheme beats the direct transmission upper limit for shorter distances.
  arXiv  Detail & Related papers  (2020-04-14T08:02:42Z)

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.