Related papers: Braess Paradox in a quantum network
Recent advances in quantum technologies are rapidly stimulating the building of quantum networks. With the parallel development of multiple physical platforms and different types of encodings, a challenge for present and future networks is…
Quantum communication demands efficient distribution of quantum entanglement across a network of connected partners. The search for efficient strategies for the entanglement distribution may be based on percolation theory, which describes…
Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in…
It has recently been shown theoretically that elastic scattering in the Fermi sea produces quantum mechanically entangled states. The mechanism is similar to entanglement by a beam splitter in optics, but a key distinction is that the…
Quantum diagrams are the best language for Quantum Mechanics since they show not only a final result but also the physical process which leads to the result. The quantum correlation at a distance better known as the Einstein-Podolsky-Rosen…
Complex networks structures have been extensively used for describing complex natural and technological systems, like the Internet or social networks. More recently complex network theory has been applied to quantum systems, where complex…
The pairwise quantum entanglement of sites in disordered electronic one-dimensional systems (rings) is studied. We focus on the effect of diagonal and off diagonal disorder on the concurrence $C_{ij}$ between electrons on neighbor and non…
Quantum entanglement is a phenomenon in which two physical systems are correlated in such a way that they appear to instantaneously affect one another, regardless of the distance between them. As commonly understood, Bell's Theorem famously…
Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to…
The absent-minded driver's problem illustrates that probabilistic strategies can give higher pay-offs than deterministic ones. We show that there are strategies using quantum entangled states that give even higher pay-offs, both for the…
The distribution of entanglement between the nodes of a quantum network plays a fundamental role in quantum information applications. In this work, we investigate the dynamics of a network of qubits where each edge corresponds to an…
Message Passing Graph Neural Networks are known to suffer from two problems that are sometimes believed to be diametrically opposed: over-squashing and over-smoothing. The former results from topological bottlenecks that hamper the…
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or…
Rendezvous is an old problem of assuring that two or more parties, initially separated, not knowing the position of each other, and not allowed to communicate, meet without pre-agreement on the meeting point. This problem has been…
We investigate the bipartite entanglement for the boundary states in a simple type of spin networks with dangling edges, in which the two complementary parts are linked by two or more edges. Firstly, the spin entanglement is considered in…
The concept of concurrence is researched to characterize the dynamical behavior of the bipartite systems. The quantum kicked top model has great significance in the qubit systems and the chaotic properties of the entanglement. The…
Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages…
Optimal routing is a fundamental challenge in quantum networking, with several approaches proposed to identify the most efficient path for end-to-end (e2e) entanglement generation between pairs of nodes. In this paper, we show that…
Entanglement concurrence has been widely used for featuring entanglement in quantum experiments. As an entanglement monotone it is related to specific quantum Tsallis entropy. Our goal in this paper is to propose a new parameterized…
In an Ideal Shortest Path Algorithm (ISPA), at each moment each router in a network sends all of its traffic down the path that will incur the lowest cost to that traffic. In the limit of an infinitesimally small amount of traffic for a…