ML p(r)ior | Quantum Capacities for Entanglement Networks

### Quantum Capacities for Entanglement Networks

2016-02-01
1602.00401 | quant-ph
We discuss quantum capacities for two types of entanglement networks: $\mathcal{Q}$ for the quantum repeater network with free classical communication, and $\mathcal{R}$ for the tensor network as the rank of the linear operation represented by the tensor network. We find that $\mathcal{Q}$ always equals $\mathcal{R}$ in the regularized case for the samenetwork graph. However, the relationships between the corresponding one-shot capacities $\mathcal{Q}_1$ and $\mathcal{R}_1$ are more complicated, and the min-cut upper bound is in general not achievable. We show that the tensor network can be viewed as a stochastic protocol with the quantum repeater network, such that $\mathcal{R}_1$ is a natural upper bound of $\mathcal{Q}_1$. We analyze the possible gap between $\mathcal{R}_1$ and $\mathcal{Q}_1$ for certain networks, and compare them with the one-shot classical capacity of the corresponding classical network.

Highlights - Most important sentences from the article

# Related Articles

2019-05-03
1905.01330 | physics.comp-ph

TensorNetwork is an open source library for implementing tensor network algorithms. Tensor networks … show more

Highlights - Most important sentences from the article

2018-06-13
1806.04965 | stat.ML

Deep neural networks, and in particular recurrent networks, are promising candidates to control auto… show more

Highlights - Most important sentences from the article

2017-02-27
1702.08459 | quant-ph

Recent progress in applying complex network theory to problems in quantum information has resulted i… show more

Highlights - Most important sentences from the article

2019-02-12
1902.04595 | cs.SI

The spectrum of the adjacency matrix plays several important roles in the mathematical theory of net… show more

Highlights - Most important sentences from the article

2018-10-26
1810.11274 | cs.SY

This work analyzes the convergence properties of signed networks with nonlinear edge functions. We c… show more

Highlights - Most important sentences from the article

2019-03-27
1903.11246 | cs.SY

This paper presents conditions for establishing topological controllability in undirected networks o… show more

Highlights - Most important sentences from the article

2019-01-09
1901.02787 | cs.IT

This paper investigates the problem of secure communication in a wireline noiseless scenario where a… show more

Highlights - Most important sentences from the article

2018-10-08
1810.03556 | quant-ph

We present a stack model for breaking down the complexity of entanglement-based quantum networks. Mo… show more

Highlights - Most important sentences from the article

2019-02-21
1902.08007 | cs.DC

An Automata Network is a map ${f:Q^n\rightarrow Q^n}$ where $Q$ is a finite alphabet. It can be view… show more

Highlights - Most important sentences from the article

2019-01-09
1901.02933 | cs.IT

This paper studies the 1-2-1 half-duplex network model, where two half-duplex nodes can communicate … show more

Highlights - Most important sentences from the article

2018-10-25
1810.10838 | quant-ph

There are two central models considered in (fault-free synchronous) distributed computing: the CONGE… show more

Highlights - Most important sentences from the article

2017-09-12
1709.03636 | quant-ph

Classical simulation of quantum computation is necessary for studying the numerical behavior of quan… show more

Highlights - Most important sentences from the article

2018-12-04
1812.01637 | cs.NI

We study a few problems in Boolean Network Tomography, related to maximal vertex identifiability, i.… show more

Highlights - Most important sentences from the article

2018-12-21
1812.09290 | quant-ph

We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of… show more

Highlights - Most important sentences from the article

2019-04-05
1904.05334 | cs.SI

These tips provide a quick and concentrated guide for beginners in the analysis of network data.

Highlights - Most important sentences from the article

2019-01-04
1901.01058 | cs.IT

The combination network is one of the simplest and insightful networks in coding theory. The vector … show more