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.
%0 Journal Article
%1 Cabello2012Quantum
%A Cabello, Adán
%A Danielsen, Lars E.
%A López-Tarrida, Antonio J.
%A Portillo, José R.
%D 2012
%J Journal of Physics A: Mathematical and Theoretical
%K quantum-model, social-networks
%N 28
%P 285101+
%R 10.1088/1751-8113/45/28/285101
%T Quantum social networks
%U http://dx.doi.org/10.1088/1751-8113/45/28/285101
%V 45
%X 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.
@article{Cabello2012Quantum,
abstract = {{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.}},
added-at = {2019-06-10T14:53:09.000+0200},
archiveprefix = {arXiv},
author = {Cabello, Ad\'{a}n and Danielsen, Lars E. and L\'{o}pez-Tarrida, Antonio J. and Portillo, Jos\'{e} R.},
biburl = {https://www.bibsonomy.org/bibtex/2ce4258a44ee338d09467502a387843fa/nonancourt},
citeulike-article-id = {10098851},
citeulike-linkout-0 = {http://dx.doi.org/10.1088/1751-8113/45/28/285101},
citeulike-linkout-1 = {http://arxiv.org/abs/1112.0617},
citeulike-linkout-2 = {http://arxiv.org/pdf/1112.0617},
day = 20,
doi = {10.1088/1751-8113/45/28/285101},
eprint = {1112.0617},
interhash = {8b47866b87ec91236c42fc8331bb0d75},
intrahash = {ce4258a44ee338d09467502a387843fa},
issn = {1751-8121},
journal = {Journal of Physics A: Mathematical and Theoretical},
keywords = {quantum-model, social-networks},
month = jul,
number = 28,
pages = {285101+},
posted-at = {2011-12-06 13:14:37},
priority = {2},
timestamp = {2019-07-31T12:31:16.000+0200},
title = {{Quantum social networks}},
url = {http://dx.doi.org/10.1088/1751-8113/45/28/285101},
volume = 45,
year = 2012
}