Related papers: Braess Paradox in a quantum network
Small interconnected quantum processors can collaborate to tackle quantum computational problems that typically demand more capable devices. These linked processors, referred to as quantum nodes, can use shared entangled states to execute…
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…
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…
We study entanglement percolation in qubit-based planar quantum network models of arbitrary topology, where neighboring nodes are initially connected by pure states with quenched disorder in their entanglement. To address this, we develop a…
This paper defines a notion of parallel transport in a lattice of quantum particles, such that the transformation associated with each link of the lattice is determined by the quantum state of the two particles joined by that link. We focus…
The ability to distribute quantum entanglement is a prerequisite for many fundamental tests of quantum theory and numerous quantum information protocols. Two distant parties can increase the amount of entanglement between them by means of…
In quantum networks, one way to communicate is to distribute entanglements through swapping at intermediate nodes. Most existing work primarily aims to create efficient two-party end-to-end entanglement over long distances. However, some…
Given a player is guaranteed the same payoff for each delivery path in a single-cube delivery network, the player's best response is to randomly divide all goods and deliver them to all other nodes, and the best response satisfies the…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
We propose a recursive logit model which captures the notion of choice aversion by imposing a penalty term that accounts for the dimension of the choice set at each node of the transportation network. We make three contributions. First, we…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…
Synchronization is one of the paradigmatic phenomena in the study of complex systems. It has been explored theoretically and experimentally mostly to understand natural phenomena, but also in view of technological applications. Although…
In this paper, we develop a blended dynamics framework for open quantum networks with diffusive couplings. The network consists of qubits interconnected through Hamiltonian couplings, environmental dissipation, and consensus-like diffusive…
The entanglement swapping protocol (ESP) is a fundamental primitive for distributing quantum correlations across distant nodes in a quantum network. Recent studies have demonstrated that even when the involved qubit pairs are only partially…
The role of retardation in the entanglement dynamics of two distant atoms interacting with a multi-mode field of a ring cavity is discussed. The retardation is associated with a finite time required for light to travel between the atoms…
Entanglement is not only important for understanding the fundamental properties of many-body systems, but also the crucial resource enabling quantum advantages in practical information processing tasks. While previous works on entanglement…
Quantum networks with bipartite resources and shared randomness present the simplest infrastructure for implementing a future quantum internet. Here, we shall investigate which kinds of entanglement can or cannot be generated from this kind…
Many complex networks display strong heterogeneity in the degree (connectivity) distribution. Heterogeneity in the degree distribution often reduces the average distance between nodes but, paradoxically, may suppress synchronization in…
We investigate entanglement distribution in pure-state quantum networks. We consider the case when non-maximally entangled two-qubit pure states are shared by neighboring nodes of the network. For a given pair of nodes, we investigate how…
Quantum networks distributed over distances greater than a few kilometers will be limited by the time required for information to propagate between nodes. We analyze protocols that are able to circumvent this bottleneck by employing…