Entanglement percolation in quantum networks
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
It is possible to tune the amount of entanglement between two nodes in such a way that it equals the probability to have a link in classical Erdos-Renyi graphs.
“it has been shown that it is possible to tune the amount of entanglement between two nodes in such a way that it equals the probability to have a link in (classical) Erdos -Renyi graphs 6 .”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
The paper’s bond-percolation discussion (section labelled Abstract; page unavailable) says that converting an entangled state to a singlet establishes a link with probability equal to the singlet-conversion probability. But it studies probabilistic links on regular lattices, not Erdős–Rényi graphs, so the graph-specific attribution is unsupported. (LLM, conf=0.88)
Experimental — accuracy not yet measuredEven the classical network describing a quantum system can exhibit complex features.
“even the classical network describing a quantum system can exhibit complex features”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
The paper says that quantum networks with simple, regular geometries can show “very rich and intriguing behaviour” (section labeled Abstract; page unavailable). It relates that behaviour to entanglement and percolation, but does not establish that the classical network describing the quantum system itself has complex features. (LLM, conf=0.79)
Experimental — accuracy not yet measuredNovel quantum induced effects have been predicted in random graphs where edges represent entangled links.
“Novel quantum induced effects have been predicted in random graphs -where edges represent entangled links”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
The paper’s Abstract (page unavailable) predicts novel entanglement-percolation effects in networks whose connected nodes share entangled states. But it specifies that the networks studied have regularly arranged nodes, including lattices; it does not describe the underlying networks as random graphs. (LLM, conf=0.88)
Experimental — accuracy not yet measuredComplex network methods have successfully been applied to transport and entanglement models.
“Complex network methods have successfully been applied to transport and entanglement models”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
The paper’s Abstract applies percolation concepts to entanglement in quantum networks and reports improved quantum-communication protocols. It does not establish the separate claim about applications to transport models. (LLM, conf=0.84)
Experimental — accuracy not yet measuredIn the case of qubits, the probability of having an entangled path with infinite length is unity.
“in the case of qubits, it has been shown that the probability of having an entangled path with in fi nite length -i.e., an in fi nite sequence of entangled states connecting an in fi nite number of qubits -is unity.”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
The passage labeled Abstract (page unavailable) says that, for two-dimensional lattices of qubits, the probability of an infinitely connected entangled path is unity over a continuous interval of entanglement values. The claim omits those conditions and presents the result as applying to qubits generally; the same passage says the probability is zero for product states. (LLM, conf=0.88)
Experimental — accuracy not yet measured
If each link attempts to convert its state to the maximally entangled one (p=1/2) through LOCC, the optimal probability of successful conversion is exactly p.
“If each link, i.e., each entangled pair, attempts to convert its state to the maximally entangled one ( p = 1/2) through local operations and classical communication (LOCC), the optimal probability of successful conversion is exactly p .”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
The passage on classical entanglement percolation (section labeled Abstract; page unavailable) says that each pair can locally convert its state to a singlet with an optimal success probability. It denotes that probability by p_ok and gives p_ok = min(1, 2(1−l₁)); it does not establish that the probability equals the p=1/2 used in the citing sentence to describe the maximally entangled target. (LLM, conf=0.85)
Experimental — accuracy not yet measuredIn the case of regular lattices, the probability p_opt to establish a perfect quantum channel between the nodes can be mapped to the probability of distributing links among each pair of nodes in the lattice.
“in the case of regular lattices, it has been shown that the probability p opt to establish a perfect quantum channel between the nodes can be mapped to the probability of distributing links among each pair of nodes in the lattice 6”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
Quantum networks based on entangled states are used in secure quantum communication systems.
“The fi rst consists of quantum systems whose connections are represented by entangled states 6,33,34 . These quantum networks are used in secure quantum communication systems.”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
The fraction of existing entangled states converted to maximally entangled ones by LOCC corresponds to the probability of having a link between nodes in the corresponding classical random network.
“It follows that the fraction of existing entangled states converted to maximally entangled ones by LOCC corresponds to the probability of having a link between nodes in the corresponding classical random network 6 .”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
Certain quantum systems have been shown to exhibit complex features related to classical systems, as well as novel mechanisms and principles that interrelate complex features in quantum systems.
“Certain quantum systems have been shown to indeed exhibit complex features related to classical systems, as well as novel mechanisms and principles that interrelate complex features in quantum systems 6 -12,32 .”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
Acin, Cirac, and Lewenstein formulated an extension of the classical random graph picture to the quantum realm by replacing each link with an entangled pair of particles.
“Acin, Cirac, and Lewenstein 6 formulated an elegant extension of this picture to the quantum realm by replacing each link with an entangled pair of particles”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
Classical entanglement percolation (CEP) is not optimal, in general, to generate maximally entangled states; it is not even asymptotically optimal for two-dimensional lattices.
“local measurements based on this approach, called classical entanglement percolation (CEP), are not optimal, in general, to generate maximally entangled states: CEP is not even asymptotically optimal for two-dimensional lattices”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
For product states, the probability of having an entangled path with infinite length is zero, denoting a sharp transition between the entangled and product-state scenarios.
“However, for product states this probability is zero, denoting the existence of a sharp transition between these two scenarios.”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
Rapid experimental progress has pushed quantum computing and communication devices into truly data-intensive domains.
“Rapid experimental progress has pushed quantum computing and communication devices into truly data-intensive domains”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
The Abstract discusses quantum-network protocols and describes quantum networks as a basis for future communication. It does not say that rapid experimental progress has moved quantum computing or communication devices into data-intensive domains; searches for experimental progress and data complexity found no passage addressing that claim. (LLM, conf=0.73)
Experimental — accuracy not yet measuredIt is possible to obtain, with probability approaching unity, a quantum state with the topology of any finite subgraph for N approaching infinity and z = -2.
“The striking result is that it is possible to obtain, with probability approaching unity, a quantum state with the topology of any fi nite subgraph for N approaching in fi nity and z = -2.”
From Complex networks from classical to quantum (2019) · cites this paper as [6]
The paper discusses entanglement paths in two-dimensional lattices and says their probability can be unity in an infinite network (section labeled Abstract; page unavailable). Our copy does not address obtaining a quantum state with the topology of any finite subgraph, or a condition z = -2; searches for those terms and paraphrases found no such result. (LLM, conf=0.76)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
<i>Quantum Computation and Quantum Information</i>
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895 · see citing works
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 20,449 · see citing works
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703 · see citing works
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777 · cited 1× · see citing works
“Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure way [2, 3], and to communicate more efficiently than in classical networks [4].”
BackgroundEntanglement of Formation of an Arbitrary State of Two Qubits
Wootters, W. K. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.2245 · Cited by 8,290 · cited 1× · see citing works
“In this limit, the so-called concur-rence [24], another measure of entanglement, decreases exponentially with the number of repeaters, unless the connecting states are maximally entangled (see Meth-ods).”
BackgroundA scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880 · cited 1× · see citing works
“[1, 8, 9, 10, 11, 12, 13, 14]), where different nodes are entangled, leading to quantum correlations which can be exploited by performing local measurements in each node.”
BackgroundSubir Sachdev, A. (2000) · Cambridge University Press eBooks · doi:10.1017/cbo9780511622540 · Cited by 3,675 · see citing works
Long-distance quantum communication with atomic ensembles and linear optics
Duan, L.-M., Lukin, M. D., Cirac, J. I., & Zoller, P. (2001) · Nature · doi:10.1038/35106500 · Cited by 3,576 · cited 1× · see citing works
“The future of quantum communication will be based on quantum networks (cf. [1, 8, 9, 10, 11, 12, 13, 14]), where different nodes are entangled, leading to quantum correlations which can be exploited by performing local measurements in each node.”
BackgroundSelf-citationQuantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication
Briegel, H.-J., Dür, W., Cirac, J. I., & Zoller, P. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5932 · Cited by 3,481 · cited 3× · see citing works
“For instance, a set of quantum repeaters [10] can be considered as a simple quantum network where the goal is to establish quantum communication over long distances.”
BackgroundSelf-citationEntanglement in Quantum Critical Phenomena
Vidal, G., Latorre, J. I., Rico, E., & Kitaev, A. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.227902 · Cited by 2,793 · cited 1× · see citing works
“As opposed to most of the recent work on entanglement theory, which has been devoted to using some of the tools developed so far in quantum-information theory to analyse problems in statistical mechanic”
ResultQuantum State Transfer and Entanglement Distribution among Distant Nodes in a Quantum Network
Cirac, J. I., Zoller, P., Kimble, H. J., & Mabuchi, H. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3221 · Cited by 2,215 · cited 1× · see citing works
“The future of quantum communication will be based on quantum networks (cf. [1, 8, 9, 10, 11, 12, 13, 14]), where different nodes are entangled, leading to quantum correlations which can be exploited by performing local measurements in each node.”
BackgroundSelf-citationSubir Sachdev, A. (1999) · Physics World · doi:10.1088/2058-7058/12/4/23 · Cited by 2,208 · see citing works
‘‘Event-ready-detectors’’ Bell experiment via entanglement swapping
Żukowski, M., Zeilinger, A., Horne, M. A., & Ekert, A. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.4287 · Cited by 2,045 · cited 1× · see citing works
“This bound can indeed be achieved by means of a rather simple protocol involving entanglement swappin”
BackgroundScaling of entanglement close to a quantum phase transition
Osterloh, A., Amico, L., Falci, G., & Fazio, R. (2002) · Nature · doi:10.1038/416608a · Cited by 1,860 · cited 1× · see citing works
“As opposed to most of the recent work on entanglement theory, which has been devoted to using some of the tools developed so far in quantum informa-2 tion theory to analyze problems in statistical mechanics [18, 19, 20, 21], the present work makes a step in the converse direction.”
ResultEntanglement in a simple quantum phase transition
Osborne, T. J., & Nielsen, M. A. (2002) · Physical Review A · doi:10.1103/physreva.66.032110 · Cited by 1,472 · cited 1× · see citing works
“As opposed to most of the recent work on entanglement theory, which has been devoted to using some of the tools developed so far in quantum informa-2 tion theory to analyze problems in statistical mechanics [18, 19, 20, 21], the present work makes a step in the converse direction.”
ResultGrimmett, G. (1999) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-03981-6 · Cited by 1,367 · see citing works
Buhrman, H., Cleve, R., Watrous, J., & de Wolf, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.167902 · Cited by 1,190 · see citing works
Conditions for a class of entanglement transformations
Nielsen, M. A. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.436 · Cited by 1,036 · cited 1× · see citing works
“This follows from the application of majorization theory to the study of local operations and classical communication transformations between entangled state”
MethodStorage and retrieval of single photons transmitted between remote quantum memories
Chanelière, T., Matsukevich, D. N., Jenkins, S. D., Lan, S.-Y., Kennedy, T. A. B., & Kuzmich, A. (2005) · Nature · doi:10.1038/nature04315 · Cited by 785 · see citing works
Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensionsPreprint
Verstraete, F., & Cirac, J. I. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cond-mat/0407066 · Cited by 672 · cited 2× · see citing works
“As opposed to most of the recent work on entanglement theory, which has been devoted to using some of the tools developed so far in quantum informa-2 tion theory to analyze problems in statistical mechanics [18, 19, 20, 21], the present work makes a step in the converse direction.”
BackgroundResultSelf-citationEntanglement versus Correlations in Spin Systems
Verstraete, F., Popp, M., & Cirac, J. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.027901 · Cited by 454 · cited 1× · see citing works
“This, or other related quantities like the localizable entanglement [15, 16], can be used as a figure of merit to characterize the state ρ and therefore the performance of the quantum network.”
BackgroundSelf-citationA photonic quantum information interface
Tanzilli, S., Tittel, W., Halder, M., Alibart, O., Baldi, P. A., Gisin, N., & Zbinden, H. (2005) · Nature · doi:10.1038/nature04009 · Cited by 431 · cited 1× · see citing works
“The future of quantum communication will be based on quantum networks (cf. [1, 8, 9, 10, 11, 12, 13, 14]), where different nodes are entangled, leading to quantum correlations which can be exploited by performing local measurements in each node.”
BackgroundEntanglement of Pure States for a Single Copy
Vidal, G. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1046 · Cited by 426 · cited 1× · see citing works
“Recall that the SCP for a state (1) is known to be equal to p ok = min(1 , 2(1 − λ 1 )) [22]. the Then, a perfect quantum channel between nodes is established with probability p ok , otherwise no entanglement is left.”
BackgroundDiverging Entanglement Length in Gapped Quantum Spin Systems
Verstraete, F., Martin-Delgado, M. A., & Cirac, J. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.087201 · Cited by 364 · cited 1× · see citing works
“Using the fact that det ( A B )= det ( A ) det ( B ) , the previous maximization give”
BackgroundSelf-citationPopp, M., Verstraete, F., Martin-Delgado, M. A., & Cirac, J. I. (2005) · Physical Review A · doi:10.1103/physreva.71.042306 · Cited by 237 · cited 1× · see citing works
“This, or other related quantities like the localizable entanglement [15, 16], can be used as a figure of merit to characterize the state ρ and therefore the performance of the quantum network.”
BackgroundSelf-citationQuantum Network Communication—The Butterfly and Beyond
Leung, D., Oppenheim, J., & Winter, A. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048442 · Cited by 141 · see citing works
Transitions in Quantum Networks
Törmä, P. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.2185 · Cited by 29 · see citing works
Flagged first, then by citations
1 of the 28 references couldn’t be matched to a known paper.
Research works printed but not linked: 2
- Bennett, C. H. & Brassard, G. in Proc. Int. Conf. on Computer Systems and Signal Processing, Bangalore 175-179 (IEEE, New York, 1984).
- Grimmett, G. Percolation (Springer, Berlin, 1999).
Cited by
Sorted by citations
Kimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023 · see citing works
“Such high efficiency is critical for the realization of complex quantum networks, including for the distribution and processing of quantum information [4, 7, 47] and for investigations of the association between quantum many-body systems and quantum networks [12, 14].”
BackgroundCavity-based quantum networks with single atoms and optical photons
Reiserer, A., & Rempe, G. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.1379 · Cited by 980 · see citing works
“Experimental steps towards this goal will include studies on quantum phase transitions of light (Carusotto and Ciuti, 2013; Greentree et al., 2006; Hartmann et al., 2006; Törmä, 1998), on the percolation of entanglement (Acin et al., 2007), and on quantum random networks (Perseguers et al., 2010).”
BackgroundAn elementary quantum network of single atoms in optical cavities
Ritter, S., Nölleke, C., Hahn, C., Reiserer, A., Neuzner, A., Uphoff, M., Mücke, M., Figueroa, E., Bochmann, J., & Rempe, G. (2012) · Nature · doi:10.1038/nature11023 · Cited by 894 · see citing works
“de † Present address: Department of Physics, University of California, Santa Barbara, CA 93106-9530, USA and California NanoSystems Institute, University of California, Santa Barbara, CA 93106-9530, USA [1] Aćın, A.”
BackgroundControl principles of complex systems
Liu, Y., & Barabási, A.-Ĺ. (2016) · Reviews of Modern Physics · doi:10.1103/revmodphys.88.035006 · Cited by 636 · see citing works
Photon‐echo quantum memory in solid state systems
Tittel, W., Afzelius, M., Chanelière, T., Cone, R. L., Kröll, S., Moiseev, S. A., & Sellars, M. J. (2009) · Laser & Photonics Review · doi:10.1002/lpor.200810056 · Cited by 450 · see citing works
Routing entanglement in the quantum internet
Pant, M., Krovi, H., Towsley, D., Tassiulas, L., Jiang, L., Basu, P., Englund, D., & Guha, S. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0139-x · Cited by 445 · see citing works
Towards Real‐World Quantum Networks: A Review
Wei, S., Jing, B., Zhang, X., Liao, J., Yuan, C., Fan, B., Lyu, C., Zhou, D., Wang, Y., Deng, G., et al. (2022) · Laser & Photonics Review · doi:10.1002/lpor.202100219 · Cited by 213 · see citing works
Entanglement between light and an optical atomic excitation
Li, L., Dudin, Y. O., & Kuzmich, A. (2013) · Nature · doi:10.1038/nature12227 · Cited by 202 · see citing works
Multi-partite entanglement can speed up quantum key distribution in networks
Epping, M., Kampermann, H., Macchiavello, C., & Bruß, D. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa8487 · Cited by 205 · see citing works
A quantum network stack and protocols for reliable entanglement-based networks
Pirker, A., & Dür, W. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab05f7 · Cited by 163 · see citing works
Spectral Entropies as Information-Theoretic Tools for Complex Network Comparison
De Domenico, M., & Biamonte, J. (2016) · Physical Review X · doi:10.1103/physrevx.6.041062 · Cited by 160 · see citing works
Information–theoretic implications of quantum causal structures
Chaves, R., Majenz, C., & Gross, D. (2015) · Nature Communications · doi:10.1038/ncomms6766 · Cited by 150 · see citing works
Entanglement of spin waves among four quantum memories
Choi, K. S., Goban, A., Papp, S. B., van Enk, S. J., & Kimble, H. J. (2010) · Nature · doi:10.1038/nature09568 · Cited by 144 · see citing works
Any quantum network is structurally controllable by a single driving signal
Siomau, M. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2112-6 · Cited by 144 · see citing works
Chaves, R. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.010402 · Cited by 138 · see citing works
Perseguers, S., Lewenstein, M., Acín, A., & Cirac, J. I. (2010) · Nature Physics · doi:10.1038/nphys1665 · Cited by 139 · see citing works
“Lately, it has been shown that quantum phase transitions may occur in the entanglement properties of quantum systems defined on regular graphs and that the use of joint operations may be beneficial, for example, for quantum teleportation between the node”
BackgroundSelf-citationPrior entanglement between senders enables perfect quantum network coding with modification
Hayashi, M. (2007) · Physical Review A · doi:10.1103/physreva.76.040301 · Cited by 138 · see citing works
Effective routing design for remote entanglement generation on quantum networks
Li, C., Li, T., Liu, Y.-X., & Cappellaro, P. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00344-4 · Cited by 137 · see citing works
Complex networks from classical to quantum
Biamonte, J., Faccin, M., & De Domenico, M. (2019) · Communications Physics · doi:10.1038/s42005-019-0152-6 · Cited by 149 · see citing works
“For instance, in the case of regular lattices, it has been shown that the probability popt to establish a perfect quantum channel between the nodes can be mapped to the probability of distributing links among each pair of nodes in the lattice [6], a scenario that can be studied using the well-established bond-percolat…”
InfluentialSupercritical entanglement in local systems: Counterexample to the area law for quantum matter
Movassagh, R., & Shor, P. W. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1605716113 · Cited by 126 · see citing works
Paparo, G. D., & Martin-Delgado, M. A. (2012) · Scientific Reports · doi:10.1038/srep00444 · Cited by 136 · see citing works
Quantum Navigation and Ranking in Complex Networks
Sánchez-Burillo, E., Duch, J., Gómez-Gardeñes, J., & Zueco, D. (2012) · Scientific Reports · doi:10.1038/srep00605 · Cited by 115 · see citing works
“This synergy has lead to the emergence of an exciting new field in which classical complex phenomena such as percolation[34, 35] or the small-world effect[36, 37] are revisited and addressed together with the new quantum machinery underlying these networks.”
BackgroundA quantum network node with crossed optical fibre cavities
Brekenfeld, M., Niemietz, D., Christesen, J. D., & Rempe, G. (2020) · Nature Physics · doi:10.1038/s41567-020-0855-3 · Cited by 112 · see citing works
Quantum Computing Review: A Decade of Research
Sood, S. K., & Pooja (2023) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2023.3284689 · Cited by 121 · see citing works
“Additionally, quantum communication is an innovative, multidisciplinary branch of research that offers significant advancements in communications that are inaccessible to the classical communication methods [7].”
BackgroundQuantum network routing and local complementation
Hahn, F., Pappa, A., & Eisert, J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0191-6 · Cited by 122 · see citing works
Entanglement distribution in pure-state quantum networks
Perseguers, S., Cirac, J. I., Acín, A., Lewenstein, M., & Wehr, J. (2008) · Physical Review A · doi:10.1103/physreva.77.022308 · Cited by 100 · see citing works
Self-citationLimitations of quantum computing with Gaussian cluster states
Ohliger, M., Kieling, K., & Eisert, J. (2010) · Physical Review A · doi:10.1103/physreva.82.042336 · Cited by 92 · see citing works
Quantum Google in a Complex Network
Paparo, G. D., Müller, M., Comellas, F., & Martin-Delgado, M. A. (2013) · Scientific Reports · doi:10.1038/srep02773 · Cited by 90 · see citing works
Entanglement Percolation in Quantum Complex Networks
Cuquet, M., & Calsamiglia, J. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.240503 · Cited by 90 · see citing works
Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings
Krenn, M., Gu, X., & Zeilinger, A. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.240403 · Cited by 91 · see citing works
Computationally Efficient Nonlinear Bell Inequalities for Quantum Networks
Luo, M. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.140402 · Cited by 91 · see citing works
Distributing graph states over arbitrary quantum networks
Meignant, C., Markham, D., & Grosshans, F. (2019) · Physical Review A · doi:10.1103/physreva.100.052333 · Cited by 92 · see citing works
Enhancing the W -state quantum-network-fusion process with a single Fredkin gate
Bugu, S., Yesilyurt, C., & Özaydin, F. (2013) · Physical Review A · doi:10.1103/physreva.87.032331 · Cited by 90 · see citing works
Fusing multiple W states simultaneously with a Fredkin gate
Özaydin, F., Bugu, S., Yesilyurt, C., Altıntaṣ, A. A., Tame, M., & Özdemir, Ş. K. (2014) · Physical Review A · doi:10.1103/physreva.89.042311 · Cited by 88 · see citing works
Distribution of entanglement in large-scale quantum networks
Perseguers, S., Lapeyre, G. J., Cavalcanti, D., Lewenstein, M., & Acín, A. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/9/096001 · Cited by 101 · see citing works
“ranging from 6 to 85 km [67]. Entanglement percolation 19 3. Entanglement percolation An approach to entangling distant parties that is conceptually different from the quantum repeater was proposed in [23]. In this paper, the main question is: given a quantum network, or graph, which operations should be performed on t…”
BackgroundMethodInfluentialSelf-citationRobust quantum network architectures and topologies for entanglement distribution
Das, S., Khatri, S., & Dowling, J. P. (2018) · Physical Review A · doi:10.1103/physreva.97.012335 · Cited by 85 · see citing works
Quantum network routing and local complementation
Hahn, F., Pappa, A., & Eisert, J. (2019) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-25518 · Cited by 94 · see citing works
Experimental violation of local causality in a quantum network
Carvacho, G., Andreoli, F., Santodonato, L., Bentivegna, M., Chaves, R., & Sciarrino, F. (2017) · Nature Communications · doi:10.1038/ncomms14775 · Cited by 81 · see citing works
Phase damping destroys quantum Fisher information of W states
Özaydin, F. (2014) · Physics Letters A · doi:10.1016/j.physleta.2014.08.035 · Cited by 67 · see citing works
Quantum Transport Enhancement by Time-Reversal Symmetry Breaking
Zimborás, Z., Faccin, M., Kádár, Z., Whitfield, J. D., Lanyon, B. P., & Biamonte, J. (2013) · Scientific Reports · doi:10.1038/srep02361 · Cited by 64 · see citing works
Optimal quantum networks and one-shot entropies
Chiribella, G., & Ebler, D. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/9/093053 · Cited by 60 · see citing works
“Advances in quantum communication [1, 2, 3] and in the integration of quantum hardware [4, 5, 6, 7, 8] are pushing towards the realization of networked quantum information systems, such as quantum communication networks [9, 10, 11, 12, 13] and distributed quantum computing [14, 15, 16].”
BackgroundReconfigurable optical implementation of quantum complex networks
Nokkala, J., Arzani, F., Galve, F., Zambrini, R., Maniscalco, S., Piilo, J., Treps, N., & Parigi, V. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aabc77 · Cited by 65 · see citing works
“In particular quantum communication tasks, like entanglement percolation [10, 19], and their extension to multiparty protocols, like secret sharing, [63] can be studied.”
BackgroundEntanglement generation in a quantum network at distance-independent rate
Patil, A., Pant, M., Englund, D., Towsley, D., & Guha, S. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00536-0 · Cited by 59 · see citing works
Large-scale quantum networks based on graphs
Epping, M., Kampermann, H., & Bruß, D. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/5/053036 · Cited by 60 · see citing works
Probabilistic quantum network coding of -qudit states over the butterfly network
Ma, S.-Y., Chen, X., Luo, M., Niu, X., & Yang, Y. (2009) · Optics Communications · doi:10.1016/j.optcom.2009.09.065 · Cited by 57 · see citing works
Nonmaximally Entangled States Can Be Better for Multiple Linear Optical Teleportation
Modławska, J., & Grudka, A. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.110503 · Cited by 57 · see citing works
Phase transition of computational power in the resource states for one-way quantum computation
Browne, D. E., Elliott, M. B., Flammia, S. T., Merkel, S. T., Miyake, A., & Short, A. J. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/2/023010 · Cited by 55 · see citing works
Bell-type inequalities for arbitrary noncyclic networks
Tavakoli, A. (2016) · Physical Review A · doi:10.1103/physreva.93.030101 · Cited by 53 · see citing works
Probing quantum correlations in many-body systems: a review of scalable methods
Frérot, I., Fadel, M., & Lewenstein, M. (2023) · Reports on Progress in Physics · doi:10.1088/1361-6633/acf8d7 · Cited by 52 · see citing works
Self-citationFully connected network of superconducting qubits in a cavity
Tsomokos, D. I., Ashhab, S., & Nori, F. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/11/113020 · Cited by 49 · see citing works
Quantum entanglement in the triangle network
Kraft, T., Designolle, S., Ritz, C., Brunner, N., Gühne, O., & Huber, M. (2021) · Physical Review A · doi:10.1103/physreva.103.l060401 · Cited by 52 · see citing works
Network coding for quantum cooperative multicast
Xu, G., Chen, X., Li, J., Wang, C., Yang, Y., & Li, Z. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1098-6 · Cited by 45 · see citing works
“[19] proposed an interesting protocol for quantum networks, without prior entanglement shared among any of the parties, but assuming free classical communications.”
BackgroundExperimental quantum network coding
Lu, H., Li, Z.-D., Yin, X.-F., Zhang, R., Fang, X., Li, L., Liu, N.-L., Xu, F., Chen, Y.-A., & Pan, J.-W. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0207-2 · Cited by 45 · see citing works
Distribution of entanglement in large-scale quantum networks
Perseguers, S., Lapeyre Jr., G., Cavalcanti, D., Lewenstein, M., & Acín, A. (2013) · MPG.PuRe (Max Planck Society) · Cited by 58 · see citing works
Self-citationComplex quantum networks: a topical review
Nokkala, J., Piilo, J., & Ginestra Bianconi, A. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad41a6 · Cited by 43 · see citing works
Exploring complex graphs using three-dimensional quantum walks of correlated photons
Ehrhardt, M., Keil, R., Maczewsky, L. J., Dittel, C., Heinrich, M., & Szameit, A. (2021) · Science Advances · doi:10.1126/sciadv.abc5266 · Cited by 42 · see citing works
“screte quantum systems face a similar challenge: Complex network topologies with a high degre e of connectivity allow for potent applications ( 4) such as efficient multipartite quantum communication (5) or search algorithms 6(, 7), but the physical implementation of such networks has – so far – been constrained to tw…”
BackgroundMultipartite entanglement percolation
Perseguers, S., Cavalcanti, D., Lapeyre, G. J., Lewenstein, M., & Acín, A. (2010) · Physical Review A · doi:10.1103/physreva.81.032327 · Cited by 41 · see citing works
Self-citationConcurrence Percolation in Quantum Networks
Meng, X., Gao, J., & Havlin, S. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.170501 · Cited by 40 · see citing works
Quantum correlations in connected multipartite Bell experiments
Tavakoli, A. (2016) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/49/14/145304 · Cited by 39 · see citing works
“[23] A.”
BackgroundMultiuser Entanglement Distribution in Quantum Networks Using Multipath Routing
Sutcliffe, E., & Beghelli, A. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3329714 · Cited by 37 · see citing works
“A key benefit of MP routing shown in the literature is the ability to distribute entangled states, at a rate independent of the distance between the two users [26], [28].”
BackgroundMethodIncreasing singlet fraction with entanglement swapping
Modławska, J., & Grudka, A. (2008) · Physical Review A · doi:10.1103/physreva.78.032321 · Cited by 34 · see citing works
Quantum internet using code division multiple access
Zhang, J., Liu, Y.-X., Özdemir, Ş. K., Wu, R.-B., Gao, F., Wang, X., Yang, L., & Nori, F. (2013) · Scientific Reports · doi:10.1038/srep02211 · Cited by 33 · see citing works
One-shot entanglement generation over long distances in noisy quantum networks
Perseguers, S., Jiang, L., Schuch, N., Verstraete, F., Lukin, M. D., Cirac, J. I., & Vollbrecht, K. G. H. (2008) · Physical Review A · doi:10.1103/physreva.78.062324 · Cited by 33 · see citing works
Self-citationQuantum simulators based on the global collective light-matter interaction
Caballero-Benítez, S. F., Mazzucchi, G., & Mekhov, I. B. (2016) · Physical Review A · doi:10.1103/physreva.93.063632 · Cited by 32 · see citing works
Asynchronous entanglement routing for the quantum internet
Yang, Z., Ghubaish, A., Jain, R. K., Shapourian, H., & Shabani, A. (2024) · AVS Quantum Science · doi:10.1116/5.0172819 · Cited by 31 · see citing works
“On top of the quantum-native repeater scheme, a network layer can be established to ensure an effective architecture [25, 26] for quantum networks, thereby enabling the full network capabilities.”
BackgroundFidelity threshold for long-range entanglement in quantum networks
Perseguers, S. (2010) · Physical Review A · doi:10.1103/physreva.81.012310 · Cited by 31 · see citing works
Enhancement of entanglement percolation in quantum networks via lattice transformations
Lapeyre, G. J., Wehr, J., & Lewenstein, M. (2009) · Physical Review A · doi:10.1103/physreva.79.042324 · Cited by 28 · see citing works
Self-citationLimited-path-length entanglement percolation in quantum complex networks
Cuquet, M., & Calsamiglia, J. (2011) · Physical Review A · doi:10.1103/physreva.83.032319 · Cited by 27 · see citing works
Entanglement percolation with bipartite mixed states
Broadfoot, S., Dorner, U., & Jaksch, D. (2009) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/88/50002 · Cited by 29 · see citing works
Growth of graph states in quantum networks
Cuquet, M., & Calsamiglia, J. (2012) · Physical Review A · doi:10.1103/physreva.86.042304 · Cited by 28 · see citing works
Relations between entanglement and purity in non-Markovian dynamics
González-Gutiérrez, C. A., Román-Ancheyta, R., Espitia, D., & Franco, R. L. (2016) · International Journal of Quantum Information · doi:10.1142/s0219749916500313 · Cited by 29 · see citing works
Quantum communication capacity transition of complex quantum networks
Zhuang, Q., & Zhang, B. (2021) · Physical Review A · doi:10.1103/physreva.104.022608 · Cited by 28 · see citing works
“[23] A.”
BackgroundPersistency of entanglement and nonlocality in multipartite quantum systems
Brunner, N., & Vértesi, T. (2012) · Physical Review A · doi:10.1103/physreva.86.042113 · Cited by 27 · see citing works
Li, R., Yi, H., & Cao, H. (2021) · International Journal of Production Research · doi:10.1080/00207543.2021.1901155 · Cited by 27 · see citing works
“…models, including sand pile avalanche model (Bak, Tang, and Wiesenfeld 1987; Batac, Longjas, and Monterola 2012), percolation-related models (Acín, Cirac, and Lewenstein 2007; do Amaral et al. 2019), branching process models (Dobson 2012), and dynamical-systems models (Sahasrabudhe…”
BackgroundConcurrence percolation threshold of large-scale quantum networks
Malik, O., Meng, X., Havlin, S., Korniss, G., Szymanski, B. K., & Gao, J. (2022) · Communications Physics · doi:10.1038/s42005-022-00958-4 · Cited by 27 · see citing works
“Converting every entangled pair in the network to a singlet is equivalent to a bond-percolation process and this measurement strategy is called classical entanglement percolation (CEP) 3,13 .”
BackgroundMethodInfluentialQuantum transport enhancement by time-reversal symmetry breaking
Zimborás, Z., Faccin, M., Kadar, Z., Whitfield, J. D., Lanyon, B., & Biamonte, J. (2012) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 27 · see citing works
Probabilistic ancilla-free phase-covariant telecloning of qudits with the optimal fidelity
Wang, X.-W., & Yang, G. (2009) · Physical Review A · doi:10.1103/physreva.79.064306 · Cited by 26 · see citing works
Controllability and stabilizability analysis of signed consensus networks
Alemzadeh, S., de Badyn, M. H., & Mesbahi, M. (2017) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta.2017.8062440 · Cited by 25 · see citing works
“Some well-studied examples of networked systems are social networks and dynamics of opinions [1], flocking [2], autonomous robotics [3], quantum networks [4], autonomous flight [5], traffic control [6] and gene regulatory networks [7].”
BackgroundUnveiling noiseless clusters in complex quantum networks
Cabot, A., Galve, F., Eguı́luz, V. M., Klemm, K., Maniscalco, S., & Zambrini, R. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0108-9 · Cited by 25 · see citing works
Entanglement in highly symmetric multipartite quantum states
Burchardt, A., Czartowski, J., & Życzkowski, K. (2021) · Physical Review A · doi:10.1103/physreva.104.022426 · Cited by 25 · see citing works
Percolation Theories for Quantum Networks
Meng, X., Hu, X., Tian, Y., Dong, G., Lambiotte, R., Gao, J., & Havlin, S. (2023) · Entropy · doi:10.3390/e25111564 · Cited by 25 · see citing works
Quantum communication using code division multiple access network
Sharma, V., & Banerjee, S. (2020) · Optical and Quantum Electronics · doi:10.1007/s11082-020-02494-3 · Cited by 23 · see citing works
Long-distance quantum communication over noisy networks without long-time quantum memory
Mazurek, P., Grudka, A., Horodecki, M., Horodecki, P., Łodyga, J., Pankowski, Ł., & Przysiężna, A. (2014) · Physical Review A · doi:10.1103/physreva.90.062311 · Cited by 23 · see citing works
Entanglement formation in continuous-variable random quantum networks
Zhang, B., & Zhuang, Q. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00370-w · Cited by 23 · see citing works
Bond order via light-induced synthetic many-body interactions of ultracold atoms in optical lattices
Caballero-Benítez, S. F., & Mekhov, I. B. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/11/113010 · Cited by 23 · see citing works
Performance metrics for the continuous distribution of entanglement in multiuser quantum networks
Iñesta, Á. G., & Wehner, S. (2023) · Physical Review A · doi:10.1103/physreva.108.052615 · Cited by 20 · see citing works
“Some authors have described the connectivity of a quantum network using percolation theory [41–47], which also disregards the time-evolution of the entangled states, and often assumes specific topologies and some form of pre-shared entanglement.”
BackgroundAnalytical evidence of nonlinearity in qubits and continuous-variable quantum reservoir computing
Mujal, P., Nokkala, J., Martínez‐Peña, R., Giorgi, G. L., Soriano, M. C., & Zambrini, R. (2021) · Journal of Physics Complexity · doi:10.1088/2632-072x/ac340e · Cited by 19 · see citing works
Singlet generation in mixed-state quantum networks
Broadfoot, S., Dorner, U., & Jaksch, D. (2010) · Physical Review A · doi:10.1103/physreva.81.042316 · Cited by 19 · see citing works
Teleportation-Induced Correlated Quantum Channels
Caruso, F., Giovannetti, V., & Palma, G. M. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.020503 · Cited by 19 · see citing works
Unveiling the importance of nonshortest paths in quantum networks
Hu, X., Dong, G., Christensen, K., Sun, H., Fan, J., Tian, Z., Gao, J., Havlin, S., Lambiotte, R., & Meng, X. (2025) · Science Advances · doi:10.1126/sciadv.adt2404 · Cited by 18 · see citing works
Prisoners’ Dilemma in a Spatially Separated System Based on Spin–Photon Interactions
Altıntaṣ, A. A., Özaydin, F., Bayındır, C., & Bayrakci, V. (2022) · Photonics · doi:10.3390/photonics9090617 · Cited by 18 · see citing works
Quantum Google algorithm: Construction and application to complex networks
Paparo, G. D., Müller, M., Comellas, F., & Martin-Delgado, M. A. (2014) · The European Physical Journal Plus · doi:10.1140/epjp/i2014-14150-y · Cited by 17 · see citing works
Information sharing in quantum complex networks
Cardillo, A., Galve, F., Zueco, D., & Gómez-Gardeñes, J. (2013) · Physical Review A · doi:10.1103/physreva.87.052312 · Cited by 17 · see citing works
Scalable characterization of localizable entanglement in noisy topological quantum codes
Amaro, D., Müller, M., & Pal, A. K. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab84b3 · Cited by 16 · see citing works
Estimating localizable entanglement from witnesses
Amaro, D., Müller, M., & Pal, A. K. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aac485 · Cited by 16 · see citing works
Multiparty quantum protocols for assisted entanglement distillationPreprint
Dutil, N. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1105.4657 · Cited by 22 · see citing works
“In this chapter, we continue the theoretical analysis of this problem by extending the models previously studied in [80, 20] to allow for an arbitrary mixed state between adjacent nodes.”
BackgroundInfluentialDeterministic entanglement distribution on series-parallel quantum networks
Meng, X., Cui, Y., Gao, J., Havlin, S., & Ruckenstein, A. E. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013225 · Cited by 17 · see citing works
Hierarchical certification of nonclassical network correlations
Luo, M., Yang, X., & Pozas-Kerstjens, A. (2024) · Physical Review A · doi:10.1103/physreva.110.022617 · Cited by 16 · see citing works
“(b) The generalization of the previous scenario to chains, and (c) its generalization to stars. vex, and thus objects such as linear Bell inequalities cannot characterize them completely.”
BackgroundProgress towards a unified approach to entanglement distribution
Streltsov, A., Augusiak, R., Demianowicz, M., & Lewenstein, M. (2015) · Physical Review A · doi:10.1103/physreva.92.012335 · Cited by 16 · see citing works
Self-citationUniform decoherence effect on localizable entanglement in random multiqubit pure states
Banerjee, R., Pal, A. K., & Sen, A. (2020) · Physical Review A · doi:10.1103/physreva.101.042339 · Cited by 16 · see citing works
- Authors
- Acín, A., Cirac, J. I., & Lewenstein, M.
- Affiliations
- Institució Catalana de Recerca i Estudis Avançats (ES)
- Max Planck Institute of Quantum Optics (DE)
- Corresponding author
- Cirac, J. Ignacio
- Venue
- Nature Physics
- Published
- 2007-02-25
- Volume
- 3
- Issue
- 4
- Pages
- 256-259
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2070256846
- Cited by
- 255
- References
- 28
- Citations by year
- 2026: 19 · 2025: 21 · 2024: 22 · 2023: 13 · 2022: 15 · 2021: 16 · 2020: 11 · 2019: 14 · 2018: 8 · 2017: 15 · 2016: 16 · 2015: 8 · 2014: 9 · 2013: 13 · 2012: 12
- FWCI
- 13.81
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Nature Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Max Planck Institute for Plasma Physics (submittedVersion)
- MPG.PuRe (Max Planck Society) (submittedVersion)
- arXiv (Cornell University)
- Funders
- European Science Foundation
- Deutsche Forschungsgemeinschaft
- Ministerio de Economía y Competitividad
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum networks, quantum communication, maximally entangled states, phase transitions, network connectivity, quantum teleportation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
