Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Analysis of Quantum Repeater Chains with Sequential Swaps

Published 28 May 2024 in quant-ph | (2405.18252v1)

Abstract: We evaluate the performance of two-way quantum repeater chains with sequential entanglement swapping. Within the analysis we consider memory decoherence, gate imperfections, and imperfect link-level entanglement generation. Our main results include closed-form expressions for the average entanglement fidelity of the generated end-to-end entangled states. We generalize previous findings for the one-shot fidelity analysis and study the case where repeater chains serve end-to-end requests continuously. We provide solutions to the continuous request scenario by combining results from quantum information theory and queuing theory. Finally, we apply the formulas obtained to analyze the impacts of hardware parameters, i.e., coherence times and gate fidelity, and distance on the entanglement fidelity and secret key rate of homogeneous quantum repeater chains.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (23)
  1. Distributed quantum computing. In International Symposium on Mathematical Foundations of Computer Science, pages 1–20. Springer, 2003.
  2. Distributed quantum sensing using continuous-variable multipartite entanglement. Phys. Rev. A, 97:032329, Mar 2018.
  3. Fully device independent quantum key distribution. Commun. ACM, 62(4):133, mar 2019.
  4. Quantum computation and quantum information. Cambridge university press, 2010.
  5. Development of quantum interconnects (quics) for next-generation information technologies. PRX Quantum, 2(1):017002, 2021.
  6. Automated distribution of high-rate, high-fidelity polarization entangled photons using deployed metropolitan fibers, 2024.
  7. John Preskill. Quantum Computing in the NISQ era and beyond. Quantum, 2:79, August 2018.
  8. Distance-independent entanglement generation in a quantum network using space-time multiplexed greenberger–horne–zeilinger (ghz) measurements. In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 334–345, 2021.
  9. Optimal architectures for long distance quantum communication. Scientific reports, 6(1):20463, 2016.
  10. Quantum cryptography: Public key distribution and coin tossing. Theoretical Computer Science, 560:7–11, 2014.
  11. Quantum network utility maximization. In 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), volume 1, pages 1238–1248. IEEE, 2023.
  12. Hardware requirements for trapped-ion based verifiable blind quantum computing with a measurement-only client. arXiv preprint arXiv:2403.02656, 2024.
  13. A connectionless entanglement distribution protocol design in quantum networks. IEEE Network, 38(1):131–139, 2024.
  14. Efficient computation of the waiting time and fidelity in quantum repeater chains. IEEE Journal on Selected Areas in Communications, 38(3):619–639, 2020.
  15. Netsquid, a network simulator for quantum information using discrete events. Communications Physics, 4(1):164, 2021.
  16. Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible. Physical Review Research, 5(2):023086, 2023.
  17. On noise in swap asap repeater chains: exact analytics, distributions and tight approximations, 2024.
  18. Scheduling quantum teleportation with noisy memories. In 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 437–446, 2022.
  19. Mark M Wilde. Quantum information theory. Cambridge university press, 2013.
  20. Fundamental limits of repeaterless quantum communications. Nature communications, 8(1):1–15, 2017.
  21. Mor Harchol-Balter. Performance modeling and design of computer systems: queueing theory in action. Cambridge University Press, 2013.
  22. David MC Wishart. Queuing systems in which the discipline is “last-come, first-served”. Operations Research, 8(5):591–599, 1960.
  23. Mixed-state entanglement and quantum error correction. Phys. Rev. A, 54:3824–3851, Nov 1996.
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.