Pith. sign in

REVIEW

Limitations of nearest-neighbour quantum networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.10886 v1 pith:LZCX4RUX submitted 2022-02-22 quant-ph

classification quant-ph
keywords quantumnetworkscommunicationnearest-neighbourlimitationslinesmulti-partitepotential
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum communication research has in recent years shifted to include multi-partite networks for which questions of quantum network routing naturally emerge. To understand the potential for multi-partite routing, we focus on the most promising architectures for future quantum networks - those connecting nodes close to each other. Nearest-neighbour networks such as rings, lines, and grids, have been studied under different communication scenarios to facilitate the sharing of quantum resources, especially in the presence of bottlenecks. We here analyze the potential of nearest-neighbour quantum networks and identify some serious limitations, by demonstrating that rings and lines cannot overcome common bottleneck communication problems.

Discussion (0). Sign in to comment.

Pith tools