Related papers: Quantum Capacities for Entanglement Networks
For any quantum discrete memoryless channel, we define a quantity called quantum entanglement capacity with classical feedback ($E_B$), and we show that this quantity lies between two other well-studied quantities. These two quantities -…
Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons. Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure…
Quantum network is a set of nodes connected with channels, through which the nodes communicate photons and classical information. Classical structural complexity of a quantum network may be defined through its physical structure, i.e.…
The optimal performance of a communication network is limited not only by the quality of point-to-point channels, but by the efficacy of its constituent technologies. Understanding the limits of quantum networks requires an understanding of…
A direct proof of the relation between the one-shot classical capacity and the minimal output entropy for covariant quantum channels is suggested. The structure of covariant channels is described in some detail. A simple proof of a general…
Before global-scale quantum networks become operational, it is important to consider how to evaluate their performance so that they can be built to achieve the desired performance. We propose two practical figures of merit for the…
Quantum repeater chains will form the backbone of future quantum networks that distribute entanglement between network nodes. Therefore, it is important to understand the entanglement distribution performance of quantum repeater chains,…
Quantum networks illustrate the use of connected nodes of quantum systems as the backbone of distributed quantum information processing. When the network nodes are entangled in graph states, such a quantum platform is indispensable to…
The distribution of entanglement in quantum networks is typically approached under idealized assumptions such as perfect synchronization and centralized control, while classical communication is often neglected. However, these assumptions…
Quantum repeaters have promised efficient scaling of quantum networks for over two decades. Despite numerous platforms proclaiming functional repeaters, the realization of large-scale networks remains elusive, indicating that the resources…
Quantum networks will be able to service consumers with long-distance entanglement by use of quantum repeaters that generate Bell pairs (or links) with their neighbors, iid with probability $p$ and perform Bell State Measurements (BSMs) on…
The quantum internet holds promise for performing quantum communication, such as quantum teleportation and quantum key distribution, freely between any parties all over the globe. For such a quantum internet protocol, a general fundamental…
A sort of planar tensor networks with tensor constraints is investigated as a model for holography. We study the greedy algorithm generated by tensor constraints and propose the notion of critical protection (CP) against the action of…
Tensor Networks (TN) are approximations of high-dimensional tensors designed to represent locally entangled quantum many-body systems efficiently. This study provides a comprehensive comparison between classical TNs and TN-inspired quantum…
Tensor network algorithms seek to minimize correlations to compress the classical data representing quantum states. Tensor network algorithms and similar tools---called tensor network methods---form the backbone of modern numerical methods…
We consider the problem of multi-path entanglement distribution to a pair of nodes in a quantum network consisting of devices with non-deterministic entanglement swapping capabilities. Multi-path entanglement distribution enables a network…
Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their entanglement spectra are flat. It has therefore been argued that…
We show a similarity between two different classical simulation methods for measurement based quantum computation -- one relying on a low entanglement (tree tensor network) representation of the computer's state, and the other a tensor…
We consider the problem of creating a long-distance entangled state between two stations of a network, where neighboring nodes are connected by noisy quantum channels. We show that any two stations can share an entangled pair if the…
Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management. The classical control necessary to use the network will therefore face similar issues as Internet data…