相关论文: Chain-rules for channel capacity

In this letter, we prove that the classical capacity of quantum channel for $M$ symmetric states is achieved by an uniform distribution on a priori probabilities. We also investigate non-symmetric cases such as a ternary amplitude shift…

We identify structural assumptions which provide solvability of the Nash system arising from a linear-quadratic closed-loop game, with stable properties with respect to the number of players. In a setting of interactions governed by a…

Correlated equilibria are sometimes more efficient than the Nash equilibria of a game without signals. We investigate whether the availability of quantum signals in the context of a classical strategic game may allow the players to achieve…

The capacity of noisy quantum channels characterizes the highest rate at which information can be reliably transmitted and it is therefore of practical as well as fundamental importance. Capacities of classical channels are computed using…

Recently the theory of communication developed by Shannon has been extended to the quantum realm by exploiting the rules of quantum theory. This latter stems on complex vector spaces. However complex (as well as real) numbers are just…

Nash equilibrium is the most commonly-used notion of equilibrium in game theory. However, it suffers from numerous problems. Some are well known in the game theory community; for example, the Nash equilibrium of repeated prisoner's dilemma…

For any two-by-two game $\G$, we define a new two-player game $\G^Q$. The definition is motivated by a vision of players in game $\G$ communicating via quantum technology according to a certain standard protocol originally introduced by…

The interaction of competing agents is described by classical game theory. It is now well known that this can be extended to the quantum domain, where agents obey the rules of quantum mechanics. This is of emerging interest for exploring…

The two-players N strategies games quantized according to the Eisert-Lewenstein-Wilkens scheme [1] are considered. It is shown that in the case of maximal entanglement no nontrivial pure Nash equilibrium exists. The proof relies on simple…

The quantum Nash equilibrium in the thermodynamic limit is studied for games like quantum Prisoner's dilemma and the quantum game of chicken. A phase transition is seen in both games as a function of the entanglement in the game. We observe…

In another paper with the same name\cite{frame}, we proposed a new representation of Game Theory, but most results are given by specific examples and argument. In this paper, we try to prove the conclusions as far as we can, including a…

We consider a wireless channel shared by multiple transmitter-receiver pairs. Their transmissions interfere with each other. Each transmitter-receiver pair aims to maximize its long-term average transmission rate subject to an average power…

Theory of quantum games is a new area of investigation that has gone through rapid development during the last few years. Initial motivation for playing games, in the quantum world, comes from the possibility of re-formulating quantum…

We investigate the coherence of quantum channels and establish a resource theory for quantifying the coherence of quantum channels via Choi matrix. To this aim, we define the incoherent channels and incoherent superchannels. This theory…

A version of the Monty Hall problem is presented where the players are permitted to select quantum strategies. If the initial state involves no entanglement the Nash equilibrium in the quantum game offers the players nothing more than can…

The quantum capacity of a pure quantum channel and that of classical-quantum-classical channel are discussed in detail based on the fully quantum mechanical mutual entropy. It is proved that the quantum capacity generalizes the so-called…

A key open question in quantum computation is what advantages quantum neural networks (QNNs) may have over classical neural networks (NNs), and in what situations these advantages may transpire. Here we address this question by studying the…

We propose a type of non-cooperative game, termed multi-cluster aggregative game, which is composed of clusters as players, where each cluster consists of collaborative agents with cost functions depending on their own decisions and the…

Quantum information processing exploits the quantum nature of information. It offers fundamentally new solutions in the field of computer science and extends the possibilities to a level that cannot be imagined in classical communication…

In the Eisert protocol for 2 X 2 quantum games [Phys. Rev. Lett. 83, 3077], a number of authors have investigated the features arising from making the strategic space a two-parameter subset of single qubit unitary operators. We argue that…