Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Nature

A step closer to repeaters for quantum networks

Published Aug 30, 2023• 0 citations
Publisher
DOI
10.1038/d41586-023-02283-4

Related papers

A long-distance quantum repeater gets one step closer

M. S. Shahriar

Researchers demonstrate a robust, high-fidelity, broadband quantum memory that could be used to realize a long-distance quantum repeater for secure communication.

Physics•Jul 25, 2011•2 citations

Towards a practical quantum repeater

A. Kuzmich

Bulletin of the American Physical Society•Mar 8, 2007•0 citations

Quantum Repeaters for Quantum Communication

Hans J. Briegel, J. I. Cirac, Wolfgang Dür +2 more

Springer eBooks•Jan 1, 1999•8 citations

A two-step linear programming approach for repeater placement in large-scale quantum networks

Romtham Sripotchanart, Weisheng Si, Rodrigo Neves Calheiros +2 more

Thanks to the applications such as Quantum Key Distribution and Distributed Quantum Computing, the deployment of quantum networks is gaining great momentum. A major component in quantum networks is repeaters, which are essential for reducing the error rate of qubit transmission for long-distance links. However, repeaters are expensive devices, so minimizing the number of repeaters placed in a quantum network while satisfying performance requirements becomes an important problem. Existing solutions typically solve this problem optimally by formulating an Integer Linear Program (ILP). However, the number of variables in their ILPs is O ( n 2 ) , where n is the number of nodes in a network. This incurs infeasible running time when the network scale is large. To overcome this drawback, this paper proposes to solve the repeater placement problem by two steps, with each step using a linear program of a much smaller scale with O ( n ) variables. Although this solution is not optimal, it dramatically reduces the time complexity, making it practical for large-scale networks. Moreover, it constructs networks that have higher node connectivity than those by existing solutions, since it deploys slightly more number of repeaters into networks. Our extensive experiments on both synthetic and real-world network topologies verified our claims.

Computer Networks•Sep 19, 2024•6 citations

Path selection for quantum repeater networks

Rodney Van Meter, Takahiko Satoh, Thaddeus D. Ladd +2 more

arXiv:1206.5655•Networking Science•Dec 1, 2013•220 citations

Statistical limits for entanglement swapping with semiconductor entangled photon sources

Jingzhong Yang, Michael Zopf, Pengji Li +9 more

Semiconductor quantum dots are promising building blocks for quantum communication applications. Although deterministic, efficient, and coherent emission of entangled photons has been realized, implementing a practical quantum repeater remains outstanding. Here we explore the statistical limits for entanglement swapping with sources of polarization-entangled photons from the commonly used biexciton-exciton cascade. We stress the necessity of tuning the exciton fine structure, and explain why the often observed time evolution of photonic entanglement in quantum dots is not applicable for large quantum networks. We identify the critical, statistically distributed device parameters for entanglement swapping based on two sources. A numerical model for benchmarking the consequences of device fabrication, dynamic tuning techniques, and statistical effects is developed, in order to bring the realization of semiconductor-based quantum networks one step closer to reality.

arXiv:2109.06742•Physical review. B./Physical review. B•Jun 23, 2022•6 citations
Thanks to the applications such as Quantum Key Distribution and Distributed Quantum Computing, the deployment of quantum networks is gaining great momentum. A major component in quantum networks is repeaters, which are essential for reducing the error rate of qubit transmission for long-distance links. However, repeaters are expensive devices, so minimizing the number of repeaters placed in a quantum network while satisfying performance requirements becomes an important problem. Existing solutions typically solve this problem optimally by formulating an Integer Linear Program (ILP). However, the number of variables in their ILPs is O ( n 2 ) , where n is the number of nodes in a network. This incurs infeasible running time when the network scale is large. To overcome this drawback, this paper proposes to solve the repeater placement problem by two steps, with each step using a linear program of a much smaller scale with O ( n ) variables. Although this solution is not optimal, it dramatically reduces the time complexity, making it practical for large-scale networks. Moreover, it constructs networks that have higher node connectivity than those by existing solutions, since it deploys slightly more number of repeaters into networks. Our extensive experiments on both synthetic and real-world network topologies verified our claims.
Semiconductor quantum dots are promising building blocks for quantum communication applications. Although deterministic, efficient, and coherent emission of entangled photons has been realized, implementing a practical quantum repeater remains outstanding. Here we explore the statistical limits for entanglement swapping with sources of polarization-entangled photons from the commonly used biexciton-exciton cascade. We stress the necessity of tuning the exciton fine structure, and explain why the often observed time evolution of photonic entanglement in quantum dots is not applicable for large quantum networks. We identify the critical, statistically distributed device parameters for entanglement swapping based on two sources. A numerical model for benchmarking the consequences of device fabrication, dynamic tuning techniques, and statistical effects is developed, in order to bring the realization of semiconductor-based quantum networks one step closer to reality.