…"technique of local #sparsification on experiment graphs, using which we answer a crucial open question in experimental #quantum #optics, namely whether certain complex entangled quantum states can be constructed. This provides us with more insights into quantum resource theory [and] the limitation of specific quantum #photonic systems"…
🔗 https://mathstodon.xyz/@quantumjournal/112722596982821782 Retooted from @quantumjournal.
🔗 https://Quantum-Journal.org/papers/q-2024-07-03-1396/
#Time #Timelessness #TimeTravel

Attached: 1 image
New #Paper published in Quantum: Graph-theoretic insights on the constructability of complex entangled states
https://quantum-journal.org/papers/q-2024-07-03-1396/
#OpenScience #Quantum #Research
MathstodonSo happy to finally see this collaboration with Rion Correia and @alainbarrat out. The distance backbone is a unique, algebraically-principled network subgraph that preserves all shortest paths. We were were excited to find out (with #sociopatterns and other data) that the backbones of #socialnetworks contain large amounts of redundant interactions that can be removed with very little impact on #communitystructure and #epidemic spread.
#complexsystems #dynamics
#Networkscience #Sparsification #complexnetworks
#PLOSCompBio:
https://dx.plos.org/10.1371/journal.pcbi.1010854

Contact networks have small metric backbones that maintain community structure and are primary transmission subgraphs
Author summary It is through social networks that contagious diseases spread in human populations, as best illustrated by the current pandemic and efforts to contain it. Measuring such networks from human contact data typically results in noisy and dense graphs that need to be simplified for effective analysis, without removal of their essential features. Thus, the identification of a primary subgraph that maintains the social interaction structure and likely transmission pathways is of relevance for studying epidemic spreading phenomena as well as devising intervention strategies to hinder spread. Here we propose and study the metric backbone as an optimal subgraph for sparsification of social contact networks in the study of simple spreading dynamics. We demonstrate that it is a unique, algebraically-principled network subgraph that preserves all shortest paths. We also discover that nine contact networks obtained from proximity sensors in a variety of social contexts contain large amounts of redundant interactions that can be removed with very little impact on community structure and epidemic spread. This reveals that epidemic spread on social networks is very robust to random interaction removal. However, extraction of the metric backbone subgraph reveals which interventions—strategic removal of specific social interactions—are likely to result in maximum impediment to epidemic spread.
If you are interested in network
#sparsification methods, come see Felipe Xavier Costa show that distance
#backbones can be applied to
#directedgraphs, session 3C at
#ComplexNetworks 2022.