On quantum network coding
From MaRDI portal
Recommendations
Cites work
- A simple formula for the average gate fidelity of a quantum dynamical operation
- A single quantum cannot be cloned
- An information theoretical model for quantum secret sharing schemes
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Fidelity for Mixed Quantum States
- General teleportation channel, singlet fraction, and quasidistillation
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- Network information flow
- On the capacity of information networks
- Quantum Network Coding
- Quantum Network Communication—The Butterfly and Beyond
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Cited in
(14)- Perfect quantum multiple-unicast network coding protocol
- Controllable quantum network coding scheme based on quantum walk
- Quantum network probing with indefinite routing
- Quantum network coding on networks with arbitrarily distributed hidden channels
- Opportunistic quantum network coding based on quantum teleportation
- Quantum linear network coding as one-way quantum computation
- Network Coding for Distributed Quantum Computation Over Cluster and Butterfly Networks
- Quantum max-flow/min-cut
- Quantum Network Coding
- General Scheme for Perfect Quantum Network Coding with Free Classical Communication
- Nonadditivity of quantum capacities of quantum multiple-access channels and the butterfly network
- The asymptotics of quantum max-flow min-cut
- Quantum network code for multiple-unicast network with quantum invertible linear operations
- Network coding for quantum cooperative multicast
This page was built for publication: On quantum network coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5260938)