Related papers: N-person quantum Russian roulette
The Mermin-Peres magic square game is a cooperative two-player nonlocal game in which shared quantum entanglement allows the players to win with certainty, while players limited to classical operations cannot do so, a phenomenon dubbed…
In the present letter, we propose a more general entangling operator to the quantization of Cournot economic model, in which players can access to a continuous set of strategies. By analyzing the relation between the von Neumann entropy of…
We analyze the impact of the Unruh effect on the quantum Magic Square game. We find the values of acceleration parameter for which quantum strategy yields higher players' winning probability than classical strategy.
We address measurement schemes where certain observables are chosen at random within a set of non-degenerate isospectral observables and then measured on repeated preparations of a physical system. Each observable has a given probability to…
Enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum game with the problem of data clustering, and then develop a quantum-game-based clustering algorithm, in which data points…
We address the problem of measuring the relative angle between two "quantum axes" made out of N1 and N2 spins. Closed forms of our fidelity-like figure of merit are obtained for an arbitrary number of parallel spins. The asymptotic regimes…
It is known that repeated gambling over the outcomes of independent and identically distributed (i.i.d.) random variables gives rise to alternate operational meaning of entropies in the classical case in terms of the doubling rates. We give…
Recently Marinatto and Weber introduced an interesting new scheme for quantizing games, and applied their scheme to the famous game 'Battle of the Sexes'. In this Comment we make two observations: (a) the overall quantization scheme is…
We study the extension of classical games to the quantum domain, generated by the addition of one unitary strategy to two classical strategies of each player. The conditions that need to be met by unitary operations to ensure that the…
We present a survey of quantum algorithms, primarily for an intended audience of pure mathematicians. We place an emphasis on algorithms involving group theory.
We generalize Banica's construction of the quantum isometry group of a metric space to the class of quantum metric spaces in the sense of Kuperberg and Weaver. We also introduce quantum isometries between two quantum metric spaces, and we…
An asymmetric generalization of classical Cournot's duopoly game was introduced and the simulation scheme of its quantized version was analyzed. In this scheme, the player assigned by a 'classical' measurement scheme always wins the player…
In this paper we solve the three-player-game question. A three-player-game consists of a series of rounds. There are altogether three players. Two players participate in each round, at the end of the round the loser quits and the third…
We reason about possible future development of quantum game theory and its impact on information processing and the emerging information society. Two of the authors have recently proposed a quantum description of financial market in terms…
In this work we have introduced two party games with respective winning conditions. One cannot win these games deterministically in the classical world if they are not allowed to communicate at any stage of the game. Interestingly we find…
The article is a natural continuation of the papers by Gavrilov and Gitman (Class.Quant.Grav. {\bf 17} (2000) L133; Int. J. Mod. Phys. A15 (2000) 4499) devoted to relativistic particle quantization. Here we generalize the problem,…
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that players in a game may desire to balance maximization of payoff with…
After a brief review of classical probability theory (measure theory), we present an observation (due to Sorkin) concerning an aspect of probability in quantum mechanics. Following Sorkin, we introduce a generalized measure theory based on…
The drawbacks in the formulations of random infinite divisibility in Sandhya (1991, 1996), Gnedenko and Korelev (1996), Klebanov and Rachev (1996), Bunge (1996) and Kozubowski and Panorska (1996) are pointed out. For any given Laplace…
The main ideas behind developments in the theory and technology of quantum computation were formulated in the late 1970s and early 1980s by two physicists in the West and a mathematician in the former Soviet Union. It is not generally known…