# Increasing the classical data throughput in quantum networks by combining quantum linear network coding with superdense coding

@article{Herbert2019IncreasingTC, title={Increasing the classical data throughput in quantum networks by combining quantum linear network coding with superdense coding}, author={Steven Herbert}, journal={Physical Review A}, year={2019}, volume={101}, pages={062332} }

This paper shows how network coding and superdense coding can be combined to increase the classical data throughput by a factor $2-\epsilon$ (for arbitrarily small $\epsilon > 0$) compared to the maximum that could be achieved using either network coding or superdense coding alone. Additionally, a general decomposition of a ``mixed'' network (i.e., consisting of classical and quantum links) is given, and it is reasoned that, owing to the inherent hardness of finding network codes, this may well…

## 2 Citations

### Butterfly network coding based on bidirectional hybrid controlled quantum communication

- Computer ScienceQuantum Information Processing
- 2022

This protocol is the first time that a protocol integrates bidirectional hybrid controlled quantum communication and quantum network coding and has good potential to enhance the efficiency of communication in the quantum network.

## References

SHOWING 1-10 OF 18 REFERENCES

### Quantum linear network coding as one-way quantum computation

- Computer ScienceTQC
- 2014

The quantum linear network coding protocols of Kobayashi et al. coherently simulate classical linear network codes, using supplemental classical communication to demonstrate that these protocols correspond in a natural way to measurement-based quantum computations with graph states over qudits having a structure directly related to the network.

### Quantum network coding for quantum repeaters

- Computer Science, Physics
- 2012

It is shown, for the first time, that quantum network coding techniques can increase the transmission rate in such quantum networks as well.

### Quantum linear network coding for entanglement distribution in restricted architectures

- Computer ScienceQuantum
- 2020

It is demonstrated how adapting quantum linear network coding to this problem of entanglement distribution in a network of qubits can be used to solve the problem of distributing Bell states and GHZ states in parallel, when bottlenecks in $G$ would otherwise force such entangled states to be distributed sequentially.

### Quantum Network Communication—The Butterfly and Beyond

- Computer ScienceIEEE Transactions on Information Theory
- 2010

Routing is proved optimal, and the free assisting classical communication can at best be used to modify the directions of quantum channels in the network.

### Beating the channel capacity limit for superdense coding with entangled ququarts

- Physics, Computer ScienceScience Advances
- 2018

This experiment reports an experiment that exceeds the channel capacity limit for superdense coding with high-dimensional entanglement using high-quality entangled ququarts with fidelities up to 0.98, demonstrating a channel capacity of 2.09 ± 0.01.

### Superdense coding for quantum networking environments

- Physics, Computer ScienceOPTO
- 2018

This work presents results on the integration of quantum communication using superdense coding transmitted over optical fiber links into network environments using a novel complete Bell-state measurement setup that relies on hyper-entanglement in the temporal and polarization degrees of freedom for a two-photon state emitted from a quantum light source.

### A study of teleportation and super dense coding capacity in remote entanglement distribution

- Computer Science, Physics
- 2013

In an arbitrary quantum network when two nodes are not connected, the result shows how much information, both quantum and classical, can be transmitted between these nodes and shows that the amount of transferable information depends on the capacities of the inter connecting entangled resources.

### Complexity classification of network information flow problems

- Computer ScienceSODA '04
- 2004

This paper establishes a three-way partition consisting of problems solvable without resorting to network coding, problems requiring network coding that are polynomial-time solvable, and problems for which obtaining a linear network coding solution is NP-hard.

### Network information flow

- Computer ScienceIEEE Trans. Inf. Theory
- 2000

This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.

### Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.

- PhysicsPhysical review letters
- 1993

An unknown quantum state \ensuremath{\Vert}\ensuremath{\varphi}〉 can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical Einstein-Podolsky-Rosen…