Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Multiplayer conflict avoidance through entangled quantum walks

Honoka Shiratori1, Tomoki Yamagami2,*, Etsuo Segawa3, Takatomo Mihana1, André Röhm1, and Ryoichi Horisaki1

  • 1Department of Information Physics and Computing, Graduate School of Information Science and Technology, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan
  • 2Department of Information and Computer Sciences, Saitama University, 255 Shimo-okubo, Sakura-ku, Saitama City, Saitama 338-8570, Japan
  • 3Graduate School of Environment and Information Sciences, Yokohama National University, 79-1 Tokiwadai, Hodogaya-ku, Yokohama, Kanagawa 240-8501, Japan

  • *Contact author: tyamagami@mail.saitama-u.ac.jp

Phys. Rev. A 112, 062439 – Published 19 December, 2025

DOI: https://doi.org/10.1103/zxx8-j2d4

Abstract

Quantum computing has the potential to solve complex problems faster and more efficiently than classical computing. It can achieve speedups by leveraging quantum phenomena like superposition, entanglement, and tunneling. Quantum walks (QWs) form the foundation for many quantum algorithms. Unlike classical random walks, QWs exhibit quantum interference, leading to unique behaviors such as linear spreading and localization. These properties make QWs valuable for various applications, including universal computation, time series prediction, encryption, and quantum hash functions. One emerging application of QWs is decision-making. Previous research has used QWs to model human decision processes and solve multiarmed bandit problems. This paper extends QWs to collective decision-making, focusing on minimizing decision conflicts, cases where multiple agents choose the same option, leading to inefficiencies like traffic congestion or overloaded servers. Prior research using quantum interference has addressed two-player conflict avoidance but struggled with three-player scenarios. This paper proposes a method using QWs to entirely eliminate decision conflicts in three-player cases, demonstrating its effectiveness in collective decision-making.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (42)

  1. A. Mehonic and A. J. Kenyon, Brain-inspired computing needs a master plan, Nature (London) 604, 255 (2022).
  2. F. Meier and H. Yamasaki, Energy-consumption advantage of quantum computation, PRX Energy 4, 023008 (2025).
  3. L. K. Grover, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, 1996 (ACM, New York, 1996), pp. 212–219.
  4. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computing, SIAM J. Comput. 26, 1510 (1997).
  5. A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009).
  6. P. Shor, Proceedings 35th Annual Symposium on Foundations of Computer Science, Sante Fe, 1994 (IEEE, Piscataway, 1994), pp. 124–134.
  7. B. L. Douglas and J. B. Wang, Efficient quantum circuit implementation of quantum walks, Phys. Rev. A 79, 052335 (2009).
  8. F. Magniez, A. Nayak, J. Roland, and M. Santha, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, 2007 (ACM, New York, 2007), pp. 575–584.
  9. V. Kendon, Where to quantum walk, arXiv:1107.3795.
  10. N. Konno, in Quantum Potential Theory, edited by U. Franz and M. Schürmann, Lecture Notes in Mathematics Vol. 1954 (Springer, Berlin, 2008), pp. 309–452.
  11. A. M. Childs, Universal computation by quantum walk, Phys. Rev. Lett. 102, 180501 (2009).
  12. N. Konno, A new time-series model based on quantum walk, Quantum Stud.: Math. Found. 6, 61 (2019).
  13. A. A. Abd EL-Latif, B. Abd-El-Atty, and S. E. Venegas-Andraca, A novel image steganography technique based on quantum substitution boxes, Opt. Laser Technol. 116, 92 (2019).
  14. B. Abd-El-Atty, A. A. Abd El-Latif, and S. E. Venegas-Andraca, An encryption protocol for NEQR images based on one-particle quantum walks on a circle, Quantum Inf. Process. 18, 272 (2019).
  15. Y.-G. Yang, P. Xu, R. Yang, Y.-H. Zhou, and W.-M. Shi, Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption, Sci. Rep. 6, 19788 (2016).
  16. I. Martínez-Martínez and E. Sánchez-Burillo, Quantum stochastic walks on networks for decision-making, Sci. Rep. 6, 23812 (2016).
  17. Q. Zhang and J. Busemeyer, A quantum walk model for idea propagation in social network and group decision making, Entropy 23, 622 (2021).
  18. J. R. Busemeyer, Z. Wang, and J. T. Townsend, Quantum dynamics of human decision-making, J. Math. Psychol. 50, 220 (2006).
  19. F. Yan, W. Liang, and K. Hirota, An information propagation model for social networks based on continuous-time quantum walk, Neural Comput. Appl. 34, 13455 (2022).
  20. T. Yamagami, E. Segawa, T. Mihana, A. Röhm, R. Horisaki, and M. Naruse, Bandit algorithm driven by a classical random walk and a quantum walk, Entropy 25, 843 (2023).
  21. J. Du, H. Li, X. Xu, M. Shi, J. Wu, X. Zhou, and R. Han, Experimental implementation of the quantum random-walk algorithm, Phys. Rev. A 67, 042316 (2003).
  22. M. Karski, L. Förster, J.-M. Choi, A. Steffen, W. Alt, D. Meschede, and A. Widera, Quantum walk in position space with single optically trapped atoms, Science 325, 174 (2009).
  23. F. Zähringer, G. Kirchmair, R. Gerritsma, E. Solano, R. Blatt, and C. F. Roos, Realization of a quantum walk with one and two trapped ions, Phys. Rev. Lett. 104, 100503 (2010).
  24. B. Do, M. L. Stohler, S. Balasubramanian, D. S. Elliott, C. Eash, E. Fischbach, M. A. Fischbach, A. Mills, and B. Zwickl, Experimental realization of a quantum quincunx by use of linear optical elements, J. Opt. Soc. Am. B 22, 499 (2005).
  25. H. B. Perets, Y. Lahini, F. Pozzi, M. Sorel, R. Morandotti, and Y. Silberberg, Realization of quantum walks with negligible decoherence in waveguide lattices, Phys. Rev. Lett. 100, 170506 (2008).
  26. A. Peruzzo, M. Lobino, J. C. F. Matthews, N. Matsuda, A. Politi, K. Poulios, X.-Q. Zhou, Y. Lahini, N. Ismail, K. Wörhoff, Y. Bromberg, Y. Silberberg, M. G. Thompson, and J. L. O'Brien, Quantum walks of correlated photons, Science 329, 1500 (2010).
  27. D. T. Nguyen, D. A. Nolan, and N. F. Borrelli, Localized quantum walks in quasi-periodic Fibonacci arrays of waveguides, Opt. Express 27, 886 (2019).
  28. C. Taballione, T. A. W. Wolterink, J. Lugani, A. Eckstein, B. A. Bell, R. Grootjans, I. Visscher, D. Geskus, C. G. H. Roeloffzen, J. J. Renema, I. A. Walmsley, P. W. H. Pinkse, and K.-J. Boller, 8×8 reconfigurable quantum photonic processor based on silicon nitride waveguides, Opt. Express 27, 26842 (2019).
  29. R. Konoike, A. Yoshizawa, S. Namiki, and K. Ikeda, Demonstration of 8-step single-photon quantum walk using 32 × 32 reconfigurable silicon photonics switch, in 2020 Conference on Lasers and Electro-Optics (CLEO) (IEEE, San Jose, CA, USA, 2020), pp. 1–2.
  30. W. Lin, X. Zhou, G. P. Wang, and C. T. Chan, Spatial Bloch oscillations of plasmons in nanoscale metal waveguide arrays, Appl. Phys. Lett. 91, 243113 (2007).
  31. A. Block, C. Etrich, T. Limboeck, F. Bleckmann, E. Soergel, C. Rockstuhl, and S. Linden, Bloch oscillations in plasmonic waveguide arrays, Nat. Commun. 5, 3843 (2014).
  32. J. Ren, T. Chen, and X. Zhang, Long-lived quantum speedup based on plasmonic hot spot systems, New J. Phys. 21, 053034 (2019).
  33. W. Lin and W. Wang, The spatial plasmonic Bloch oscillations in nanoscale three-dimensional surface plasmon polaritons metal waveguide arrays, Opt. Express 27, 24591 (2019).
  34. T. W. Ebbesen, C. Genet, and S. I. Bozhevolnyi, Surface-plasmon circuitry, Phys. Today 61(5), 44 (2008).
  35. Y. Liu, J. Zhang, H. Liu, S. Wang, and L.-M. Peng, Electrically driven monolithic subwavelength plasmonic interconnect circuits, Sci. Adv. 3, e1701456 (2017).
  36. N. Namekata, D. Wu, H. Hagihara, S. Ohnuki, D. Fukuda, and S. Inoue, Continuous quantum walk in a 1-dimensional plasmonic lattice structure based on metal strip waveguides, Opt. Express 29, 24899 (2021).
  37. G. Fujii, T. Segawa, S. Mori, N. Namekata, D. Fukuda, and S. Inoue, Preservation of photon indistinguishability after transmission through surface-plasmon-polaritons waveguide, Opt. Lett. 37, 1535 (2012).
  38. T. Sakaidani, R. Kobayashi, N. Namekata, G. Fujii, D. Fukuda, and S. Inoue, Investigation of third-order dispersion of long-range surface-plasmon-polaritons waveguides using a Hong-Ou-Mandel interferometer, Opt. Express 25, 9490 (2017).
  39. H. S. Won, K. C. Kim, S. H. Song, C.-H. Oh, P. S. Kim, S. Park, and S. I. Kim, Vertical coupling of long-range surface plasmon polaritons, Appl. Phys. Lett. 88, 011110 (2006).
  40. T. Amakasu, N. Chauvet, G. Huant, R. Horisaki, and M. Naruse, Conflict-free collective stochastic decision making by orbital angular momentum of photons through quantum interference, Sci. Rep. 11, 21117 (2021).
  41. R. Portugal, Quantum Walks and Search Algorithms (Springer, Berlin, 2013), Vol. 19.
  42. S. Goswami, P. Sen, and A. Das, Quantum persistence: A random-walk scenario, Phys. Rev. E 81, 021121 (2010).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation