Braess Paradox in a quantum network

Abstract

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 a quantum network, where edges represent shared entangled states between spatially separated parties(nodes). The goal is to entangle two previously uncorrelated nodes using entanglement swappings. The amount of entanglement between the distant nodes is quantified by the average concurrence of the states established, as a result of the entanglement swappings. We then introduce an additional edge of maximally entangled Bell states in the network. We show that the introduction of the additional maximally entangled states to this network leads to lower concurrence between the two previously un-correlated nodes. Thus we demonstrate the occurrence of a phenomenon in a quantum network that is analogous to the Braess' paradox in traffic networks.

arXiv commentAccepted for publication in PRA, close to final version

References in corpus (24)

• Entanglement of Formation of an Arbitrary State of Two Qubits
• Quantum cryptography: Public key distribution and coin tossing
• Conditions for a class of entanglement transformations
• A Multiparticle Generalization of Entanglement Swapping
• Distributed Quantum Computation over Noisy Channels
• Efficient long distance quantum communication
• Towards a Distributed Quantum Computing Ecosystem
• Quantum complex networks
• Entanglement Distribution in Pure-State Quantum Networks
• On the fidelity of mixed states of two qubits
• Distributing Graph States Over Arbitrary Quantum Networks
• Distribution of entanglement in large-scale quantum networks
• Remote Preparation and Distribution of Bipartite Entangled States
• The price of anarchy in basketball
• Transport inefficiency in branched-out mesoscopic networks: An analog of the Braess paradox
• Entanglement Swapping of Two Arbitrarily Degraded Entangled States
• No purification for two copies of a noisy entangled state
• Multipartite entanglement percolation
• Entanglement Percolation with Bipartite Mixed States
• Singlet Generation in Mixed State Quantum Networks
• Efficient quantum repeater in perspectives of both entanglement concentration rate and LOCC complexity
• Universal Braess paradox in open quantum dots
• Quantum routing games
• Long Distance Entanglement Generation in 2D Networks