Related papers: The Quantum Monty Hall Problem
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…
Poker has become a popular pastime all over the world. At any given moment one can find tens, if not hundreds, of thousands of players playing poker via their computers on the major on-line gaming sites. Indeed, according to the Vancouver,…
Quantum experiments yield random data. We show that the most efficient way to store this empirical information by a finite number of bits is by means of the vector of square roots of observed relative frequencies. This vector has the unique…
Game theory is central to the understanding of competitive interactions arising in many fields, from the social and physical sciences to economics. Recently, as the definition of information is generalized to include entangled quantum…
We study quantum games with correlated noise through a generalized quantization scheme. We investigate the effects of memory on quantum games, such as Prisoner's Dilemma, Battle of the Sexes and Chicken, through three prototype…
Quantum mechanics dramatically differs from classical physics, allowing for a wide range of genuinely quantum phenomena. The goal of quantum information is to understand information processing from a quantum perspective. In this mindset, it…
Quantum entanglement has been recently demonstrated as a useful resource in conflicting interest games of incomplete information between two players, Alice and Bob [Pappa et al., Phys. Rev. Lett. 114, 020401 (2015)]. General setting for…
We reformulate the quantum Monty Hall problem in the presence of decoherence. The decoherence destroys the fairness of the game. A new Nash equilibrium for a particular strategy profile in the presence of decoherence emerges. It is shown…
The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered…
A game is played by a team of two --- say Alice and Bob --- in which the value of a random variable $x$ is revealed to Alice only, who cannot freely communicate with Bob. Instead, she is given a quantum $n$-level system, respectively a…
Quantum Annealing, or Quantum Stochastic Optimization, is a classical randomized algorithm which provides good heuristics for the solution of hard optimization problems. The algorithm, suggested by the behaviour of quantum systems, is an…
I argue that we must distinguish between: (0) the Three-Doors-Problem Problem [sic], which is to make sense of some real world question of a real person. (1) a large number of solutions to this meta-problem, i.e., many specific…
We obtain the strongest separation between quantum and classical query complexity known to date -- specifically, we define a black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved…
The guesswork of a classical-quantum channel quantifies the cost incurred in guessing the state transmitted by the channel when only one state can be queried at a time, maximized over any classical pre-processing and minimized over any…
Recently, several researchers proposed portfolio optimization as a potential use case for quantum optimization. However, the literature is lacking an extensive benchmark quantifying the potential of quantum computers for portfolio…
Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know…
From the 1970s up to now, Mastermind, a classic two-player game, has attracted plenty of attention, not only from the public as a popular game, but also from the academic community as a scientific issue. Mastermind with n positions and k…
Quantum systems have an exponentially large degree of freedom in the number of particles and hence provide a rich dynamics that could not be simulated on conventional computers. Quantum reservoir computing is an approach to use such a…
I give an analysis of the simplest non-commutative quantum game, which is a gambling game much like Heads or Tails. The quantum gamespace displays strategies which are not interpretable through direct-product strategies of the two players.…
A locking protocol between two parties is as follows: Alice gives an encrypted classical message to Bob which she does not want Bob to be able to read until she gives him the key. If Alice is using classical resources, and she wants to…