Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Implementation of quantum game theory simulations using Python

A. Madrid S.

Published May 28, 2013• 0 citations

Abstract

This paper provides some examples about quantum games simulated in Python’s programming language. The quantum games have been developed with the Sympy Python library, which permits solving quantum problems in a symbolic form. The application of these methods of quantum mechanics to game theory gives us more possibility to achieve results not possible before. To illustrate the results of these methods, in particular, there have been simulated the quantum battle of the sexes, the prisoner’s dilemma and card games. These solutions are able to exceed the classic bottle neck and obtain optimal quantum strategies. In this form, python demonstrated that is possible to do more advanced and complicated quantum games algorithms.

DOI: 10.1117/12.2015266

Related papers

Quantum Game Theory

Zibo Wang

Game theory has wide implementation on many fields of study. With more recent development in quantum computation and quantum information, we are able to study games with rule of quantum mechanics. This paper consists two part: in first part, basic knowledge of game theory is briefly recalled, and prisoner’s dilemma is introduced; in second part, how quantum version game is differ from classical is discussed, and an analysis quantum version of prisoner’s dilemma is presented.

Nov 1, 20190 citations

Experimental Implementation of Quantum Prisoner Dilemma on IBM Quantum Computers

Kanyangzi Xu, Zhe Wu

Theory of games is an important discipline of applied mathematics, which has found numerous applications in psychology, ecology, and social science. While a well-established framework has been established for classical game theory, extending, and generalizing it towards the quantum domain still has some open questions. In this project, we focus on the prisoner’s dilemma-a standard example of a game analyzed in game theory-in a quantum world. Here, we start with the quantum version of prisoner’s dilemma, explain the quantum circuit implementation for describing the behavior of quantum prisoners, and investigate how quantum entanglement can change their strategies. By using the IBM quantum computer, we experimentally study the quantum prisoner dilemma, and we conclude that the best quantum strategies will break the prisoner’s dilemma.

International Conference on Advanced Computer Theory and EngineeringSep 23, 20220 citations

How Quantum Prisoner’s Dilemma Can Support Negotiations

M. Szopa

Decision-making by the two negotiating parties is simulated by a prisoner's dilemma game.The game is formulated in a quantum manner, where players strategies are unitary transformations of qubits built over the basis of opposite decision options.Quantum strategies are correlated through the mechanism of quantum entanglement and the result of the game is obtained by the collapse of the resulting transformed state.The range of strategies allowed for quantum players is richer than in case of a classical game and therefore the result of the game can be better optimized.On the other hand, the quantum game is save against eavesdropping and the players can be assured that this type of quantum arbitration is fair.We show that quantum prisoner's dilemma has more favorable Nash equilibria than its classical analog and they are close to the Pareto optimal solutions.Some economical examples of utilizing quantum game Nash equilibria are proposed.

Optimum Economic StudiesJan 1, 20146 citations

Application of Game-theoretic Techniques to Quantum Information Theory

Muhammad Asif Ramzan

This work is mainly based on quantum game-theoretic techniques and their application to quantum information theory.Quantum game theory is an important development in quantum computation and may have implications for quantum information and quantum communication.The select of quantum memory on quantum games have been studied.Three di􀀞erent games such as, Prisoner Dilemma, Battle of the Sexes and Chicken have been analyzed in the quantum domain. By considering the restricted game \nsituation, it is shown that the ects of quantum memory and decoherence become e􀀞ective in a maximally entangled case.For which the quantum player can out perform the classical player in all the three games. It is also shown that the quantum player enjoys an advantage over the classical player in Battle of the Sexes game for the amplitude-damping and the depolarizing channels.The quantum memory compensates the reduction in player pay is due to decoherence. It has no ect on the Nash equilibria of the three games.A generalization of two-player quantization scheme to a three-player Prisoners Dilemma game under the ect of correlated noise is also presented.In a restricted game scenario, it is shown the quantumplayer is always better; for all values of the decoherence parameter for the entire range of memory parameter.It is seen that for maximum degree of correlation, the game does not become \nnoiseless and quantum player can still outscore the classical players for the entire range of the decoherence parameter producing an interesting result in comparison with a two-player quantum game.It is also shown that correlated noise has not on the Nash equilibrium of the game.By exploiting the three-player quantization scheme, we have studiedthe communication aspects of a three-player Prisoner Dilemma quantum game. It is shown that entanglement plays a dominant role in a three-player quantum game.On the baois of initial state and the measurement basis entanglement parameters, a relation among different pay is established.It is investigated that the strategies of the players act as information carriers in quantum games. A relationship for the information shared among the parties is also established.A scheme for quantum key distribution is proposed in which a secret key can be generated from the data coming through a partially entanglement breaking channel.This scheme is rather deterministic andcient in the sense that two classical bits can be transferred \nper entangled pair of qubits.Furthermore, it is important to point out that, in this scheme, same symbol can be used for Eve detection and key generation. It is also worth noting that the eavesdropper, Eve, can be detected very easily from the disturbance of the elements of the decoding bimatrix. We have checked for the \nsecurity of the scheme and found it secure against individual attacks.It is further investigated that quantum games are useful in developing quantum cryptographic protocols.A multiparty quantum cryptographic protocol using tripartite entangled GHZ states is devised using game-theoretic techniques.In this protocol, two classical bits can be transferred per entangled pair of qubits to the communicating parties.Unitary operators applied by the sender on a tripartite entangled state encodes a classical symbol that can be decoded at receiver end with the help of a decoding matrix. In this protocol, if Eve interferes during the transmission, she can be detected by the disturbance of the decoding matrix. Our security analysis shows that this protocol is also secure against intercept/re-send attacks.

Jan 1, 20100 citations

Battle of the Sexes: A Quantum Games Theory Approach

J. R.

Real life situations where there are strategies to be chosen in order to obtain a profit can be reproduced by games, so game theory is a way to describe the evolution of possible scenarios where players can select a scheme of play. Game theory takes importance in many areas, such as people decisions making, where their choices do affect others benefit (Davis, 1970; Myerson, 1991). It is to remark that the principles of game theory were initiated by trying to understand the behavior of economic strategies, however Von Neumann presented the concept of modern game theory in 1944 (Von Neumann & Morgenstern, 1947). Quantum mechanics is a tool that creates another point of view for the traditional game theory due to multiple strategies offered for the players, whom possibilities are numerously expanded in contrast of classical ones (Eisert & Wilkens, 2000). There are also games where the player who uses quantum strategies, enhances his payoffs or even always wins against a player who only uses classical moves (Meyer, 1999). It is to remark that there are plenty of applications for quantum game theory such as quantum cryptography and computation, economics and biology (Piotrowski & Sladkowski, 2003; Hanauske et al.,2009). The Battle of the Sexes game is a largely analyzed problem, based on two players: Alice and Bob and their choice about an activity for a Saturday night with each other. It is pretty important to remark that both want the best possible payoff in the decision, so the game can be developed normally, otherwise it would not be our case. Alice, really loves Opera, but wants to be with Bob; Bob likes Football but he wants to have Alice’s company along the activity. This game has a lot of applications in real life scenarios such as the spread of some type of genes from a reproduction between two organisms (Dawkins, 2006); another interesting application is neuroeconomics (Montague & Berns, 2002), where brain studies have been done in order to incite neurons to choose either to “work” for a reward or to “shirk” (Glimcher, 2003).

InTech eBooksFeb 22, 20120 citations

A compact program code for simulations of quantum algorithms in classical computers

P. Nyman

A general quantum simulation language on a classical computer provides the opportunity to compare an experiential result from the development of quantum computers with mathematical theory. The intention of this research is to develop a program language that is able to make simulations of all quantum algorithms in same framework. This study examines the simulation of quantum algorithms on a classical computer with a symbolic programming language. We use the language Mathematica to make simulations of well-known quantum algorithms. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. This gives us an uncomplicated and clear language for the implementations of algorithms. The computational language includes essential formulations such as quantum state, superposition and quantum operator. This symbolic programming language provides a universal framework for examining the existing as well as future quantum algorithms. This study contributes with an implementation of a quantum algorithm in a program code where the substance is applicable in other simulations of quantum algorithms.

Laser PhysicsFeb 1, 20091 citation