Searcharxiv⌕ Search

arXiv subjects

Azhar Iqbal

Publications and source records attributed to Azhar Iqbal.

At least 37 records · Page 2Linked to original sources

Social optimality in quantum Bayesian games

A significant aspect of the study of quantum strategies is the exploration of the game-theoretic solution concept of the Nash equilibrium in relation to the quantization of a game. Pareto optimality is a refinement on the set of Nash equilibria. A refinement on the set of Pareto optimal outcomes is known as social optimality in which the sum of players' payoffs are maximized. This paper analyzes social optimality in a Bayesian game that uses the setting of generalized Einstein-Podolsky-Rosen experiments for its physical implementation. We show that for the quantum Bayesian game a direct connection appears between the violation of Bell's inequality and the social optimal outcome of the game and that it attains a superior socially optimal outcome.

quant-ph↗

A probabilistic approach to quantum Bayesian games of incomplete information

A Bayesian game is a game of incomplete information in which the rules of the game are not fully known to all players. We consider the Bayesian game of Battle of Sexes that has several Bayesian Nash equilibria and investigate its outcome when the underlying probability set is obtained from generalized Einstein-Podolsky-Rosen experiments. We find that this probability set, which may become non-factorizable, results in a unique Bayesian Nash equilibrium of the game.

quant-ph↗

Functions of multivector variables

As is well known, the common elementary functions defined over the real numbers can be generalized to act not only over the complex number field but also over the skew (non-commuting) field of the quaternions. In this paper, we detail a number of elementary functions extended to act over the skew field of Clifford multivectors, in both two and three dimensions. Complex numbers, quaternions and Cartesian vectors can be described by the various components within a Clifford multivector and from our results we are able to demonstrate new inter-relationships between these algebraic systems. One key relationship that we discover is that a complex number raised to a vector power produces a quaternion thus combining these systems within a single equation. We also find a single formula that produces the square root, amplitude and inverse of a multivector over one, two and three dimensions. Finally, comparing the functions over different dimension we observe that $ C\ell \left (\Re^3 \right) $ provides a particularly versatile algebraic framework.

math.RA↗

An explanation for galaxy rotation curves using a Clifford multivector spacetime framework

We explore the consequences of space and time described within the Clifford multivector of three dimensions $ Cl_{3,0}$, where space consists of three-vectors and time is described with the three bivectors of this space. When describing the curvature around massive bodies, we show that this model of spacetime when including the Hubble expansion naturally produces the correct galaxy rotation curves without the need for dark matter.

math-ph↗

The gravitational field of a cube

Large astronomical objects such as stars or planets, produce approximately spherical shapes due to the large gravitational forces, and if the object is rotating rapidly, it becomes an oblate spheroid. In juxtaposition to this, we conduct a thought experiment regarding the properties of a planet being in the form of a perfect cube. We firstly calculate the gravitational potential and from the equipotentials, we deduce the shape of the lakes that would form on the surface of such an object. We then consider the formation of orbits around such objects both with a static and a rotating cube. A possible practical application of these results is that, because cuboid objects can be easily stacked together, we can calculate the field of more complicated shapes, using the principle of superposition, by simply adding the field from a set of component shapes.

physics.class-ph↗

Revisiting special relativity: A natural algebraic alternative to Minkowski spacetime

Minkowski famously introduced the concept of a space-time continuum in 1908, merging the three dimensions of space with an imaginary time dimension $ i c t $, with the unit imaginary producing the correct spacetime distance $ x^2 - c^2 t^2 $, and the results of Einstein's then recently developed theory of special relativity, thus providing an explanation for Einstein's theory in terms of the structure of space and time. As an alternative to a planar Minkowski space-time of two space dimensions and one time dimension, we replace the unit imaginary $ i = \sqrt{-1} $, with the Clifford bivector $ ι= e_1 e_2 $ for the plane that also squares to minus one, but which can be included without the addition of an extra dimension, as it is an integral part of the real Cartesian plane with the orthonormal basis $ e_1 $ and $ e_2 $. We find that with this model of planar spacetime, using a two-dimensional Clifford multivector, the spacetime metric and the Lorentz transformations follow immediately as properties of the algebra. This also leads to momentum and energy being represented as components of a multivector and we give a new efficient derivation of Compton's scattering formula, and a simple formulation of Dirac's and Maxwell's equations. Based on the mathematical structure of the multivector, we produce a semi-classical model of massive particles, which can then be viewed as the origin of the Minkowski spacetime structure and thus a deeper explanation for relativistic effects. We also find a new perspective on the nature of time, which is now given a precise mathematical definition as the bivector of the plane.

physics.class-ph↗

N-player quantum games in an EPR setting

The $N$-player quantum game is analyzed in the context of an Einstein-Podolsky-Rosen (EPR) experiment. In this setting, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical choice between two directions along which spin or polarization measurements are made. The players' strategies thus remain identical to their strategies in the mixed-strategy version of the classical game. In the EPR setting the quantum game reduces itself to the corresponding classical game when the shared quantum state reaches zero entanglement. We find the relations for the probability distribution for $N$-qubit GHZ and W-type states, subject to general measurement directions, from which the expressions for the mixed Nash equilibrium and the payoffs are determined. Players' payoffs are then defined with linear functions so that common two-player games can be easily extended to the $N$-player case and permit analytic expressions for the Nash equilibrium. As a specific example, we solve the Prisoners' Dilemma game for general $ N \ge 2 $. We find a new property for the game that for an even number of players the payoffs at the Nash equilibrium are equal, whereas for an odd number of players the cooperating players receive higher payoffs.

quant-ph↗

An improved formalism for the Grover search algorithm

The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is of significant interest to describe it in the most efficient mathematical formalism. We show firstly, that Clifford's formalism of geometric algebra, provides a significantly more efficient representation than the conventional Bra-ket notation, and secondly, that the basis defined by the states of maximum and minimum weight in the Grover search space, allows a simple visualization of the Grover search as the precession of a spin-1/2 particle. Using this formalism we efficiently solve the exact search problem, as well as easily representing more general search situations.

quant-ph↗

Quantum Strategies Win in a Defector-Dominated Population

Quantum strategies are introduced into evolutionary games. The agents using quantum strategies are regarded as invaders whose fraction generally is 1% of a population in contrast to the 50% defectors. In this paper, the evolution of strategies on networks is investigated in a defector-dominated population, when three networks (Regular Lattice, Newman-Watts small world network, scale-free network) are constructed and three games (Prisoners' Dilemma, Snowdrift, Stag-Hunt) are employed. As far as these three games are concerned, the results show that quantum strategies can always invade the population successfully. Comparing the three networks, we find that the regular lattice is most easily invaded by agents that adopt quantum strategies. However, for a scale-free network it can be invaded by agents adopting quantum strategies only if a hub is occupied by an agent with a quantum strategy or if the fraction of agents with quantum strategies in the population is significant.

cs.GT↗

Analyzing three-player quantum games in an EPR type setup

We use the formalism of Clifford Geometric Algebra (GA) to develop an analysis of quantum versions of three-player non-cooperative games. The quantum games we explore are played in an Einstein-Podolsky-Rosen (EPR) type setting. In this setting, the players' strategy sets remain identical to the ones in the mixed-strategy version of the classical game that is obtained as a proper subset of the corresponding quantum game. Using GA we investigate the outcome of a realization of the game by players sharing GHZ state, W state, and a mixture of GHZ and W states. As a specific example, we study the game of three-player Prisoners' Dilemma.

quant-ph↗

Analysis of two-player quantum games in an EPR setting using geometric algebra

The framework for playing quantum games in an Einstein-Podolsky-Rosen (EPR) type setting is investigated using the mathematical formalism of Clifford geometric algebra (GA). In this setting, the players' strategy sets remain identical to the ones in the classical mixed-strategy version of the game, which is then obtained as proper subset of the corresponding quantum game. As examples, using GA we analyze the games of Prisoners' Dilemma and Stag Hunt when played in the EPR type setting.

quant-ph↗

A Precise Error Bound for Quantum Phase Estimation

Quantum phase estimation is one of the key algorithms in the field of quantum computing, but up until now, only approximate expressions have been derived for the probability of error. We revisit these derivations, and find that by ensuring symmetry in the error definitions, an exact formula can be found. This new approach may also have value in solving other related problems in quantum computing, where an expected error is calculated. Expressions for two special cases of the formula are also developed, in the limit as the number of qubits in the quantum computer approaches infinity and in the limit as the extra added qubits to improve reliability goes to infinity. It is found that this formula is useful in validating computer simulations of the phase estimation procedure and in avoiding the overestimation of the number of qubits required in order to achieve a given reliability. This formula thus brings improved precision in the design of quantum computers.

quant-ph↗

A simplified approach to electromagnetism using geometric algebra

A new simplified approach for teaching electromagnetism is presented using the formalism of geometric algebra (GA) which does not require vector calculus or tensor index notation, thus producing a much more accessible presentation for students. The four-dimensional spacetime proposed is completely symmetrical between the space and time dimensions, thus fulfilling Minkowski's original vision. In order to improve student reception we also focus on forces and the conservation of energy and momentum, which take a very simple form in GA, so that students can easily build on established intuitions in using these laws developed from studying Newtonian mechanics. The potential formulation is also integrated into the presentation that allows an alternate solution path, as well as an introduction to the Lagrangian approach. Several problems are solved throughout the text to make the implementation clear. We extend previous treatment of this area, through including the potential formulation, the conservation of energy and momentum, the generalization for magnetic monopoles, as well as simplifying previously reported results through eliminating the need for the spacetime metric.

physics.ed-ph↗

Constructing quantum games from symmetric non-factorizable joint probabilities

We construct quantum games from a table of non-factorizable joint probabilities, coupled with a symmetry constraint, requiring symmetrical payoffs between the players. We give the general result for a Nash equilibrium and payoff relations for a game based on non-factorizable joint probabilities, which embeds the classical game. We study a quantum version of Prisoners' Dilemma, Stag Hunt, and the Chicken game constructed from a given table of non-factorizable joint probabilities to find new outcomes in these games. We show that this approach provides a general framework for both classical and quantum games without recourse to the formalism of quantum mechanics.

quant-ph↗

Constructing quantum games from a system of Bell's inequalities

We report constructing quantum games directly from a system of Bell's inequalities using Arthur Fine's analysis published in early 1980s. This analysis showed that such a system of inequalities forms a set of both necessary and sufficient conditions required to find a joint distribution function compatible with a given set of joint probabilities, in terms of which the system of Bell's inequalities is usually expressed. Using the setting of a quantum correlation experiment for playing a quantum game, and considering the examples of Prisoners' Dilemma and Matching Pennies, we argue that this approach towards constructing quantum games addresses some of their well known criticisms.

quant-ph↗

Non-factorizable Joint Probabilities and Evolutionarily Stable Strategies in the Quantum Prisoner's Dilemma Game

The well known refinement of the Nash Equilibrium (NE) called an Evolutionarily Stable Strategy (ESS) is investigated in the quantum Prisoner's Dilemma (PD) game that is played using an Einstein-Podolsky-Rosen type setting. Earlier results report that in this scheme the classical NE remains intact as the unique solution of the quantum PD game. In contrast, we show here that interestingly in this scheme a non-classical solution for the ESS emerges for the quantum PD.

quant-ph↗

An Analysis of the Quantum Penny Flip Game using Geometric Algebra

We analyze the quantum penny flip game using geometric algebra and so determine all possible unitary transformations which enable the player Q to implement a winning strategy. Geometric algebra provides a clear visual picture of the quantum game and its strategies, as well as providing a simple and direct derivation of the winning transformation, which we demonstrate can be parametrized by two angles. For comparison we derive the same general winning strategy by conventional means using density matrices.

quant-ph↗

Quantum Matching Pennies Game

A quantum version of the Matching Pennies (MP) game is proposed that is played using an Einstein-Podolsky-Rosen-Bohm (EPR-Bohm) setting. We construct the quantum game without using the state vectors, while considering only the quantum mechanical joint probabilities relevant to the EPR-Bohm setting. We embed the classical game within the quantum game such that the classical MP game results when the quantum mechanical joint probabilities become factorizable. We report new Nash equilibria in the quantum MP game that emerge when the quantum mechanical joint probabilities maximally violate the Clauser-Horne-Shimony-Holt form of Bell's inequality.

quant-ph↗