Measurement-based quantum communication

Zwerger, Michael; Briegel, Hans J.; Dür, W.

doi:10.1007/s00340-015-6285-8

Cited by 61 publications

(88 citation statements)

References 66 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The growth and slow decay along the line η 0 = 1 here is regarded as a concrete example of such an advantage invoking the PLOB bound. The slow decay has also been observed for the codes (3,2) and (3,3), although it does not reach the long distances over 1000km (There, the longest distance to surpass the PLOB bound is achieved with rather lower unit transmission, η 0 ∼ 0.85). Therefore, the graphs in Figs.…”

Section: B Other Small-block Codes [(32)(33)(43)]mentioning

confidence: 85%

“…For a sequence of two stations, each transmission of a logical qubit comes with a pair of outcomes i 1 and i 2 . This formally specifies the process having a set of a probability w (2) i1,i2 and logical bit-and-phase errors ǫ (2,γ) i1,i2 with γ ∈ {z, x}. Here, "2" in the superscript indicates the number of total stations, and the last station is Bob's station in our notation.…”

Section: Key Ratementioning

confidence: 99%

“…A clear criterion for this is to surpass the TakeokaGuha-Wilde (TGW) bound [6,7]. This is an upper bound of the secret key rate per optical mode over a pure lossy channel, and given by R TGW = log 2 1 + η 1 − η ,…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Role of syndrome information on a one-way quantum repeater using teleportation-based error correction

et al. 2016

View full text Add to dashboard Cite

We investigate a quantum repeater scheme for quantum key distribution based on the work by Muralidharan et al., Phys. Rev. Lett. 112, 250501 (2014). Our scheme extends that work by making use of error syndrome measurement outcomes available at the repeater stations. We show how to calculate the secret key rates for the case of optimizing the syndrome information, while the known key rate is based on a scenario of coarse-graining the syndrome information. We show that these key rates can surpass the Pirandola-Laurenza-Ottaviani-Banchi bound on secret key rates of direct transmission over lossy bosonic channels.

show abstract

Section: B Other Small-block Codes [(32)(33)(43)]mentioning

confidence: 85%

Section: Key Ratementioning

confidence: 99%

See 1 more Smart Citation

Role of syndrome information on a one-way quantum repeater using teleportation-based error correction

et al. 2016

View full text Add to dashboard Cite

show abstract

“…Bell measurements are typically used to obtain long-range bipartite entanglement, while multi-qubit measurements can be made in order to generate multipartite entanglement; see, e.g., Refs. [65][66][67][68][69][70][71][72][73][74][75][76].…”

Section: Network Architectures and Entanglement Distribution Protocolsmentioning

confidence: 99%

Practical figures of merit and thresholds for entanglement distribution in quantum networks

Khatri

Matyas

Siddiqui

et al. 2019

Phys. Rev. Research

View full text Add to dashboard Cite

Before global-scale quantum networks become operational, it is important to consider how to evaluate their performance so that they can be suitably built to achieve the desired performance. In this work, we consider three figures of merit for the performance of a quantum network: the average global connection time, the average point-to-point connection time, and the average largest entanglement cluster size. These three quantities are based on the generation of elementary links in a quantum network, which is a crucial initial requirement that must be met before any long-range entanglement distribution can be achieved. We evaluate these figures of merit for a particular class of quantum repeater protocols consisting of repeat-until-success elementary link generation along with entanglement swapping at intermediate nodes in order to achieve long-range entanglement. We obtain lower and upper bounds on these three quantities, which lead to requirements on quantum memory coherence times and other aspects of quantum network implementations. Our bounds are based solely on the inherently probabilistic nature of elementary link generation in quantum networks, and they apply to networks with arbitrary topology. CONTENTS

show abstract

“…This implies that the corresponding qudits are actually not required, but a state of reduced size suffices. The initial states of a particular computation, in our case, the noisy states to be purified, are coupled to the resource state via local Bell measurements, and the protocol is subsequently implemented [18]. The result of the Pauli measurements can be determined from the results of the incoupling Bell measurements.…”

Section: Measurement-based Implementation Of Quantum Operationsmentioning

confidence: 99%

Efficient entanglement purification protocols for d -level systems

Miguel-Ramiro

Dür

2018

Phys. Rev. A

Self Cite

View full text Add to dashboard Cite

We introduce entanglement purification protocols for d-level systems (qudits) with improved efficiency as compared to previous protocols. While we focus on protocols for bipartite systems, we also propose generalizations to multi-partite qudit systems. The schemes we introduce include recurrence protocols that operate on two copies, as well as hashing protocols that operate on large ensembles. We analyze properties of the protocols with respect to minimal required fidelity and yield, and study their performance in the presence of noise and imperfections. We determine error thresholds and study the dependence on local dimension. We find that our schemes do not only outperform previous approaches, but also show an improved robustness and better efficiency with increasing dimension. While error thresholds for different system sizes are not directly comparable, our results nevertheless suggest that quantum information processing using qudits, in particular for long-distance quantum communication, may offer an advantage over approaches based on qubit systems.

show abstract

Measurement-based quantum communication

Cited by 61 publications

References 66 publications

Role of syndrome information on a one-way quantum repeater using teleportation-based error correction

Role of syndrome information on a one-way quantum repeater using teleportation-based error correction

Practical figures of merit and thresholds for entanglement distribution in quantum networks

Efficient entanglement purification protocols for d -level systems

Contact Info

Product

Resources

About