Papers
Topics
Authors
Recent
Search
2000 character limit reached

Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies

Published 24 Jan 2024 in quant-ph | (2401.13168v3)

Abstract: Future quantum networks will have nodes equipped with multiple quantum memories, allowing for multiplexing and entanglement distillation strategies in order to increase fidelities and reduce waiting times for end-to-end entanglement distribution. In this work, we introduce \textit{quasi-local} policies for multiplexed quantum repeater chains. In fully-local policies, nodes make decisions based only on knowledge of their own states. In our quasi-local policies, nodes have increased knowledge of the state of the repeater chain, but not necessarily full, global knowledge. Our policies exploit the observation that for most decisions the nodes have to make, they only need to have information about the connected region of the chain they belong to, and not the entire chain. In this way, we not only obtain improved performance over local policies, but we reduce the classical communication (CC) costs inherent to global-knowledge policies. Our policies also outperform the well-known and widely studied nested purification and doubling swapping policy in practically relevant parameter regimes. We also carefully examine the role of entanglement distillation. Via analytical and numerical results, we identify the parameter regimes in which distillation makes sense and is useful. In these regimes, we also address the question: "Should we distill before swapping, or vice versa?" Finally, to provide further practical guidance, we propose an experimental implementation of a multiplexing-based repeater chain, and experimentally demonstrate the key element, a high-dimensional biphoton frequency comb. We then evaluate the anticipated performance of our multiplexing-based policies in such a real-world network through simulation results for two concrete memory platforms, namely rare-earth ions and diamond vacancies.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (26)
  1. S. Wehner, D. Elkouss, and R. Hanson, Quantum internet: A vision for the road ahead, Science 362 (2018).
  2. J. Dowling, Schrödinger’s Web: Race to Build the Quantum Internet (Taylor & Francis, 2020).
  3. R. Van Meter, Quantum Networking (John Wiley & Sons, Ltd, 2014).
  4. C. H. Bennett and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, in International Conference on Computer System and Signal Processing, IEEE (1984) pp. 175–179.
  5. T. J. Proctor, P. A. Knott, and J. A. Dunningham, Multiparameter estimation in networked quantum sensors, Physical Review Letters 120, 080501 (2018).
  6. N. K. Bernardes, L. Praxmeyer, and P. van Loock, Rate analysis for a hybrid quantum repeater, Physical Review A 83, 012323 (2011).
  7. K. Azuma, K. Tamaki, and H.-K. Lo, All-photonic quantum repeaters, Nature Communications 6 (2015).
  8. S. Das, S. Khatri, and J. P. Dowling, Robust quantum network architectures and topologies for entanglement distribution, Physical Review A 97, 012335 (2018).
  9. S. E. Vinay and P. Kok, Statistical analysis of quantum-entangled-network generation, Physical Review A 99, 042313 (2019).
  10. E. Shchukin, F. Schmidt, and P. van Loock, Waiting time in quantum repeaters with probabilistic entanglement swapping, Physical Review A 100, 032322 (2019).
  11. B. Li, T. Coopmans, and D. Elkouss, Efficient Optimization of Cutoffs in Quantum Repeater Chains, IEEE Transactions on Quantum Engineering 2, 1 (2021).
  12. S. Khatri, Towards a General Framework for Practical Quantum Network Protocols, Ph.D. thesis, Louisiana State University (2021), https://digitalcommons.lsu.edu/gradschool_dissertations/5456/.
  13. T. Coopmans, Tools for the design of quantum repeater networks, Ph.D. thesis, Delft University of Technology (2021), https://repository.tudelft.nl/islandora/object/uuid:90d06f1d-4f23-48cc-8f96-51500258020f?collection=research.
  14. T. Coopmans, S. Brand, and D. Elkouss, Improved analytical bounds on delivery times of long-distance entanglement, Physical Review A 105, 012608 (2022).
  15. W. Dai and D. Towsley, Entanglement Swapping for Repeater Chains with Finite Memory Sizes, arXiv:2111.10994  (2021).
  16. S. D. Reiß and P. van Loock, Deep reinforcement learning for key distribution based on quantum repeaters, arXiv:2207.09930  (2022).
  17. M. Razavi, M. Piani, and N. Lütkenhaus, Quantum repeaters with imperfect memories: Cost and scalability, Physical Review A 80, 032301 (2009a).
  18. Y.-B. Sheng and F.-G. Deng, Deterministic entanglement purification and complete nonlocal Bell-state analysis with hyperentanglement, Physical Review A 81, 032307 (2010a), 0912.0079 .
  19. Y.-B. Sheng and F.-G. Deng, One-step deterministic polarization-entanglement purification using spatial entanglement, Physical Review A 82, 044305 (2010b), 1008.3509 .
  20. C. Simon, H. de Riedmatten, and M. Afzelius, Temporally multiplexed quantum repeaters with atomic gases, Physical Review A 82, 010304 (2010), 1007.5028 .
  21. Y.-B. Sheng, L. Zhou, and G.-L. Long, Hybrid entanglement purification for quantum repeaters, Physical Review A 88, 022302 (2013).
  22. L. Zhou, W. Zhong, and Y.-B. Sheng, Purification of the residual entanglement, Optics Express 28, 2291 (2020).
  23. E. Shchukin and P. van Loock, Optimal entanglement swapping in quantum repeaters, Phys. Rev. Lett. 128, 150502 (2022).
  24. T. Matsuo, C. Durand, and R. Van Meter, Quantum link bootstrapping using a ruleset-based communication protocol, Physical Review A 100, 052320 (2019).
  25. T. Matsuo, Simulation of a Dynamic, RuleSet-based Quantum Network, arXiv:1908.10758  (2019).
  26. J. Ghosh, A. G. Fowler, and M. R. Geller, Surface code with decoherence: An analysis of three superconducting architectures, Physical Review A 86, 062318 (2012), 1210.5799 .
Citations (4)

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 2 tweets with 2 likes about this paper.