Name
Abstract | ||
|---|---|---|
Quantum network coding with the assistance of auxiliary resources can achieve perfect transmission of the quantum state. This paper suggests a novel perfect network coding scheme to efficiently solve the quantum k-pair problem, in which only a few assisting resources are introduced. Specifically, only one pair of maximally entangled state needs to be pre-shared between two intermediate nodes, and only O(k) of classical information is transmitted though the network. Moreover, the classical communication used in our protocol does not cause transmission congestion, providing better adaptability to large-scale quantum k-pair networks. Through relevant analyses and comparisons, we demonstrate that our proposed scheme saves resources and has good application value, thereby showing its high efficiency. Furthermore, the proposed scheme achieves 1-max flow quantum communication, and the achievable rate region result is extended from its counterpart over the butterfly network. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s11432-018-9592-9 | Science China Information Sciences |
Keywords | Field | DocType |
perfect quantum network coding, quantum k-pair problem, efficient quantum state transmission, communication efficiency, achievable rate region | Linear network coding,Adaptability,Transmission (mechanics),Topology,Quantum,Mathematical optimization,Quantum state,Coding (social sciences),Quantum information science,Mathematics,Quantum network | Journal |
Volume | Issue | ISSN |
62 | 1 | 1869-1919 |
Citations | PageRank | References |
0 | 0.34 | 24 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhen-zhen Li | 1 | 2 | 1.50 |
| Gang Xu | 2 | 36 | 18.66 |
| Xiu-Bo Chen | 3 | 163 | 36.11 |
| Zhiguo Qu | 4 | 10 | 3.85 |
| Xinxin Niu | 5 | 211 | 33.93 |
| Yixian Yang | 6 | 1121 | 140.62 |