Show simple item record

dc.contributor.authorCabello, Adáneng
dc.contributor.authorDanielsen, Lars Eirikeng
dc.contributor.authorLópez-Tarrida, Antonio J.eng
dc.contributor.authorPortillo, José R.eng
dc.date.accessioned2013-05-02T11:23:46Z
dc.date.available2013-06-27T22:30:04Z
dc.date.issued2012-06-27eng
dc.PublishedJournal of Physics A: Mathematical and Theoretical 45(28)eng
dc.identifier.issn1751-8113en_US
dc.identifier.urihttps://hdl.handle.net/1956/6553
dc.description.abstractWe 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 i is characterized by a test of whether or not the system is in a quantum state |ψ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.en_US
dc.language.isoengeng
dc.publisherInstitute of Physicsen_US
dc.rights.urihttp://iopscience.iop.org/info/page/openaccesseng
dc.titleQuantum social networksen_US
dc.typePeer reviewed
dc.typeJournal article
dc.description.versionacceptedVersionen_US
dc.rights.holderCopyright 2012 IOP Publishing Ltden_US
dc.identifier.doihttps://doi.org/10.1088/1751-8113/45/28/285101
dc.identifier.cristin937417


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record