Cambalache 3,14 - La vidriera irrespetuosa

We introduce a physical approach to social networks (SNs) in which each actor is characterized by a yes-no test on a physical system. This is used to measure whether the interactions originating a SN obey pre-existing properties, as in a classical social network (CSN). As an example of SNs beyond CSNs, we introduce quantum social networks (QSNs) as those in which actor $i$ is characterized by a test of whether or not the system is in a quantum state $|\psi_i>$. We show that QSNs outperform CSNs for a certain task and some graphs. We identify the simplest of these graphs and show that graphs in which QSNs outperform CSNs are increasingly frequent as the number of vertices increases. We also discuss more general SNs and identify the simplest graphs in which QSNs cannot be outperformed.