Entanglement Percolation in Quantum Networks

Antonio Acin; J. Ignacio Cirac; Maciej Lewenstein

RECORD

Entanglement Percolation in Quantum Networks

Antonio Acin, J. Ignacio Cirac, Maciej Lewenstein

Quantum Physics · Submitted 19 Dec 2006

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We relate the problem of establishing maximally entangled states between nodes to classical percolation in statistical mechanics, and demonstrate that quantum phase transitions can be used to optimize the operation of quantum networks.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗

Cite ▾

Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,872 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.07 · human participants 0.02 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.08 · compares with prior results 0.13 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; show every role.

Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons. Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure way, and to communicate more efficiently than in classical networks. These goals can be achieved, for instance, via teleportation. Here we show that the design of efficient quantum communication protocols in quantum networks involves intriguing quantum phenomena, depending both on the way the nodes are displayed, and the entanglement between them. These phenomena can be employed to design protocols which overcome the exponential decrease of signals with the number of nodes. We relate the problem of establishing maximally entangled states between nodes to classical percolation in statistical mechanics, and demonstrate that quantum phase transitions can be used to optimize the operation of quantum networks.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#	sentence	role	the authors' own work	states the main conclusion	strength
s0	Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons.	background 1.00	0.05	0.02	asserted 1.00
s1	Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure way, and to communicate more efficiently than in classical networks.	background 1.00	0.04	0.03	asserted 0.78
s2	These goals can be achieved, for instance, via teleportation.	background 0.98	0.05	0.03	hedged possibility 0.54
s3	Here we show that the design of efficient quantum communication protocols in quantum networks involves intriguing quantum phenomena, depending both on the way the nodes are displayed, and the entanglement between them.	contribution 0.73	0.73	0.18	asserted 1.00
s4	These phenomena can be employed to design protocols which overcome the exponential decrease of signals with the number of nodes.	result 0.63	0.62	0.22	hedged possibility 0.62
s5	We relate the problem of establishing maximally entangled states between nodes to classical percolation in statistical mechanics, and demonstrate that quantum phase transitions can be used to optimize the operation of quantum networks.	contribution 0.81	0.93	0.79	asserted 1.00

What kind of paper the classifier reports this is: theoretical result 0.94 · evidence from proof or derivation 0.78.

What was examined, and what was not

sources read

arXiv listing abstract v1

not examined

full text
figures and tables
references and citing sentences
relations to other papers

levels run

P abstract

not run

S sections
T body sentences
C citations
R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper

Original abstract

Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons. Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure way, and to communicate more efficiently than in classical networks. These goals can be achieved, for instance, via teleportation. Here we show that the design of efficient quantum communication protocols in quantum networks involves intriguing quantum phenomena, depending both on the way the nodes are displayed, and the entanglement between them. These phenomena can be employed to design protocols which overcome the exponential decrease of signals with the number of nodes. We relate the problem of establishing maximally entangled states between nodes to classical percolation in statistical mechanics, and demonstrate that quantum phase transitions can be used to optimize the operation of quantum networks.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

6 arXiv papers cite this in 17 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 7 sentences without a confident label

Builds on it 2 papers

In this paper, we extend the models previously studied in [ref] to allow for an arbitrary mixed state between adjacent nodes.

Assisted Entanglement Distillation · Introduction · 1.00
In this chapter, we continue the theoretical analysis of this problem by extending the models previously studied in [ref] to allow for an arbitrary mixed state between adjacent nodes.

Multiparty quantum protocols for assisted entanglement distillation · Introduction · 0.99

Cites it as support 1 paper

In fact, as was shown in [ref] , no measurement strategy can keep the SCP between Alice and Bob from decreasing exponentially with the number of repeaters, making them useless for establishing entanglement over long distances.

Multiparty quantum protocols for assisted entanglement distillation · Motivation · 0.99

Cites it as background 5 papers

This scenario put forward in [ref] , an alternative to quantum repeaters [ref] is closely related to entanglement percolation [ref] , and may be crucial to increase the distance of quantum communication beyond the present capabilities which are now of order of hundred kilometers.

Long-distance quantum communication over noisy networks without long-time quantum memory · Introduction · 0.87
Entanglement percolation is described in detail in several sources [ref] .

The role of local and global geometry in quantum entanglement percolation · Entanglement Percolation · 1.00
Previous work on entanglement distribution in dimension greater than one considered either pure states [ref] , or certain mixed states of rank two and three [ref] .

Distribution of entanglement in networks of bi-partite full-rank mixed states · Introduction · 0.91

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.