相关论文: Quantum gambling using mesoscopic ring qubits

This paper introduces quantum multiparty protocols which allow the use of temporary assumptions. We prove that secure quantum multiparty computations are possible if and only if classical multi party computations work. But these strict…

Quantum games, like quantum algorithms, exploit quantum entanglement to establish strong correlations between strategic player actions. This paper introduces quantum game-theoretic models applied to trading and demonstrates their…

Concepts on quantum physics are generally difficult for the general public to understand and grasp due to its counter-intuitive nature and requirement for higher level of mathematical literacy. With categorical quantum mechanics (CQM),…

Here, we present the quantum version of a very famous statistical decision problem, whose classical version is counter-intuitive to many. The Monty Hall game can be phrased as a two person game between Alice and Bob. In their pioneering…

Quantum games have proposed a new point of view for the solution of the classical problems and dilemmas in game theory. Certain quantization relationships can be proposed with the objective that a game can be generalized into a quantum…

We consider a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system. Intuitively, by the…

A number of recent studies have focused on novel features in game theory when the games are played using quantum mechanical toolbox (entanglement, unitary operators, measurement). Researchers have concentrated in two-player-two strategy,…

Recently there were many quantum protocols devoted to solve the millionaire problem and private comparison problem by adding a semi-honest third party. They all require complicated quantum methods, while still leak a non-trivial amount of…

Quantum pseudo-telepathy games are good examples of explaining the strangeness of quantum mechanics and demonstrating the advantage of quantum resources over classical resources. Most of the quantum pseudo-telepathy games are common…

After a general introduction, the thesis is divided into four parts. In the first, we discuss the task of coin tossing, principally in order to highlight the effect different physical theories have on security in a straightforward manner,…

We review the quantum version of a well known problem of cryptography called coin tossing (``flipping a coin via telephone''). It can be regarded as a game where two remote players (who distrust each other) tries to generate a uniformly…

We analyze the quantum penny flip game using geometric algebra and so determine all possible unitary transformations which enable the player Q to implement a winning strategy. Geometric algebra provides a clear visual picture of the quantum…

Classical game theory is a powerful tool focusing on optimized resource distribution, allocation and sharing in classical wired and wireless networks. As quantum networks are emerging as a means of providing true connectivity between…

A sequence of spin-1/2 particles polarised in one of two possible directions is presented to an experimenter, who can wager in a double-or-nothing game on the outcomes of measurements in freely chosen polarisation directions. Wealth is…

We investigate a multi-player and multi-choice quantum game. We start from two-player and two-choice game and the result is better than its classical version. Then we extend it to N-player and N-choice cases. In the quantum domain, we…

A simple and general formulation of the quantum game theory is presented, accommodating all possible strategies in the Hilbert space for the first time. The theory is solvable for the two strategy quantum game, which is shown to be…

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,…

The two-players $N$ strategies games quantized according to the Eisert-Lewenstein-Wilkens scheme (Phys. Rev. Lett. 83 (1999), 3077) are considered. Group theoretical methods are applied to the problem of finding a general form of gate…

A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of…

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…