Related papers: Multi-tree Quantum Routing in Realistic Topologies
Entanglement phase transitions in quantum chaotic systems subject to projective measurements and in random tensor networks have emerged as a new class of critical points separating phases with different entanglement scaling. We propose a…
In the quantum repeater networks of the quantum Internet, the varying stability of entangled quantum links makes dynamic topology adaption an emerging issue. Here we define an efficient topology adaption method for quantum repeater…
The development of quantum networks (QNs) relies on efficient mechanisms for distributing entanglement among multiple quantum users (QUs) under practical system constraints. This paper investigates the problem of entanglement rate…
We consider the problem of throughput-optimal broadcast- ing in time-varying wireless networks, whose underlying topology is restricted to Directed Acyclic Graphs (DAG). Previous broadcast algorithms route packets along spanning trees. In…
A theoretical scheme is introduced to generate entangled network via Dzyaloshinskii- Moriya (DM)interaction. The dynamics of entanglement generated between different nodes by direct or indirect interaction is investigated. It is shown that,…
We consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing approaches to this problem can be modeled as the construction of…
Future quantum technologies such as quantum communication, quantum sensing, and distributed quantum computation, will rely on networks of shared entanglement between spatially separated nodes. In this work, we provide improved…
Quantum Key Distribution (QKD) networks require routing methodologies capable of jointly optimizing latency, secret key generation rate, congestion, finite capacity and operational security constraints under dynamically evolving traffic…
We investigate creation, manipulation, and steering of entanglement in spin chains from the viewpoint of quantum communication between distant parties. We demonstrate how global parametric driving of the spin-spin coupling and/or local…
In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, communication channels can be established between them via quantum…
The performance of distributing entanglement between two distant nodes in a large-scale quantum network (QN) of partially entangled bipartite pure states is generally benchmarked against the classical entanglement percolation (CEP) scheme.…
Near-term quantum hardware can support two-qubit operations only on the qubits that can interact with each other. Therefore, to execute an arbitrary quantum circuit on the hardware, compilers have to first perform the task of qubit routing,…
Characterizing multiloop topologies is an important step towards developing novel methods at high perturbative orders in quantum field theory. In this article, we exploit the Loop-Tree Duality (LTD) formalism to analyse multiloop topologies…
Some multi-path routing algorithm in MANET, simultaneously send information to the destination through several directions to reduce end-to-end delay. In all these algorithms, the sent traffic through a path affects the adjacent path and…
We study the transport efficiency of excitations on complex quantum networks with loops. For this we consider sequentially growing networks with different topologies of the sequential subgraphs. This can lead either to a universal complete…
Dietrich Braess while working on traffic modelling, noticed that traffic flow in a network can be worsened by adding extra edges to an existing network. This seemingly counterintuitive phenomenon is known as the Braess paradox. We consider…
Quantum networks offer a realistic and practical scheme for generating multiparticle entanglement and implementing multiparticle quantum communication protocols. However, the correlations that can be generated in networks with quantum…
In this paper, three new dynamic multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree, Topology Based Tree and Minimum Diameter Tree. A simulation analysis is presented showing various…
The rise of the Internet of Things and edge computing has shifted computing resources closer to end-users, benefiting numerous delay-sensitive, computation-intensive applications. To speed up computation, distributed computing is a…
Shared multipartite entanglement defines a ``whatever channel'', i.e., a latent communication substrate that does not determine a priori which end-to-end entangled links are activated, but can be configured to support different…