English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Before global-scale quantum networks become operational, it is important toconsider how to evaluate their performance so that they can be built to achievethe desired performance. We propose two practical figures of merit for theperformance of a quantum network: the average connection time and the averagelargest entanglement cluster size. These quantities are based on the generationof elementary links in a quantum network, which is a crucial initialrequirement that must be met before any long-range entanglement distributioncan be achieved and is inherently probabilistic with current implementations.We obtain bounds on these figures of merit for a particular class of quantumrepeater protocols consisting of repeat-until-success elementary linkgeneration followed by joining measurements at intermediate nodes that extendthe entanglement range. Our results lead to requirements on quantum memorycoherence times, requirements on repeater chain lengths in order to surpass therepeaterless rate limit, and requirements on other aspects of quantum networkimplementations. These requirements are based solely on the inherentlyprobabilistic nature of elementary link generation in quantum networks, andthey apply to networks with arbitrary topology.

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