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

International Conference on Quantum Communications, Networking, and Computing (QCNC)

Quantum key distribution over an encoded repeater chain with sequential swapping

Javier Rey-Domínguez, Mohsen Razavi

Published Mar 31, 2025• 3 citations
Publisher

Abstract

Most current proposals for entanglement distribution networks assume a connection-oriented approach, where resources along a path may be reserved before the start of the session. This strategy, however, does not match the common practice in the existing infrastructure for the Internet, which relies on connectionless packet switching. In our work, we study how a hop-by-hop teleportation can be used to perform entanglement distribution across a network without any prior resource reservation. Specifically, we investigate the attainable secret key generation rate between two users employing this protocol in a repeater chain setup. We analyze this scenario for deterministic quantum repeaters with and without encoding, where we consider a three-qubit repetition code for error detection in the former case. Typical models for the operational errors in these protocols are considered. Our results suggest that the usage of quantum error detection schemes will enable trust-free secret key distribution at distances of interest.

DOI
10.1109/qcnc64685.2025.00058

Related papers

Quantum Key Distribution Over Quantum Repeaters with Encoding: Using Error Detection as an Effective Postselection Tool

Yumang Jing, Daniel Alsina, Mohsen Razavi

We propose a postselection technique, based on quantum error detection, for quantum key distribution (QKD) systems that run over quantum repeaters with encoding. In such repeaters, quantum error-correction techniques are used for entanglement distillation. By developing an analytical approach to study such quantum repeaters, we show that, in the context of QKD, it is often more efficient to use the error-detection, rather than the error-correction, capability of the underlying code to sift out cases where an error has been detected. We implement our technique for three-qubit repetition codes by modeling different sources of error in crucial components of the system. We then investigate in detail the impact of such imperfections on the secret key generation rate of the QKD system, and how one can use the information obtained during entanglement swapping and decoding stages to maximize the rate. For benchmarking purposes, we specify the maximum allowed error rates in different components of the setup below which positive key rates can be obtained.

arXiv:2007.06376•Physical Review Applied•Dec 10, 2020•24 citations

Rethinking quantum repeaters: balancing scalability, feasibility, and interoperability

Javier Rey-Domínguez, Mohsen Razavi

Abstract Quantum repeaters are enabling technologies for long-distance quantum communications. Despite the significant progress in the field, we still not only face implementation challenges but also need theoretical solutions that better meet all the desired design criteria. Preliminary solutions for quantum repeaters often do not scale well, while the most advanced solutions are so demanding that their implementation may take a long time and require substantial changes to current telecom infrastructure. In this paper, we propose a compromise solution that is not only scalable in the mid-to-long term but also adapts well to the realities of the backbone networks in the current Internet infrastructure. The key ideas behind our solution are twofold. First, we use a hop-by-hop approach to entanglement swapping, allowing our solution to benefit from the same features as packet-switched networks. Second, we employ simple error detection, rather than more complicated error correction, techniques to make our solution sufficiently scalable in the face of errors. This is achieved without requiring overly demanding specifications for the physical devices needed in the network. We test this idea in a quantum key distribution (QKD) setting over a repeater chain and demonstrate how trust-free continental QKD can be achieved through several stages of development.

arXiv:2508.16310•Quantum Science and Technology•Jul 28, 2026•1 citation

Quantum Key Distribution Over Quantum Repeaters with Encoding: Using Error Detection as an Effective Postselection Tool

Jing, Y, Alsina Leal, D, Mohsen Razavi

We propose a postselection technique, based on quantum error detection, for quantum key distribution (QKD) systems that run over quantum repeaters with encoding. In such repeaters, quantum error-correction techniques are used for entanglement distillation. By developing an analytical approach to study such quantum repeaters, we show that, in the context of QKD, it is often more efficient to use the error-detection, rather than the error-correction, capability of the underlying code to sift out cases where an error has been detected. We implement our technique for three-qubit repetition codes by modeling different sources of error in crucial components of the system. We then investigate in detail the impact of such imperfections on the secret key generation rate of the QKD system, and how one can use the information obtained during entanglement swapping and decoding stages to maximize the rate. For benchmarking purposes, we specify the maximum allowed error rates in different components of the setup below which positive key rates can be obtained.

•Dec 10, 2020•16 citations

Simple Efficient Decoders for Quantum Key Distribution Over Quantum Repeaters with Encoding

Yumang Jing, Mohsen Razavi

We study the implementation of quantum-key-distribution (QKD) systems over quantum-repeater infrastructures. We particularly consider quantum repeaters with encoding and compare them with probabilistic quantum repeaters. To that end, we propose two decoder structures for encoded repeaters that not only aid system performance but also make the implementation aspects easier by removing two-qubit gates from the QKD decoder. By developing several scalable numerical and analytical techniques, we then identify the resilience of the setup to various sources of error in gates, measurement modules, and initialization of the setup. We apply our techniques to three- and five-qubit repetition codes and obtain the normalized secret key generation rate per memory per second for encoded and probabilistic quantum repeaters. We quantify the regimes of operation, where one class of repeater outperforms the other, and find that there are feasible regimes of operation where encoded repeaters---based on simple three-qubit repetition codes---could offer practical advantages.

arXiv:2012.13011•Physical Review Applied•Apr 15, 2021•12 citations

Scalable entanglement distribution using encoded hybrid repeater chains

Stav Haldar, Saikat Guha, Don Towsley +1 more

Long-distance entanglement distribution requires error correction protocols to compensate for qubit decoherence in quantum memories and noise introduced during entanglement swapping. We argue that repeater chains with error-correction capabilities should exploit more than one physical platform, combining the complementary strengths of different quantum memory technologies into a single hybrid repeater architecture. An important constituent of such an architecture is a hybrid repeater which combines type-1 memories, characterized by fast entanglement generation rates and suitability for multiplexing, and type-2 memories that offer long coherence times and low two-qubit gate error rates. Taking the resource-intensive nature of hybrid nodes into account, we propose and analyze repeater chains in which only a subset of nodes need to be hybrid, while the remaining nodes are simpler first-generation repeaters with no error-correction capability. Through detailed Monte Carlo simulations of fault-tolerant encoded repeater chain protocols based on the three-qubit phase-flip repetition code, the $[[7,1,3]]$ Steane code, and the $[[9,1,3]]$ Shor code, we demonstrate that these hybrid architectures outperform pure architectures based on a single memory platform in terms of end-to-end entanglement distribution rate. In our study we develop a full circuit-level noise model of our architectures and examine the impact of an imperfect interface between the two platforms on our hybrid architecture. We also develop a modified version of the swap-as-soon-as-possible policy with multiplexing, more suited to our architecture where some nodes perform error-correction while others do not. This modified policy significantly reduces the information storage time in memory qubits relative to the previously considered swap policies in encoded repeater chains.

quant-pharXiv:2609.19783•Sep 18, 2026•0 citations

Simple efficient decoders for quantum key distribution over quantum repeaters with encoding

Jing, Y, Mohsen Razavi

We study the implementation of quantum-key-distribution (QKD) systems over quantum-repeater infrastructures. We particularly consider quantum repeaters with encoding and compare them with probabilistic quantum repeaters. To that end, we propose two decoder structures for encoded repeaters that not only aid system performance but also make the implementation aspects easier by removing two-qubit gates from the QKD decoder. By developing several scalable numerical and analytical techniques, we then identify the resilience of the setup to various sources of error in gates, measurement modules, and initialization of the setup. We apply our techniques to three- and five-qubit repetition codes and obtain the normalized secret key generation rate per memory per second for encoded and probabilistic quantum repeaters. We quantify the regimes of operation, where one class of repeater outperforms the other, and find that there are feasible regimes of operation where encoded repeaters—based on simple three-qubit repetition codes—could offer practical advantages.

•Apr 15, 2021•9 citations
Most current proposals for entanglement distribution networks assume a connection-oriented approach, where resources along a path may be reserved before the start of the session. This strategy, however, does not match the common practice in the existing infrastructure for the Internet, which relies on connectionless packet switching. In our work, we study how a hop-by-hop teleportation can be used to perform entanglement distribution across a network without any prior resource reservation. Specifically, we investigate the attainable secret key generation rate between two users employing this protocol in a repeater chain setup. We analyze this scenario for deterministic quantum repeaters with and without encoding, where we consider a three-qubit repetition code for error detection in the former case. Typical models for the operational errors in these protocols are considered. Our results suggest that the usage of quantum error detection schemes will enable trust-free secret key distribution at distances of interest.
We propose a postselection technique, based on quantum error detection, for quantum key distribution (QKD) systems that run over quantum repeaters with encoding. In such repeaters, quantum error-correction techniques are used for entanglement distillation. By developing an analytical approach to study such quantum repeaters, we show that, in the context of QKD, it is often more efficient to use the error-detection, rather than the error-correction, capability of the underlying code to sift out cases where an error has been detected. We implement our technique for three-qubit repetition codes by modeling different sources of error in crucial components of the system. We then investigate in detail the impact of such imperfections on the secret key generation rate of the QKD system, and how one can use the information obtained during entanglement swapping and decoding stages to maximize the rate. For benchmarking purposes, we specify the maximum allowed error rates in different components of the setup below which positive key rates can be obtained.
Abstract Quantum repeaters are enabling technologies for long-distance quantum communications. Despite the significant progress in the field, we still not only face implementation challenges but also need theoretical solutions that better meet all the desired design criteria. Preliminary solutions for quantum repeaters often do not scale well, while the most advanced solutions are so demanding that their implementation may take a long time and require substantial changes to current telecom infrastructure. In this paper, we propose a compromise solution that is not only scalable in the mid-to-long term but also adapts well to the realities of the backbone networks in the current Internet infrastructure. The key ideas behind our solution are twofold. First, we use a hop-by-hop approach to entanglement swapping, allowing our solution to benefit from the same features as packet-switched networks. Second, we employ simple error detection, rather than more complicated error correction, techniques to make our solution sufficiently scalable in the face of errors. This is achieved without requiring overly demanding specifications for the physical devices needed in the network. We test this idea in a quantum key distribution (QKD) setting over a repeater chain and demonstrate how trust-free continental QKD can be achieved through several stages of development.
We propose a postselection technique, based on quantum error detection, for quantum key distribution (QKD) systems that run over quantum repeaters with encoding. In such repeaters, quantum error-correction techniques are used for entanglement distillation. By developing an analytical approach to study such quantum repeaters, we show that, in the context of QKD, it is often more efficient to use the error-detection, rather than the error-correction, capability of the underlying code to sift out cases where an error has been detected. We implement our technique for three-qubit repetition codes by modeling different sources of error in crucial components of the system. We then investigate in detail the impact of such imperfections on the secret key generation rate of the QKD system, and how one can use the information obtained during entanglement swapping and decoding stages to maximize the rate. For benchmarking purposes, we specify the maximum allowed error rates in different components of the setup below which positive key rates can be obtained.
We study the implementation of quantum-key-distribution (QKD) systems over quantum-repeater infrastructures. We particularly consider quantum repeaters with encoding and compare them with probabilistic quantum repeaters. To that end, we propose two decoder structures for encoded repeaters that not only aid system performance but also make the implementation aspects easier by removing two-qubit gates from the QKD decoder. By developing several scalable numerical and analytical techniques, we then identify the resilience of the setup to various sources of error in gates, measurement modules, and initialization of the setup. We apply our techniques to three- and five-qubit repetition codes and obtain the normalized secret key generation rate per memory per second for encoded and probabilistic quantum repeaters. We quantify the regimes of operation, where one class of repeater outperforms the other, and find that there are feasible regimes of operation where encoded repeaters---based on simple three-qubit repetition codes---could offer practical advantages.
Long-distance entanglement distribution requires error correction protocols to compensate for qubit decoherence in quantum memories and noise introduced during entanglement swapping. We argue that repeater chains with error-correction capabilities should exploit more than one physical platform, combining the complementary strengths of different quantum memory technologies into a single hybrid repeater architecture. An important constituent of such an architecture is a hybrid repeater which combines type-1 memories, characterized by fast entanglement generation rates and suitability for multiplexing, and type-2 memories that offer long coherence times and low two-qubit gate error rates. Taking the resource-intensive nature of hybrid nodes into account, we propose and analyze repeater chains in which only a subset of nodes need to be hybrid, while the remaining nodes are simpler first-generation repeaters with no error-correction capability. Through detailed Monte Carlo simulations of fault-tolerant encoded repeater chain protocols based on the three-qubit phase-flip repetition code, the [[7,1,3]][[7,1,3]][[7,1,3]] Steane code, and the [[9,1,3]][[9,1,3]][[9,1,3]] Shor code, we demonstrate that these hybrid architectures outperform pure architectures based on a single memory platform in terms of end-to-end entanglement distribution rate. In our study we develop a full circuit-level noise model of our architectures and examine the impact of an imperfect interface between the two platforms on our hybrid architecture. We also develop a modified version of the swap-as-soon-as-possible policy with multiplexing, more suited to our architecture where some nodes perform error-correction while others do not. This modified policy significantly reduces the information storage time in memory qubits relative to the previously considered swap policies in encoded repeater chains.
We study the implementation of quantum-key-distribution (QKD) systems over quantum-repeater infrastructures. We particularly consider quantum repeaters with encoding and compare them with probabilistic quantum repeaters. To that end, we propose two decoder structures for encoded repeaters that not only aid system performance but also make the implementation aspects easier by removing two-qubit gates from the QKD decoder. By developing several scalable numerical and analytical techniques, we then identify the resilience of the setup to various sources of error in gates, measurement modules, and initialization of the setup. We apply our techniques to three- and five-qubit repetition codes and obtain the normalized secret key generation rate per memory per second for encoded and probabilistic quantum repeaters. We quantify the regimes of operation, where one class of repeater outperforms the other, and find that there are feasible regimes of operation where encoded repeaters—based on simple three-qubit repetition codes—could offer practical advantages.