Pith. sign in

REVIEW 1 cited by

Path Percolation in Quantum Communication 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 2406.12228 v1 pith:DSVAIR4S submitted 2024-06-18 quant-ph

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

In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, communication channels can be established between them via quantum routing protocols. However, in contrast to classical communication networks, each communication event removes all participating links along the communication path, disrupting the quantum network. Here, we propose a simple model, where randomly selected pairs of nodes communicate through shortest paths. Each time such a path is used, all participating links are eliminated, leading to a correlated percolation process that we call ``path percolation.'' We study path percolation both numerically and analytically and present the phase diagram of the steady states as a function of the rate at which new links are being added to the quantum communication network. As a key result, the steady state is found to be independent from the initial network topology when new link are added randomly between disconnected components. We close by discussing extensions of path percolation and their potential applications.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Finding hypergraph immersion is fixed-parameter tractable

    cs.DM 2024-11 reject novelty 6.0 of 10

    An O(|V(G)|^6) algorithm for hypergraph immersion is claimed, but the proof has a false Mader-type lemma and applies a fixed-parameter theorem to a pattern that grows with the input.

Pith tools