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
- 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) - Graph Neural Network Autoencoders for Efficient Quantum Circuit
Optimisation [69.43216268165402]
We present for the first time how to use graph neural network (GNN) autoencoders for the optimisation of quantum circuits.
We construct directed acyclic graphs from the quantum circuits, encode the graphs and use the encodings to represent RL states.
Our method is the first realistic first step towards very large scale RL quantum circuit optimisation.
arXiv Detail & Related papers (2023-03-06T16:51:30Z) - 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) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - Overcoming the repeaterless bound in continuous-variable quantum
communication without quantum memories [0.0]
One of the main problems in quantum communications is how to achieve high rates at long distances.
We introduce a continuous-variable protocol which overcomes the repeaterless bound and scales like the single-repeater bound.
We show that our scheme can be extended to longer repeater chains using quantum memories.
arXiv Detail & Related papers (2021-05-08T04:02:17Z) - 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) - Learning to Beamform in Heterogeneous Massive MIMO Networks [48.62625893368218]
It is well-known problem of finding the optimal beamformers in massive multiple-input multiple-output (MIMO) networks.
We propose a novel deep learning based paper algorithm to address this problem.
arXiv Detail & Related papers (2020-11-08T12:48:06Z) - 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) - 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.