{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T07:25:26Z","timestamp":1774250726917,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Democritus University of Thrace"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Multiplayer quantum games have received growing attention due to the ability of quantum computational models to access enlarged strategic spaces, thereby enabling the emergence of nonclassical Nash equilibria and Pareto-efficient solutions. Concurrently, graph-theoretic representations have become a standard tool for encoding relational dependencies among interacting players. This work establishes a unified formalism that embeds arbitrary graph topologies into parametrized quantum-game circuits, providing a direct mapping between network structure and the strategic interaction space of quantum players. Within this framework, we analytically and computationally evaluate how graph-induced interpersonal couplings modulate payoff distributions over repeated quantum-game iterations. In addition, we integrate a reward-driven adaptation algorithm that allows players to optimize their local strategy parameters dynamically with respect to accumulated payoffs. Experimental results demonstrate that the equilibrium reward landscape is highly sensitive to the players\u2019 graph-theoretic centrality and the weighted structure of their adversarial and cooperative relationships.<\/jats:p>","DOI":"10.1007\/s11128-026-05127-y","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T06:30:38Z","timestamp":1774247438000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph-encoded strategic interactions in multiplayer quantum games"],"prefix":"10.1007","volume":"25","author":[{"given":"Michael","family":"Tsakiroglou","sequence":"first","affiliation":[]},{"given":"Ioannis","family":"Liliopoulos","sequence":"additional","affiliation":[]},{"given":"Georgios D.","family":"Varsamis","sequence":"additional","affiliation":[]},{"given":"Kristin","family":"Milchanowski","sequence":"additional","affiliation":[]},{"given":"Ioannis G.","family":"Karafyllidis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,23]]},"reference":[{"key":"5127_CR1","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A 439, 553\u2013558 (1992)","journal-title":"Proc. R. Soc. Lond. A"},{"key":"5127_CR2","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"5127_CR3","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994). IEEE","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"1","key":"5127_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1038\/s41534-021-00368-4","volume":"7","author":"A Robert","year":"2021","unstructured":"Robert, A., Barkoutsos, P.K., Woerner, S., Tavernelli, I.: Resource-efficient quantum algorithm for protein folding. npj Quantum Inf. 7(1), 38 (2021)","journal-title":"npj Quantum Inf."},{"issue":"22","key":"5127_CR5","doi-asserted-by":"publisher","first-page":"12685","DOI":"10.1021\/acs.chemrev.9b00829","volume":"120","author":"B Bauer","year":"2020","unstructured":"Bauer, B., Bravyi, S., Motta, M., Chan, G.K.L.: Quantum algorithms for quantum chemistry and quantum materials science. Chem. Rev. 120(22), 12685\u201312717 (2020)","journal-title":"Chem. Rev."},{"key":"5127_CR6","doi-asserted-by":"publisher","first-page":"10759","DOI":"10.1016\/j.compbiolchem.2023.107959","volume":"107","author":"GD Varsamis","year":"2023","unstructured":"Varsamis, G.D., Karafyllidis, I.G., Gilkes, K.M., Arranz, U., Martin-Cuevas, R., Calleja, G., Wong, J.: Quantum gate algorithm for reference-guided DNA sequence alignment. Comput. Biol. Chem. 107, 10759 (2023)","journal-title":"Comput. Biol. Chem."},{"key":"5127_CR7","doi-asserted-by":"publisher","first-page":"678","DOI":"10.22331\/q-2022-03-30-678","volume":"6","author":"S Bravyi","year":"2022","unstructured":"Bravyi, S., Kliesch, A., Koenig, R., Tang, E.: Hybrid quantum-classical algorithms for approximate graph coloring. Quantum 6, 678 (2022)","journal-title":"Quantum"},{"key":"5127_CR8","first-page":"18145","volume":"23","author":"A Wang","year":"2024","unstructured":"Wang, A., Hu, J., Zhang, S., Li, L.: Shallow hybrid quantum-classical convolutional neural network model for image classification. Quantum Inf. Process. 23, 18145 (2024)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"5127_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s42484-024-00230-8","volume":"7","author":"I Liliopoulos","year":"2025","unstructured":"Liliopoulos, I., Varsamis, G.D., Milchanowski, K., Martin Cuevas, R., Safouri, K., Dimitrakis, P., Karafyllidis, I.G.: Hybrid classical-quantum multilayer neural networks for monitoring agricultural activities using remote sensing data. Quantum Mach. Intell. 7(1), 4 (2025)","journal-title":"Quantum Mach. Intell."},{"issue":"1","key":"5127_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1206035.1206039","volume":"54","author":"S Hallgren","year":"2007","unstructured":"Hallgren, S.: Polynomial-time quantum algorithms for Pell\u2019s equation and the principal ideal problem. J ACM (JACM) 54(1), 1\u201319 (2007)","journal-title":"J ACM (JACM)"},{"issue":"7779","key":"5127_CR11","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J.C., Barends, R., Biswas, R., Boixo, S., Brandao, F.G., Buell, D.A.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505\u2013510 (2019)","journal-title":"Nature"},{"key":"5127_CR12","volume-title":"Introduction to Game Theory","author":"MJ Osborne","year":"2004","unstructured":"Osborne, M.J.: Introduction to Game Theory. Oxford University Press, Oxford, UK (2004)"},{"key":"5127_CR13","doi-asserted-by":"publisher","DOI":"10.4324\/9780203761335","volume-title":"Game Theory and Its Applications: In the Social and Biological Sciences","author":"AM Colman","year":"2013","unstructured":"Colman, A.M.: Game Theory and Its Applications: In the Social and Biological Sciences. Psychology Press, Hove, UK (2013)"},{"key":"5127_CR14","volume-title":"Game Theory: an Introduction","author":"S Tadelis","year":"2013","unstructured":"Tadelis, S.: Game Theory: an Introduction. Princeton University Press, Princeton, NJ (2013)"},{"key":"5127_CR15","doi-asserted-by":"publisher","DOI":"10.1201\/9781003051275","volume-title":"Introducing Game Theory and Its Applications","author":"E Mendelson","year":"2024","unstructured":"Mendelson, E., Zwillinger, D.: Introducing Game Theory and Its Applications. Chapman and Hall\/CRC, New York (2024)"},{"issue":"5","key":"5127_CR16","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1103\/PhysRevLett.82.1052","volume":"82","author":"DA Meyer","year":"1999","unstructured":"Meyer, D.A.: Quantum strategies. Phys. Rev. Lett. 82(5), 1052 (1999)","journal-title":"Phys. Rev. Lett."},{"issue":"15","key":"5127_CR17","doi-asserted-by":"publisher","first-page":"3077","DOI":"10.1103\/PhysRevLett.83.3077","volume":"83","author":"J Eisert","year":"1999","unstructured":"Eisert, J., Wilkens, M., Lewenstein, M.: Quantum games and quantum strategies. Phys. Rev. Lett. 83(15), 3077 (1999)","journal-title":"Phys. Rev. Lett."},{"key":"5127_CR18","doi-asserted-by":"publisher","unstructured":"Eisert, J., Wilkens, M., Lewenstein, M.: Erratum: Quantum games and quantum strategies [phys. rev. lett. 83, 3077 (1999)]. Phys. Rev. Lett. 124, 139901 (2020).https:\/\/doi.org\/10.1103\/PhysRevLett.124.139901","DOI":"10.1103\/PhysRevLett.124.139901"},{"issue":"3","key":"5127_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.64.030301","volume":"64","author":"SC Benjamin","year":"2001","unstructured":"Benjamin, S.C., Hayden, P.M.: Multiplayer quantum games. Phys. Rev. A 64(3), 030301 (2001)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"5127_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.65.062318","volume":"65","author":"AP Flitney","year":"2002","unstructured":"Flitney, A.P., Abbott, D.: Quantum version of the Monty hall problem. Phys. Rev. A 65(6), 062318 (2002)","journal-title":"Phys. Rev. A"},{"key":"5127_CR21","doi-asserted-by":"publisher","DOI":"10.1002\/qute.202500375","volume":"8","author":"GD Varsamis","year":"2025","unstructured":"Varsamis, G.D., Liliopoulos, I., Mohammadbagherpoor, H., Kostopoulos, A.K., Milchanowski, K., Karamatskos, E.T., Dimitrakis, P., Padbury, R.P., Karafyllidis, I.G.: Analysis of the effect of entanglement operators and the scalability of players\u2019 payoff computation in n-player quantum games. Adv. Quantum Technol. 8, e00375 (2025)","journal-title":"Adv. Quantum Technol."},{"issue":"1","key":"5127_CR22","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.physleta.2005.03.006","volume":"339","author":"J Zhou","year":"2005","unstructured":"Zhou, J., Ma, L., Li, Y.: Multiplayer quantum games with continuous-variable strategies. Phys. Lett. A 339(1), 10\u201317 (2005)","journal-title":"Phys. Lett. A"},{"issue":"2","key":"5127_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s11128-008-0078-5","volume":"7","author":"PBM Sousa","year":"2008","unstructured":"Sousa, P.B.M., Ramos, R.V.: Multiplayer quantum games and its application as access controller in architecture of quantum computers. Quantum Inf. Process. 7(2), 125\u2013135 (2008)","journal-title":"Quantum Inf. Process."},{"issue":"03n04","key":"5127_CR24","doi-asserted-by":"publisher","first-page":"2550014","DOI":"10.1142\/S0129626425500148","volume":"35","author":"GD Varsamis","year":"2025","unstructured":"Varsamis, G.D., Liliopoulos, I., Mohammadbagherpoor, H., Kostopoulos, A.K., Milchanowski, K., Karamatskos, E.T., Dimitrakis, P., Padbury, R.P., Karafyllidis, I.G.: Proxy quantum games. Parallel Process. Lett. 35(03n04), 2550014 (2025)","journal-title":"Parallel Process. Lett."},{"key":"5127_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-70107-2","volume-title":"Graph Theory","author":"R Diestel","year":"2025","unstructured":"Diestel, R.: Graph Theory, vol. 173. Springer, Berlin (2025)"},{"key":"5127_CR26","doi-asserted-by":"publisher","DOI":"10.1201\/9780429425134","volume-title":"Graph Theory and Its Applications","author":"JL Gross","year":"2018","unstructured":"Gross, J.L., Yellen, J., Anderson, M.: Graph Theory and Its Applications. Chapman and Hall\/CRC, New York (2018)"},{"issue":"1","key":"5127_CR27","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0753-66","volume":"189","author":"L Euler","year":"1953","unstructured":"Euler, L.: Leonhard euler and the k\u00f6nigsberg bridges. Sci. Am. 189(1), 66\u201372 (1953)","journal-title":"Sci. Am."},{"issue":"2","key":"5127_CR28","doi-asserted-by":"publisher","first-page":"111","DOI":"10.31887\/DCNS.2018.20.2\/osporns","volume":"20","author":"O Sporns","year":"2018","unstructured":"Sporns, O.: Graph theory methods: applications in brain networks. Dialogues Clin. Neurosci. 20(2), 111\u2013121 (2018)","journal-title":"Dialogues Clin. Neurosci."},{"key":"5127_CR29","doi-asserted-by":"crossref","unstructured":"Tang, L., Liu, H.: Graph mining applications to social network analysis. In: Managing and Mining Graph Data, pp. 487\u2013513. Springer, Berlin (2010)","DOI":"10.1007\/978-1-4419-6045-0_16"},{"key":"5127_CR30","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1109\/OJCOMS.2021.3128637","volume":"2","author":"S He","year":"2021","unstructured":"He, S., Xiong, S., Ou, Y., Zhang, J., Wang, J., Huang, Y., Zhang, Y.: An overview on the application of graph neural networks in wireless networks. IEEE Open J. Commun. Soc. 2, 2547\u20132565 (2021)","journal-title":"IEEE Open J. Commun. Soc."},{"issue":"2","key":"5127_CR31","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"issue":"1","key":"5127_CR32","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1), 48\u201377 (2002)","journal-title":"SIAM J. Comput."},{"key":"5127_CR33","unstructured":"Javadi-Abhari, A., Treinish, M., Krsulich, K., Wood, C.J., Lishman, J., Gacon, J., Martiel, S., Nation, P.D., Bishop, L.S., Cross, A.W., et al.: Quantum computing with qiskit. arXiv preprint arXiv:2405.08810 (2024)"},{"issue":"1","key":"5127_CR34","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"issue":"290\u2013297","key":"5127_CR35","first-page":"18","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs i. Publ. Math. Debrecen 6(290\u2013297), 18 (1959)","journal-title":"Publ. Math. Debrecen"},{"issue":"4","key":"5127_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2382616.2382620","volume":"6","author":"C Wilson","year":"2012","unstructured":"Wilson, C., Sala, A., Puttaswamy, K.P., Zhao, B.Y.: Beyond social graphs: user interactions in online social networks and their implications. ACM Transact. Web (TWEB) 6(4), 1\u201331 (2012)","journal-title":"ACM Transact. Web (TWEB)"},{"key":"5127_CR37","doi-asserted-by":"crossref","unstructured":"Altintas, A.A., Ozaydin, F., Bayindir, C., Bayrakci, V.: Prisoners\u2019 dilemma in a spatially separated system based on spin\u2013photon interactions. Photonics 9(9) (2022)","DOI":"10.3390\/photonics9090617"},{"issue":"11","key":"5127_CR38","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.3390\/e25111484","volume":"25","author":"A Silva","year":"2023","unstructured":"Silva, A., Zabaleta, O.G., Arizmendi, C.M.: Maximizing local rewards on multi-agent quantum games through gradient-based learning strategies. Entropy 25(11), 1484 (2023)","journal-title":"Entropy"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05127-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-026-05127-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05127-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T06:30:43Z","timestamp":1774247443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-026-05127-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,23]]},"references-count":38,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["5127"],"URL":"https:\/\/doi.org\/10.1007\/s11128-026-05127-y","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,23]]},"assertion":[{"value":"26 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"109"}}