2019/10/31 by Poramet Pathumsoot, Takaaki Matsuo, Takahiko Satoh +3 · 1 citation
Computer Science · Physics and Astronomy · #Algorithm #Computer engineering #Computer network #Computer science #Linear network coding #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum entanglement #Quantum mechanics #Quantum network #Theoretical computer science #quant-ph
paper · pdf · doi:10.1103/physreva.101.052301
published as Phys. Rev. A 101, 052301 (2020) · 10 pages, 8 figures
arxiv created 2019/11/11 · openalex publication_date 2020/05/01 · arxiv updated 2020/05/06 · openalex created_date 2020/05/13 · openalex updated_date 2026/08/05
Quantum network coding has been proposed to improve resource utilization to support distributed computation but has not yet been put into practice. We investigate a particular implementation of quantum network coding using measurement-based quantum computation on IBM Q processors. We compare the performance of quantum network coding with entanglement swapping and entanglement distribution via linear cluster states. These protocols outperform quantum network coding in terms of the final Bell pair fidelities but are unsuitable for optimal resource utilization in complex networks with contention present. We demonstrate the suitability of noisy intermediate-scale quantum devices such as the IBM Q for the study of quantum networks. We also identify the factors that limit the performance of quantum network coding on these processors and provide estimates of error rates required to boost the final Bell pair fidelities to a point where they can be used for generation of genuinely random cryptographic keys, among other useful tasks. Surprisingly, the required error rates are only around a factor of 2 smaller than the current status, and we expect they will be achieved in the near future.