Related papers: Environment-assisted quantum Minority games
The quantum entanglement is considered as one of the most important notions of quantum computing. The entanglement is a feature of quantum systems and it is used as a basis for many quantum algorithms and protocols. In this paper we analyze…
Due to decoherence, realistic quantum systems inevitably interact with the environment when quantum information is processed, which causes the loss of quantum properties. As a fundamental issue of quantum properties, quantum correlations…
Game theory is a very profound study on distributed decision-making behavior and has been extensively developed by many scholars. However, many existing works rely on certain strict assumptions such as knowing the opponent's private…
We consider quadratic, nonmonotone generalized Nash equilibrium problems with symmetric interactions among the agents. Albeit this class of games is known to admit a potential function, its formal expression can be unavailable in several…
We investigate how the efficiency of the quantum teleportation protocol is affected when the qubits involved in the protocol are subjected to noise or decoherence. We study all types of noise usually encountered in real world…
We examine the complementarity among coherence (visibility), predictability, and entanglement for qubit and qutrit systems subjected to noisy quantum channels. Using the system-path entanglement framework, analytical expressions for all…
We consider the decentralized power allocation and spectrum sharing problem in multi-user, multi-channel systems with strategic users. We present a mechanism/game form that has the following desirable features. (1) It is individually…
Quantum game theory has emerged as a promising candidate to further the understanding of quantum correlations. Motivated by this, it is demonstrated that pure strategy Nash equilibria can be utilised as a mechanism to witness and determine…
In this paper we study quantum communication channels with correlated noise effects, i.e., quantum channels with memory. We derive a model for correlated noise channels that includes a channel memory state. We examine the case where the…
We study Nash equilibria learning of a general-sum stochastic game with an unknown transition probability density function. Agents take actions at the current environment state and their joint action influences the transition of the…
This thesis is devoted to the study of quantum mechanical effects that arise in systems of reduced dimensionality. Specifically, we investigate coherence and correlation effects in quantum transport models. In the first part, we present a…
This article presents a comprehensive study of the impact of decoherence on the average correlation for pure quantum states. We explore two primary mechanisms of decoherence: phase damping and amplitude damping, each having distinct effects…
We use techniques from the statistical mechanics of disordered systems to analyse the properties of Nash equilibria of bimatrix games with large random payoff matrices. By means of an annealed bound, we calculate their number and analyse…
In this paper, we consider a mean field game (MFG) model perturbed by small common noise. Our goal is to give an approximation of the Nash equilibrium strategy of this game using a solution from the original no common noise MFG whose…
We study how strategic interaction can arise from controlled quantum dynamics rather than being imposed as an external mathematical structure. We introduce a class of interaction-defined quantum games in which players are represented by…
Entanglement is known to be an essential resource for many quantum information processes. However, it is now known that some quantum features may be acheived with quantum discord, a generalized measure of quantum correlation. In this paper,…
A quantum Cournot game of which classical form game has multiple Nash equilibria is examined. Although the classical equilibria fail to be Pareto optimal, the quantum equilibrium exhibits the following two properties, (i) if the measurement…
We derive sublinear-time quantum algorithms for computing the Nash equilibrium of two-player zero-sum games, based on efficient Gibbs sampling methods. We are able to achieve speed-ups for both dense and sparse payoff matrices at the cost…
Computing Nash equilibria of zero-sum games in classical and quantum settings is extensively studied. For general-sum games, computing Nash equilibria is PPAD-hard and the computing of a more general concept called correlated equilibria has…
Feedback Nash equilibrium strategies in multi-agent dynamic games require availability of all players' state information to compute control actions. However, in real-world scenarios, sensing and communication limitations between agents make…