Policies for elementary links in a quantum network

  title={Policies for elementary links in a quantum network},
  author={Sumeet Khatri},
Distributing entanglement over long distances is one of the central tasks in quantum networks. An important problem, especially for near-term quantum networks, is to develop optimal entanglement distribution protocols that take into account the limitations of current and near-term hardware, such as quantum memories with limited coherence time. We address this problem by initiating the study of quantum network protocols for entanglement distribution using the theory of decision processes, such… 

Figures and Tables from this paper

Simulating quantum repeater strategies for multiple satellites
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 vacuum
Designing tomorrow's quantum internet
Principles of quantum mechanics promise a future quantum internet that connects a wide variety of quantum devices together in a coherent and secure fashion. It is well known that due to the size of


Practical figures of merit and thresholds for entanglement distribution in quantum networks
This work considers three figures of merit for the performance of a quantum network: the average global connection time, the average point-to-point connectionTime, and the average largest entanglement cluster size, and obtains lower and upper bounds on these three quantities.
Robust quantum network architectures and topologies for entanglement distribution
Entanglement distribution is a prerequisite for several important quantum information processing and computing tasks, such as quantum teleportation, quantum key distribution, and distributed quantum
Design and analysis of communication protocols for quantum repeater networks
It is found that a quantum-dot repeater with the newest protocol (‘MidpointSource’) delivers the highest entanglement-distribution rate for typical cases where there is low probability of establishingEntanglement per transmission, and in some cases the rate is orders of magnitude higher than other schemes.
On the Stochastic Analysis of a Quantum Entanglement Distribution Switch
In this article, we study a quantum entanglement distribution switch that serves $k$ users in a star topology. We model variants of the system as continuous-time Markov chains and obtain expressions
Modular architectures for quantum networks
This work proposes a quantum network configuration protocol, where entanglement purification is used to establish high fidelity states, and proposes architectures based on shared multipartite entangled Greenberger–Horne–Zeilinger states of different size, and fully connected decorated graph states, respectively.
Optimizing entanglement generation and distribution using genetic algorithms
This work proposes a methodology based on genetic algorithms and simulations of quantum repeater chains for optimization of entanglement generation and distribution and demonstrates that it can be used to answer questions such as what are the minimum viable quantum repeaters satisfying given network performance benchmarks.
A link layer protocol for quantum networks
This work proposes a functional allocation of a quantum network stack, and constructs the first physical and link layer protocols that turn ad-hoc physics experiments producing heralded entanglement between quantum processors into a well-defined and robust service.
Effective routing design for remote entanglement generation on quantum networks
An effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations on a quantum lattice network with finite edge capacities is proposed and three algorithms are proposed and compared for the scheduling of capacity allocation on the edges of quantum network.
NetSquid, a NETwork Simulator for QUantum Information using Discrete events
NetSquid, a quantum network simulator that allows studying how such networks can be built, including physical hardware modelling, modularity, scalability, and examples is presented.
Large-scale quantum networks based on graphs
This work shows how to generalise the quantum repeater concept to the multipartite case, by describing large-scale quantum networks, i.e. network nodes and their long-distance links, consistently in the language of graphs and graph states, and protects against errors via encoding.