2014
DOI: 10.1103/physreva.90.032306
|View full text |Cite
|
Sign up to set email alerts
|

Repeat-until-success quantum repeaters

Abstract: We propose a repeat-until-success protocol to improve the performance of probabilistic quantum repeaters. Quantum repeaters rely on passive static linear optics elements and photodetectors to perform Bell-state measurements (BSMs). Conventionally, the success rate of these BSMs cannot exceed 50%, which is an impediment for entanglement swapping between distant quantum memories. Every time that a BSM fails, entanglement needs to be re-distributed between the corresponding memories in the repeater link. The key … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
19
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 21 publications
(19 citation statements)
references
References 36 publications
0
19
0
Order By: Relevance
“…Specifically, the state represented by a graph can be created by initializing all qubits to the state |+ = (|0 + |1 )/ √ 2 and successively performing CZ gates between all pairs of qubits connected by an edge of the graph. This work has attracted a great deal of attention [17][18][19][20][21] due to its advantages over atomicmemory based repeaters, notably the all-photonic construction that avoids coherence time limitations, the resilience against photon loss, and the elimination of longdistance heralding [16]. These attractive features position quantum repeaters, and consequently long-distance quantum communication, as near-term, much more readily feasible technology compared to quantum computing [19,22].…”
Section: Introductionmentioning
confidence: 99%
“…Specifically, the state represented by a graph can be created by initializing all qubits to the state |+ = (|0 + |1 )/ √ 2 and successively performing CZ gates between all pairs of qubits connected by an edge of the graph. This work has attracted a great deal of attention [17][18][19][20][21] due to its advantages over atomicmemory based repeaters, notably the all-photonic construction that avoids coherence time limitations, the resilience against photon loss, and the elimination of longdistance heralding [16]. These attractive features position quantum repeaters, and consequently long-distance quantum communication, as near-term, much more readily feasible technology compared to quantum computing [19,22].…”
Section: Introductionmentioning
confidence: 99%
“…This approach presents the resilience against photon loss, and also avoids the coherence time limitations of quantum memories and the longdistance heralding requirement. These features have led to all-photonic quantum repeaters attracting much attention recently [25][26][27][28][29][30].…”
mentioning
confidence: 99%
“…The first generation of quantum repeaters may rely on probabilistic approaches to BSMs, which can be implemented using linear optics devices [21][22][23][24]. These systems expect to cover moderately long distances up to around 1000 km without the need for purification.…”
Section: Introductionmentioning
confidence: 99%