Designing Quantum Networks Using Preexisting Infrastructure
- URL: http://arxiv.org/abs/2005.14715v2
- Date: Mon, 1 Jun 2020 07:32:50 GMT
- Title: Designing Quantum Networks Using Preexisting Infrastructure
- Authors: Julian Rabbie, Kaushik Chakraborty, Guus Avis, Stephanie Wehner
- Abstract summary: We consider the problem of deploying a quantum network on an existing fiber infrastructure.
We propose a method based on integer linear programming (ILP) to place the minimal number of repeaters on such an existing network topology.
We show that our method performs well in practice for networks of up to 100 nodes.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We consider the problem of deploying a quantum network on an existing fiber
infrastructure, where quantum repeaters and end nodes can only be housed at
specific locations. We propose a method based on integer linear programming
(ILP) to place the minimal number of repeaters on such an existing network
topology, such that requirements on end-to-end entanglement-generation rate and
fidelity between any pair of end-nodes are satisfied. While ILPs are generally
difficult to solve, we show that our method performs well in practice for
networks of up to 100 nodes. We illustrate the behavior of our method both on
randomly-generated network topologies, as well as on a real-world fiber
topology deployed in the Netherlands.
Related papers
- Teleportation fidelity of quantum repeater networks [0.0]
We show that the average of the maximum teleportation fidelities between all pairs of nodes in a large quantum repeater network is a measure of the resourcefulness of the network as a whole.
arXiv Detail & Related papers (2024-09-30T14:02:58Z) - Intra-QLAN Connectivity: beyond the Physical Topology [7.469200949273275]
Quantum Local Area Networks (QLANs) are the building block of the Quantum Internet.
QLANs are based on simpler, scarcely-connected physical topologies, such as star topologies.
This paper addresses the fundamental issue of engineering the artificial topology of a QLAN.
arXiv Detail & Related papers (2024-06-14T12:12:36Z) - On the Bipartite Entanglement Capacity of Quantum Networks [9.377912974064227]
We consider multi-path entanglement distribution to a pair of nodes in a quantum network consisting of devices with non-deterministic entanglement swapping capabilities.
We propose a mixed-integer quadratically constrained program (MIQCP) to solve this flow problem.
We then compute the overall network capacity, defined as the maximum number of EPR states distributed to users per time unit.
arXiv Detail & Related papers (2023-07-10T10:58:02Z) - Multiparty Entanglement Routing in Quantum Networks [0.0]
A protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in quantum networks.
The protocol only requires local measurements at the network nodes and just a single qubit memory per user.
arXiv Detail & Related papers (2022-11-12T15:40:34Z) - Optimized Quantum Networks [68.8204255655161]
Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests.
We utilize this to design entanglement-based quantum networks tailored to their desired functionality.
arXiv Detail & Related papers (2021-07-21T18:00:07Z) - Full network nonlocality [68.8204255655161]
We introduce the concept of full network nonlocality, which describes correlations that necessitate all links in a network to distribute nonlocal resources.
We show that the most well-known network Bell test does not witness full network nonlocality.
More generally, we point out that established methods for analysing local and theory-independent correlations in networks can be combined in order to deduce sufficient conditions for full network nonlocality.
arXiv Detail & Related papers (2021-05-19T18:00:02Z) - A Reconfigurable Quantum Local Area Network Over Deployed Fiber [1.1713998235451095]
We implement flex-grid entanglement distribution in a deployed network for the first time.
We quantify the quality of the distributed polarization entanglement via log-negativity.
We demonstrate one possible quantum protocol enabled by the distributed entanglement network.
arXiv Detail & Related papers (2021-02-26T17:08:03Z) - On Topology Optimization and Routing in Integrated Access and Backhaul
Networks: A Genetic Algorithm-based Approach [70.85399600288737]
We study the problem of topology optimization and routing in IAB networks.
We develop efficient genetic algorithm-based schemes for both IAB node placement and non-IAB backhaul link distribution.
We discuss the main challenges for enabling mesh-based IAB networks.
arXiv Detail & Related papers (2021-02-14T21:52:05Z) - Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users.
We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
arXiv Detail & Related papers (2020-11-23T19:00:01Z) - ESPN: Extremely Sparse Pruned Networks [50.436905934791035]
We show that a simple iterative mask discovery method can achieve state-of-the-art compression of very deep networks.
Our algorithm represents a hybrid approach between single shot network pruning methods and Lottery-Ticket type approaches.
arXiv Detail & Related papers (2020-06-28T23:09:27Z) - Network Adjustment: Channel Search Guided by FLOPs Utilization Ratio [101.84651388520584]
This paper presents a new framework named network adjustment, which considers network accuracy as a function of FLOPs.
Experiments on standard image classification datasets and a wide range of base networks demonstrate the effectiveness of our approach.
arXiv Detail & Related papers (2020-04-06T15:51:00Z)
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.