  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 allows us to
consider SNs beyond those originated by interactions based on pre-existing
properties, as in a classical SN (CSN). As an example of SNs beyond CSNs, we
introduce quantum SNs (QSNs) in which actor is characterized by a test of
whether or not the system is in a quantum state. 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.
