{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:48:08Z","timestamp":1778255288842,"version":"3.51.4"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030617387","type":"print"},{"value":"9783030617394","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61739-4_6","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T23:11:38Z","timestamp":1602717098000},"page":"83-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Quantum-over-Classical Advantage in\u00a0Solving Multiplayer Games"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Kravchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamil","family":"Khadiev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danil","family":"Serov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruslan","family":"Kapralov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,15]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.26599\/BDMA.2019.9020016","volume":"3","author":"F Ablayev","year":"2019","unstructured":"Ablayev, F., Ablayev, M., Zhexue, H.J., Khadiev, K., Salikhova, N., Wu, D.: On quantum methods for machine learning problems part I: quantum tools. Big Data Min. Anal. 3(1), 41\u201355 (2019)","journal-title":"Big Data Min. Anal."},{"key":"6_CR2","unstructured":"Ambainis, A.: Understanding quantum algorithms via query complexity. arXiv preprint \n                    arXiv:1712.06349\n                    \n                   (2017)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-31594-7_3","volume-title":"Automata, Languages, and Programming","author":"A Ambainis","year":"2012","unstructured":"Ambainis, A., et al.: Quantum strategies are better than classical in almost any XOR game. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 25\u201337. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-31594-7_3"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-36046-6_7","volume-title":"Mathematical and Engineering Methods in Computer Science","author":"A Ambainis","year":"2013","unstructured":"Ambainis, A., Iraids, J., Kravchenko, D., Virza, M.: Advantage of quantum strategies in random symmetric XOR games. In: Ku\u010dera, A., Henzinger, T.A., Ne\u0161et\u0159il, J., Vojnar, T., Anto\u0161, D. (eds.) MEMICS 2012. LNCS, vol. 7721, pp. 57\u201368. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-36046-6_7"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"5375","DOI":"10.1103\/PhysRevA.46.5375","volume":"46","author":"M Ardehali","year":"1992","unstructured":"Ardehali, M.: Bell inequalities with a magnitude of violation that grows exponentially with the number of particles. Phys. Rev. A 46, 5375\u20135378 (1992)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"6_CR6","doi-asserted-by":"publisher","first-page":"069801","DOI":"10.1103\/PhysRevLett.87.069801","volume":"87","author":"SC Benjamin","year":"2001","unstructured":"Benjamin, S.C., Hayden, P.M.: Comment on \"quantum games and quantum strategies\". Phys. Rev. Lett. 87(6), 069801 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"030301","DOI":"10.1103\/PhysRevA.64.030301","volume":"64","author":"SC Benjamin","year":"2001","unstructured":"Benjamin, S.C., Hayden, P.M.: Multi-player quantum games. Phys. Rev. A 64(3), 030301 (2001)","journal-title":"Phys. Rev. A"},{"issue":"4\u20135","key":"6_CR8","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschritte der Physik"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1038\/ncomms3057","volume":"4","author":"N Brunner","year":"2013","unstructured":"Brunner, N., Linden, N.: Connection between Bell nonlocality and Bayesian game theory. Nat. Commun. 4, 2057 (2013)","journal-title":"Nat. Commun."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1103\/PhysRevLett.23.880","volume":"23","author":"JF Clauser","year":"1969","unstructured":"Clauser, J.F., Horne, M.A., Shimony, A., Holt, R.A.: Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett. 23, 880 (1969)","journal-title":"Phys. Rev. Lett."},{"key":"6_CR11","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2001)","edition":"2"},{"key":"6_CR12","unstructured":"D\u00fcrr, C., H\u00f8yer, P.: A quantum algorithm for finding the minimum. \n                    arXiv:quant-ph\/9607014\n                    \n                   (1996)"},{"key":"6_CR13","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, 3077 (1999)","journal-title":"Phys. Rev. Lett."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"024306","DOI":"10.1103\/PhysRevA.66.024306","volume":"66","author":"SJ van Enk","year":"2002","unstructured":"van Enk, S.J., Pike, R.: Classical rules in quantum games. Phys. Rev. A 66, 024306 (2002)","journal-title":"Phys. Rev. A"},{"key":"6_CR15","unstructured":"Ferguson, T.S.: Game theory class notes for math 167, fall 2000 (2000). \n                    https:\/\/www.cs.cmu.edu\/afs\/cs\/academic\/class\/15859-f01\/www\/notes\/comb.pdf"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Groverm, 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. ACM (1996)","DOI":"10.1145\/237814.237866"},{"key":"6_CR17","first-page":"6","volume":"2","author":"PM Grundy","year":"1939","unstructured":"Grundy, P.M.: Mathematics and games. Eureka 2, 6\u20138 (1939)","journal-title":"Eureka"},{"issue":"5","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1504","DOI":"10.1007\/s10773-020-04418-z","volume":"59","author":"Y Huang","year":"2020","unstructured":"Huang, Y., Ye, Z., Zheng, S., Li, L.: An exact quantum algorithm for a restricted subtraction game. Int. J. Theoret. Phys. 59(5), 1504\u20131511 (2020). \n                    https:\/\/doi.org\/10.1007\/s10773-020-04418-z","journal-title":"Int. J. Theoret. Phys."},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-030-19311-9_13","volume-title":"Unconventional Computation and Natural Computation","author":"K Khadiev","year":"2019","unstructured":"Khadiev, K., Safina, L.: Quantum algorithm for dynamic programming approach for DAGs. Applications for Zhegalkin polynomial evaluation and some problems on DAGs. In: McQuillan, I., Seki, S. (eds.) UCNC 2019. LNCS, vol. 11493, pp. 150\u2013163. Springer, Cham (2019). \n                    https:\/\/doi.org\/10.1007\/978-3-030-19311-9_13"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-030-19955-5_20","volume-title":"Computer Science \u2013 Theory and Applications","author":"D Kravchenko","year":"2019","unstructured":"Kravchenko, D., Khadiev, K., Serov, D.: On the quantum and classical complexity of solving subtraction games. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 228\u2013236. Springer, Cham (2019). \n                    https:\/\/doi.org\/10.1007\/978-3-030-19955-5_20"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-030-14082-3_5","volume-title":"Quantum Technology and Optimization Problems","author":"FS Khan","year":"2019","unstructured":"Khan, F.S., Humble, T.S.: Nash embedding and equilibrium in pure quantum states. In: Feld, S., Linnhoff-Popien, C. (eds.) QTOP 2019. LNCS, vol. 11413, pp. 51\u201362. Springer, Cham (2019). \n                    https:\/\/doi.org\/10.1007\/978-3-030-14082-3_5"},{"issue":"11","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-2082-8","volume":"17","author":"FS Khan","year":"2018","unstructured":"Khan, F.S., Solmeyer, N., Balu, R., Humble, T.S.: Quantum games: a review of the history, current state, and interpretation. Quantum Inf. Process. 17(11), 1\u201342 (2018). \n                    https:\/\/doi.org\/10.1007\/s11128-018-2082-8","journal-title":"Quantum Inf. Process."},{"key":"6_CR23","unstructured":"Kravchenko, D.: A new quantization scheme for classical games. In: Proceedings of Workshop on Quantum and Classical Complexity (Satellite event to ICALP 2013), pp. 17\u201334 (2013)"},{"key":"6_CR24","first-page":"149","volume":"8","author":"D Kravchenko","year":"2015","unstructured":"Kravchenko, D.: Quantum entanglement in a zero-sum game. Contrib. Game Theory Manag. 8, 149\u2013163 (2015)","journal-title":"Contrib. Game Theory Manag."},{"key":"6_CR25","unstructured":"Li, Y.D.: BQP and PPAD. \n                    arXiv:1108.0223\n                    \n                   (2011)"},{"issue":"2","key":"6_CR26","doi-asserted-by":"publisher","first-page":"022307","DOI":"10.1103\/PhysRevA.64.022307","volume":"64","author":"G-L Long","year":"2001","unstructured":"Long, G.-L.: Grover algorithm with zero theoretical failure rate. Phys. Rev. A 64(2), 022307 (2001)","journal-title":"Phys. Rev. A"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0375-9601(00)00441-2","volume":"272","author":"L Marinatto","year":"2000","unstructured":"Marinatto, L., Weber, T.: A quantum approach to static games of complete information. Phys. Lett. A 272, 291\u2013303 (2000)","journal-title":"Phys. Lett. A"},{"key":"6_CR28","first-page":"15","volume":"65","author":"D Mermin","year":"1990","unstructured":"Mermin, D.: Extreme quantum entanglement in a superposition of macroscopically distinct states. Phys. Rev. Lett. 65, 15 (1990)","journal-title":"Phys. Rev. Lett."},{"key":"6_CR29","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, 1052\u20131055 (1999)","journal-title":"Phys. Rev. Lett."},{"key":"6_CR30","first-page":"021047","volume":"4","author":"S Muhammad","year":"2014","unstructured":"Muhammad, S., Tavakoli, A., Kurant, M., Pawlowski, M., Zukowski, M., Bourennane, M.: Quantum bidding in bridge. Phys. Rev. X 4, 021047 (2014)","journal-title":"Phys. Rev. X"},{"key":"6_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Phoenix, S.J.D., Khan, F.S.: Preferences in quantum games. Phys. Lett. A 384(15) (2020)","DOI":"10.1016\/j.physleta.2020.126299"},{"issue":"3","key":"6_CR33","doi-asserted-by":"publisher","first-page":"1350011","DOI":"10.1142\/S0219477513500119","volume":"12","author":"SJD Phoenix","year":"2013","unstructured":"Phoenix, S.J.D., Khan, F.S.: The role of correlation in quantum and classical games. Fluct. Noise Lett. 12(3), 1350011 (2013)","journal-title":"Fluct. Noise Lett."},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-030-50433-5_38","volume-title":"Computational Science \u2013 ICCS 2020","author":"C Roch","year":"2020","unstructured":"Roch, C., et al.: A quantum annealing algorithm for finding pure Nash equilibria in graphical games. In: Krzhizhanovskaya, V.V., et al. (eds.) ICCS 2020. LNCS, vol. 12142, pp. 488\u2013501. Springer, Cham (2020). \n                    https:\/\/doi.org\/10.1007\/978-3-030-50433-5_38"},{"key":"6_CR35","first-page":"438","volume":"41","author":"RP Sprague","year":"1935","unstructured":"Sprague, R.P.: \u00dcber mathematische kampfspiele. Tohoku Math. J. 41, 438\u2013444 (1935)","journal-title":"Tohoku Math. J."},{"key":"6_CR36","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1023\/A:1018868326838","volume":"29","author":"L Vaidman","year":"1999","unstructured":"Vaidman, L.: Variations on the theme of the Greenberger-Horne-Zeilinger proof. Found. Phys. 29, 615 (1999). \n                    https:\/\/doi.org\/10.1023\/A:1018868326838","journal-title":"Found. Phys."},{"issue":"3","key":"6_CR37","first-page":"1","volume":"1","author":"RF Werner","year":"2001","unstructured":"Werner, R.F., Wolf, M.M.: Bell inequalities and entanglement. Quantum Inf. Comput. 1(3), 1\u201325 (2001)","journal-title":"Quantum Inf. Comput."},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"032112","DOI":"10.1103\/PhysRevA.64.032112","volume":"64","author":"RF Werner","year":"2001","unstructured":"Werner, R.F., Wolf, M.M.: All multipartite Bell correlation inequalities for two dichotomic observables per site. Phys. Rev. A 64, 032112 (2001)","journal-title":"Phys. Rev. A"},{"key":"6_CR39","unstructured":"Zhang, S.: Quantum Strategic Game Theory. \n                    arXiv:1012.5141\n                    \n                   (2010)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61739-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T23:29:26Z","timestamp":1602718166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61739-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617387","9783030617394"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61739-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irif.fr\/~rp2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}