Related papers: Mini-maximizing two qubit quantum computations
In quantum computing, the computation is achieved by linear operators in or between Hilbert spaces. In this work, we explore a new computation scheme, in which the linear operators in quantum computing are replaced by (higher) functors…
Useful relations describing arbitrary parameters of given quantum systems can be derived from simple physical constraints imposed on the vectors in the corresponding Hilbert space. This is well known and it usually proceeds by partitioning…
Quantum computing is greatly advanced in recent years and is expected to transform the computation paradigm in the near future. Quantum circuit simulation plays a key role in the toolchain for the development of quantum hardware and…
In two player bi-matrix games with partial monitoring, actions played are not observed, only some messages are received. Those games satisfy a crucial property of usual bi-matrix games: there are only a finite number of required (mixed)…
Main papers on quantum games are written by physicists for physicists, and the inevitable exploitation of physics jargon may create difficulties for mathematicians or economists. Our goal here is to make clear the physical content and to…
Accelerating computational tasks with quantum resources is a widely-pursued goal that is presently limited by the challenges associated with high-fidelity control of many-body quantum systems. The paradigm of reservoir computing presents an…
A protocol for considering decoherence in quantum games is presented. Results for two-player, two-strategy quantum games subject to decoherence are derived and some specific examples are given. Decoherence in other types of quantum games is…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
We analyze the necessary physical conditions to model an open quantum system as a quantum game. By applying the formalism of Quantum Operations on a particular system, we use Kraus operators as quantum strategies. The physical…
A new approach to play games quantum mechanically is proposed. We consider two players who perform measurements in an EPR-type setting. The payoff relations are defined as functions of *correlations*, i.e. without reference to classical or…
Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player-two…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
In a recent paper, Eisert et al. presented a quantum mechanical generalization of Prisoner's Dilemma. They asserted that the maximally entangled game exhibits a unique Nash equilibrium which yields a pay-off equivalent to cooperative…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
We present a physically appealing and elegant picture for quantum computing using rules constructed for a game of darts. A dartboard is used to represent the state space in quantum mechanics and the act of throwing the dart is shown to have…
Quantum game theory offers a lot of interesting questions, and it is relevant to use the quantum information theory to resolve or improve games with lack of information : how to use the power of quantum entanglement to show the superiority…
We propose a projected variational quantum extragradient (VQEG) framework for computing approximate Nash equilibria in two-player zero-sum matrix games. Mixed strategies are parameterized as Born distributions of parameterized quantum…
The aim of this paper is to discuss in some detail the two different quantum schemes for duopoly problems. We investigate under what conditions one of the schemes is more reasonable that the other one. Using the Cournot's duopoly example we…
We give a quantum algorithm for computing an $\epsilon$-approximate Nash equilibrium of a zero-sum game in a $m \times n$ payoff matrix with bounded entries. Given a standard quantum oracle for accessing the payoff matrix our algorithm runs…
An interesting iterative procedure is proposed to solve a two-player zero-sum Markov games. Under suitable assumption, the boundedness of the proposed iterates is obtained theoretically. Using results from stochastic approximation, the…