Evidence map›Paper›PMID 40009660›Full record

ArticleScience advances2025

Unveiling the importance of nonshortest paths in quantum networks.

Xinqi Hu, Gaogao Dong, Kim Christensen, Hanlin Sun, Jingfang Fan, Zihao Tian, Jianxi Gao, Shlomo Havlin, Renaud Lambiotte, Xiangyi Meng

Abstract read
PubMed Full text at PMC Publisher
In one paragraph

Article in Science advances, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

10 authors.

Xinqi HuSchool of Mathematical Sciences, Jiangsu University, Zhenjiang, Jiangsu 212013, China.ORCID 0009-0008-5018-1934
Gaogao DongSchool of Mathematical Sciences, Jiangsu University, Zhenjiang, Jiangsu 212013, China.ORCID 0000-0003-4425-7724
Kim ChristensenBlackett Laboratory and Centre for Complexity Science, Imperial College London, London SW7 2AZ, UK.
Hanlin SunNordita, KTH Royal Institute of Technology and Stockholm University, Hannes Alfvéns väg 12, SE-106 91 Stockholm, Sweden.ORCID 0000-0003-1606-1257
Jingfang FanSchool of Systems Science and Institute of Nonequilibrium Systems, Beijing Normal University, Beijing 100875, China.ORCID 0000-0003-1954-4641
Zihao TianSchool of Management and Engineering, Nanjing University, Nanjing 210093, China.ORCID 0000-0003-2600-2103
Jianxi GaoNetwork Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY 12180, USA.ORCID 0000-0002-3952-208X
Shlomo HavlinDepartment of Physics, Bar-Ilan University, Ramat Gan 52900, Israel.ORCID 0000-0002-9974-5920
Renaud LambiotteSchool of Mathematical Sciences, Jiangsu University, Zhenjiang, Jiangsu 212013, China.ORCID 0000-0002-0583-4595
Xiangyi MengNetwork Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY 12180, USA.ORCID 0000-0001-5184-7648

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Quantum networks (QNs) exhibit stronger connectivity than predicted by classical percolation, yet the origin of this phenomenon remains unexplored. We apply a statistical physics model-concurrence percolation-to uncover the origin of stronger connectivity on hierarchical scale-free networks, the (

Identifiers

PMID40009660
PMCPMC11864168

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.