Behavior of Multi-Agent Protocols Using Quantum Entanglement

We describe how entangled quantum states can aid in coordination, cooperation and resource allocation in multi-agent systems. These protocols provide alternatives to conventional methods, with different trade-offs of capabilities and information privacy. We also present results of human-subject experiments with simulated versions of some of these methods, showing people can learn to use entangled states effectively without training in quantum mechanics. Thus these quantum protocols are suitable for mixed systems consisting of human and software agents. These techniques are beneficial with even a few bits and operations, making their physical implementation much easier than quantum applications to hard computational problems such as factoring

[1]  A. Ijspeert,et al.  A Macroscopic Analytical Model of Collaboration in Distributed Robotic Systems , 2002, Artificial Life.

[2]  Tad Hogg,et al.  A Quantum Treatment of Public Goods Economics , 2002, Quantum Inf. Process..

[3]  Hui Li,et al.  Entanglement enhanced multiplayer quantum games , 2002 .

[4]  T. Hogg,et al.  Experimental implementation of an adiabatic quantum optimization algorithm. , 2003, Physical review letters.

[5]  E. Farhi,et al.  A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.

[6]  Frederick W. Rankin,et al.  On the Origin of Convention: Evidence from Coordination Games , 1997 .

[7]  Robert Axelrod,et al.  The Evolution of Strategies in the Iterated Prisoner's Dilemma , 2001 .

[8]  Timothy P. Spiller,et al.  Towards a quantum information technology industry , 2006 .

[9]  L. Vandersypen,et al.  Implementation of a three-quantum-bit search algorithm , 1999, quant-ph/9910075.

[10]  Li Zhang,et al.  REDUCED ENTANGLEMENT FOR QUANTUM GAMES , 2003 .

[11]  Thomas R. Palfrey,et al.  Laboratory research in political economy , 1991 .

[12]  Tad Hogg,et al.  Quantum Auctions , 2007, 0704.0800.

[13]  Colin Camerer Behavioral Game Theory: Experiments in Strategic Interaction , 2003 .

[14]  Moni Naor,et al.  Privacy preserving auctions and mechanism design , 1999, EC '99.

[15]  Tad Hogg,et al.  How Well Do People Play a Quantum Prisoner’s Dilemma? , 2006, Quantum Inf. Process..

[16]  D. Meyer Quantum strategies , 1998, quant-ph/9804010.

[17]  T. Hogg Adiabatic Quantum Computing for Random Satisfiability Problems , 2002, quant-ph/0206059.

[18]  Jens Eisert,et al.  Quantum games , 2020, Understanding Game Theory.

[19]  R. Aumann Subjectivity and Correlation in Randomized Strategies , 1974 .

[20]  B. Huberman,et al.  THE DYNAMICS OF SOCIAL DILEMMAS , 1994 .

[21]  M. Shahriar,et al.  Teleportation and the Quantum Internet , 2022 .

[22]  Lov K. Grover Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[23]  J. Eisert,et al.  Quantum Games and Quantum Strategies , 1998, quant-ph/9806088.

[24]  J. Kagel,et al.  Handbook of Experimental Economics , 1997 .

[25]  Colin Camerer,et al.  A Cognitive Hierarchy Model of Games , 2004 .

[26]  Simon C. Benjamin,et al.  Multiplayer quantum games , 2001 .

[27]  Tad Hogg,et al.  Quantum Solution of Coordination Problems , 2003, Quantum Inf. Process..

[28]  S. J. van Enk,et al.  Classical rules in quantum games , 2002 .

[29]  T. Schelling The Strategy of Conflict , 1963 .

[30]  H. Rosenthal,et al.  Digitized by the Internet Archive in 2011 With^ Funding from Testing Game-theoretic Models of Free Riding: New Evidence on Probability Bias and Learning , 2022 .

[31]  Jiangfeng Du,et al.  Experimental realization of quantum games on a quantum computer. , 2001, Physical Review Letters.

[32]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[33]  Pierfrancesco La Mura Correlated Equilibria of Classical Strategic Games with Quantum Signals , 2003, ArXiv.

[34]  N. Swamy,et al.  Finding a better-than-classical quantum AND/OR algorithm using genetic programming , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[35]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[36]  N. Gisin,et al.  Quantum key distribution over 67 km with a plug , 2002 .

[37]  T. Schelling,et al.  The Strategy of Conflict. , 1961 .

[38]  Umesh V. Vazirani,et al.  How powerful is adiabatic quantum computation? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[39]  Colin Camerer Individual Decision Making , 2020, The Handbook of Experimental Economics.

[40]  A. Zeilinger,et al.  High-efficiency Quantum Interrogation Measurements via the Quantum Zeno Effect , 1999, quant-ph/9909083.

[41]  G. Hardin,et al.  The Tragedy of the Commons , 1968, Green Planet Blues.