Related papers: Quantum games: a survey for mathematicians
This research paper gives an overview of quantum computers - description of their operation, differences between quantum and silicon computers, major construction problems of a quantum computer and many other basic aspects. No special…
The rather unintuitive nature of quantum theory has led numerous people to develop sets of (physically motivated) principles that can be used to derive quantum mechanics from the ground up, in order to better understand where the structure…
While it is known that shared quantum entanglement can offer improved solutions to a number of purely cooperative tasks for groups of remote agents, controversy remains regarding the legitimacy of quantum games in a competitive setting--in…
This chapter summarizes quantum computation, including the motivation for introducing quantum resources into computation and how quantum computation is done. Finally, this chapter articulates advantages and limitations of quantum…
Interpretational problems with quantum mechanics can be phrased precisely by only talking about empirically accessible information. This prompts a mathematical reformulation of quantum mechanics in terms of classical mechanics. We survey…
Over the last twenty years of research on quantum game theory have given us many ideas of how quantum games could be played. One of the most prominent ideas in the field is a model of quantum playing a 2x2 game introduced by J. Eisert, M.…
Quantum games represent the really 21st century branch of game theory, tightly linked to the modern development of quantum computing and quantum technologies. The main accent in these developments so far was made on stationary or repeated…
A quantum game can be viewed as a state preparation in which the final output state results from the competing preferences of the players over the set of possible output states that can be produced. It is therefore possible to view state…
This paper proposes a basic theory on physical reality and a new foundation for quantum mechanics and classical mechanics. It presents a scenario not only to solve the problem of the arbitrariness on the operator ordering for the…
In this paper we review our earlier work on quantum computing and the Nash Equilibrium, in particular, tracing the history of the discovery of new Nash Equilibria and then reviewing the ways in which quantum computing may be expected to…
In this paper, we study finite-agent linear-quadratic games on graphs. Specifically, we propose a comprehensive framework that extends the existing literature by incorporating heterogeneous and interpretable player interactions. Compared to…
The theory of quantum computation is presented in a self contained way from a computer science perspective. The basics of classical computation and quantum mechanics is reviewed. The circuit model of quantum computation is presented in…
We stress the notion of statistical experiment, which is mandatory for quantum mechanics, and recall Ludwig's foundation of quantum mechanics, which provides the most general framework to deal with statistical experiments giving evidence…
Quantum computers are on the verge of becoming a commercially available reality. They represent a paradigm shift in computing, with a steep learning gradient. The creation of games is a way to ease the transition for beginners. We present a…
With increasing game size, a problem of computational complexity arises. This is especially true in real world problems such as in social systems, where there is a significant population of players involved in the game, and the complexity…
We introduce and investigate a range of general notions of a game. Our principal notion is based on a set of agents modifying a relational structure in a discrete evolution sequence. We also introduce and study a variety of ways to model…
It is possible to completely explain all aspects of quantum mechanics by expressing the relations between physical properties in terms of complex conditional probabilities (Phys. Rev. A 89, 042115(2014)). These fully deterministic…
We give a strict mathematical description for a refinement of the Marinatto-Weber quantum game scheme. The model allows the players to choose projector operators that determine the state on which they perform their local operators. The game…
Game semantics is a rich and successful class of denotational models for programming languages. Most game models feature a rather intuitive setup, yet surprisingly difficult proofs of such basic results as associativity of composition of…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…