Optimized Quantum Networks
arXiv:2107.10275 · doi:10.22331/q-2023-02-09-919
Abstract
The topology of classical networks is determined by physical links between nodes, and after a network request the links are used to establish the desired connections. Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests, which can substitute links and allow one to fulfill multiple network requests with the same resource state. We utilize this to design entanglement-based quantum networks tailored to their desired functionality, independent of the underlying physical structure. The kind of entanglement to be stored is chosen to fulfill all desired network requests (i.e. parallel bipartite or multipartite communications between specific nodes chosen from some finite set), but in such a way that the storage requirement is minimized. This can be accomplished by using multipartite entangled states shared between network nodes that can be transformed by local operations to different target states. We introduce a clustering algorithm to identify connected clusters in the network for a given desired functionality, i.e. the required network topology of the entanglement-based network, and a merging algorithm that constructs multipartite entangled resource states with reduced memory requirement to fulfill all desired network requests. This leads to a significant reduction in required time and resources, and provides a powerful tool to design quantum networks that is unique to entanglement-based networks.
arXiv comment22 pages, 11 figures
References in corpus (35)
- The Quantum Internet
- Fundamental Limits of Repeaterless Quantum Communications
- General Benchmarks for Quantum Repeaters
- Multi-party entanglement in graph states
- Quantum repeaters based on entanglement purification
- Distributed Quantum Computation over Noisy Channels
- Quantum Internet: Networking Challenges in Distributed Quantum Computing
- Efficient long distance quantum communication
- End-to-end capacities of a quantum communication network
- NetSquid, a NETwork Simulator for QUantum Information using Discrete events
- The Schmidt Measure as a Tool for Quantifying Multi-Particle Entanglement
- Multi-partite entanglement speeds up quantum key distribution in networks
- Path Selection for Quantum Repeater Networks
- Optimal and Secure Measurement Protocols for Quantum Sensor Networks
- A quantum network stack and protocols for reliable entanglement-based networks
- Towards Large-Scale Quantum Networks
- Modular architectures for quantum networks
- Quantum network routing and local complementation
- Decentralized Base-Graph Routing for the Quantum Internet
- Distributing Graph States Over Arbitrary Quantum Networks
- Tools for quantum network design
- Practical figures of merit and thresholds for entanglement distribution in quantum networks
- Entanglement-Gradient Routing for Quantum Networks
- Opportunistic Entanglement Distribution for the Quantum Internet
- Recursive quantum repeater networks
- Large-scale quantum networks based on graphs
- Optimal distributed sensing in noisy environments
- Genuine quantum networks: superposed tasks and addressing
- Analysis of Quantum Network Coding for Realistic Repeater Networks
- Transforming graph states using single-qubit operations
- Quantum Router with Network Coding
- Delocalized information in quantum networks
- Growth of graph states in quantum networks
- Transforming graph states to Bell-pairs is NP-Complete
- Probabilistic growth of large entangled states with low error accumulation
Cited by in corpus (14)
- Conference key agreement in a quantum network
- Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning
- Influence of noise in entanglement-based quantum networks
- Noisy Stabilizer Formalism
- Flexible quantum data bus for quantum networks
- Imperfect quantum networks with tailored resource states
- Efficient source-independent quantum conference key agreement
- Generating EPR-pairs from an -party resource state
- Experimental Efficient Source-Independent Quantum Conference Key Agreement
- Network mechanism for generating genuinely correlative Gaussian states
- Temporal Framework for Causality-Preserving Scheduling of Measurements in Quantum Networks
- Threshold (Q, P) Quantum Distillation
- Long-ranged gates in quantum computation architectures with limited connectivity
- Task Concurrency and Compatibility in Measurement-Based Quantum Networks