



01552nas a2200169   4500008004100000245007500041210006900116520100400185100001901189700002301208700002201231700002401253700002401277700002001301700002401321856003701345       2018                        eng d00aDemonstration of Bayesian quantum game on an ion trap quantum computer0 aDemonstration of Bayesian quantum game on an ion trap quantum co3 a<p><span style="color: rgb(51, 51, 51); font-family: &quot;Open Sans&quot;, &quot;Lucida Grande&quot;, &quot;Helvetica Neue&quot;, Helvetica, Arial, sans-serif; font-size: 14px;">We demonstrate a Bayesian quantum game on an ion trap quantum computer with five qubits. The players share an entangled pair of qubits and perform rotations on their qubit as the strategy choice. Two five-qubit circuits are sufficient to run all 16 possible strategy choice sets in a game with four possible strategies. The data are then parsed into player types randomly in order to combine them classically into a Bayesian framework. We exhaustively compute the possible strategies of the game so that the experimental data can be used to solve for the Nash equilibria of the game directly. Then we compare the payoff at the Nash equilibria and location of phase-change-like transitions obtained from the experimental data to the theory, and study how it changes as a function of the amount of entanglement.</span></p>1 aSolmeyer, Neal1 aLinke, Norbert, M.1 aFiggatt, Caroline1 aLandsman, Kevin, A.1 aBalu, Radhakrishnan1 aSiopsis, George1 aMonroe, Christopher  uhttps://arxiv.org/abs/1802.08116