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

Frontiers in Optics

Ultrafast and Fault-Tolerant Quantum Communication over Long Distances

Liang Jiang, Sreraman Muralidharan, Jungsang Kim, Norbert Lütkenhaus, Mikhail D. Lukin

Published Jan 1, 2014• 10 citations
Publisher

Abstract

We investigate quantum repeaters using small encoding blocks to correct both operational and photon loss errors, which can send quantum information over long distances at a rate only limited by local gate speed.
DOI
10.1364/fio.2014.ftu1a.1

Related papers

Fault-tolerant quantum repeaters for long-distance quantum communication based on quantum dots

N. Cody Jones, Kristiaan De Greve, Y. Yamamoto

We present a proposal for a quantum repeater which uses fault-tolerant quantum error correction to overcome decoherence limitations to creating long-distance entanglement between quantum dot spin qubits.

Conference on Lasers and Electro-Optics•Jan 1, 2012•0 citations

Ultrafast Quantum Repeaters for Long Distance Quantum Communication

Liangxing Jiang

We investigate and optimize three generations of quantum repeater protocols for long distance quantum communication, which can overcome the major challenges of photon loss and operational imperfections.

•Jan 1, 2014•0 citations

Ultrafast Fault-Tolerant Long-Distance Quantum Communication with Static Linear Optics

Fabian Ewert, Peter van Loock

We present a linear-optics-only one-way quantum communication system based on quantum error correction, investigate its behaviour in the presence of multiple types of errors and show that it enables fast and faithful communication over thousands of kilometers.

Quantum Information and Measurement (QIM)•Jan 1, 2017•2 citations

Practical repeaters for ultralong-distance quantum communication

Scott E. Vinay, Pieter Kok

Quantum repeaters enable long-range quantum communication in the presence of attenuation. Here we propose a method to construct a robust quantum repeater network using only existing technology. We combine the ideas of brokered graph-state construction with double-heralded entanglement generation to form a system that is able to perform all parts of the procedure in a way that is highly tolerant to photon loss and imperfections in detectors. We show that when used in quantum key distribution this leads to secure kilohertz bit rates over intercontinental distances.

arXiv:1607.08140•Physical Review A•May 18, 2017•41 citations

Ultrafast and Fault-Tolerant Quantum Communication across Long Distances

Sreraman Muralidharan, Jungsang Kim, Norbert Lütkenhaus +2 more

Quantum repeaters (QRs) provide a way of enabling long distance quantum communication by establishing entangled qubits between remote locations. In this Letter, we investigate a new approach to QRs in which quantum information can be faithfully transmitted via a noisy channel without the use of long distance teleportation, thus eliminating the need to establish remote entangled links. Our approach makes use of small encoding blocks to fault-tolerantly correct both operational and photon loss errors. We describe a way to optimize the resource requirement for these QRs with the aim of the generation of a secure key. Numerical calculations indicate that the number of quantum memory bits at each repeater station required for the generation of one secure key has favorable polylogarithmic scaling with the distance across which the communication is desired.

arXiv:1310.5291•Physical Review Letters•Jun 27, 2014•291 citations

Towards a fault-tolerant one-way quantum repeater

Mor Ruiz, Maria Flors Mor-Ruiz

Quantum communication can enable new features that are provably impossible with classical communication alone. However, the optical fibers used to send the quantum information are inherently lossy. To overcome the exponential losses over distance so-called quantum repeaters are needed to amplify the signal. As opposed to memory-based approaches, the third generation of quantum repeaters, also called one-way quantum repeaters do not require two-way communication thus enabling very high communication rates. In particular, the one-way quantum repeater based on photonic tree states proposed by Borregaard et al. (2019) realizes this task with a very modest amount of resources. Nevertheless, the method considered is susceptible to operational errors. In this work, we propose the use of code concatenation of a stabilizer code and the tree code, so that by measuring stabilizers of the stabilizer code and applying the syndrome corrections we can achieve a fault-tolerant one-way quantum repeater. In order to do so, we present a detailed protocol that uses the 5-qubit code. Moreover, we develop the first fully general simulation framework for studying the performance of tree-code based one-way quantum repeater chains, which in this thesis is used to perform an analysis of the proposed protocol. We find that the code-concatenation protocol under consideration has a similar tolerance against operational errors to the protocol proposed by Borregaard et al. (2019). Unfortunately, we are not able to draw a distinction between the tolerance of the two approaches. We do however suggest modified protocols that may provide fault tolerance. Studying these is beyond the scope of this thesis.

•Jan 1, 2021•0 citations
Quantum repeaters enable long-range quantum communication in the presence of attenuation. Here we propose a method to construct a robust quantum repeater network using only existing technology. We combine the ideas of brokered graph-state construction with double-heralded entanglement generation to form a system that is able to perform all parts of the procedure in a way that is highly tolerant to photon loss and imperfections in detectors. We show that when used in quantum key distribution this leads to secure kilohertz bit rates over intercontinental distances.
Quantum repeaters (QRs) provide a way of enabling long distance quantum communication by establishing entangled qubits between remote locations. In this Letter, we investigate a new approach to QRs in which quantum information can be faithfully transmitted via a noisy channel without the use of long distance teleportation, thus eliminating the need to establish remote entangled links. Our approach makes use of small encoding blocks to fault-tolerantly correct both operational and photon loss errors. We describe a way to optimize the resource requirement for these QRs with the aim of the generation of a secure key. Numerical calculations indicate that the number of quantum memory bits at each repeater station required for the generation of one secure key has favorable polylogarithmic scaling with the distance across which the communication is desired.
Quantum communication can enable new features that are provably impossible with classical communication alone. However, the optical fibers used to send the quantum information are inherently lossy. To overcome the exponential losses over distance so-called quantum repeaters are needed to amplify the signal. As opposed to memory-based approaches, the third generation of quantum repeaters, also called one-way quantum repeaters do not require two-way communication thus enabling very high communication rates. In particular, the one-way quantum repeater based on photonic tree states proposed by Borregaard et al. (2019) realizes this task with a very modest amount of resources. Nevertheless, the method considered is susceptible to operational errors. In this work, we propose the use of code concatenation of a stabilizer code and the tree code, so that by measuring stabilizers of the stabilizer code and applying the syndrome corrections we can achieve a fault-tolerant one-way quantum repeater. In order to do so, we present a detailed protocol that uses the 5-qubit code. Moreover, we develop the first fully general simulation framework for studying the performance of tree-code based one-way quantum repeater chains, which in this thesis is used to perform an analysis of the proposed protocol. We find that the code-concatenation protocol under consideration has a similar tolerance against operational errors to the protocol proposed by Borregaard et al. (2019). Unfortunately, we are not able to draw a distinction between the tolerance of the two approaches. We do however suggest modified protocols that may provide fault tolerance. Studying these is beyond the scope of this thesis.