Quantum Bidding in Bridge

International Journal of Quantum Information, 2007

We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction outcome while simultaneously destroying the superposition. Thus non-winning bids are never revealed. Participants can use entanglement to arrange for correlations among their bids, with the assurance that this entanglement is not observable by others. The protocol is useful for information hiding applications, such as partnership bidding with allocative externality or concerns about revealing bidding preferences. The protocol applies to a variety of auction types, e.g., first or second price, and to auctions involving either a single item or arbitrary bundles of items (i.e., combinatorial auctions). We analyze the game-theoretical behavior of the quantum protocol for the simple case of a sealed-bid quantum, and show how a suitably designed adiabatic search reduces the possibilities for bidders to game the auction. This design illustrates how incentive rather that computational constraints affect quantum algorithm choices.

Quantum Information Processing, 2008

We describe human-subject laboratory experiments on probabilistic auctions based on previously proposed auction protocols involving the simulated manipulation and communication of quantum states. These auctions are probabilistic in determining which bidder wins, or having no winner, rather than always having the highest bidder win. Comparing two quantum protocols in the context of first-price sealed bid auctions, we find the one predicted to be superior by game theory also performs better experimentally. We also compare with a conventional first price auction, which gives higher performance. Thus to provide benefits, the quantum protocol requires more complex economic scenarios such as maintaining privacy of bids over a series of related auctions or involving allocative externalities.

Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose a new perspective for studying quantum entanglement: distributed computation of functions without communication between nodes. To formalize this approach, we propose identity games. Surprisingly, despite of no-signaling, we obtain that non-local quantum strategies beat classical ones in terms of winning probability for identity games originating from certain multipartite functions. Moreover we show that, for majority of functions, access to general non-signaling resources boosts success probability two times in comparison to classical ones, for number of outputs large enough.

Physica A: Statistical Mechanics and its Applications, 2008

Quantum game theory, whatever opinions may be held due to its abstract physical formalism, have already found various applications even outside the orthodox physics domain. In this paper we introduce the concept of a quantum auction, its advantages and drawbacks. Then we describe the models that have already been put forward. A general model involves Wigner formalism and infinite dimensional Hilbert spaces-we envisage that the implementation might not be an easy task. But a restricted model advocated by the Hewlett-Packard group seems to be much easier to implement. Simulations involving humans have already been performed. We will focus on problems related to combinatorial auctions and technical assumptions that are made. Quantum approach offers at least two important developments. Powerful quantum algorithms for finding solutions would extend the range of possible applications. Quantum strategies, being qubits, can be teleported but are immune from cloning-therefore extreme privacy of agent's activity could in principle be guaranteed. Then we point out some key problem that have to be solved before commercial use would be possible. With present technology, optical networks, single photon sources and detectors seems to be sufficient for experimental realization in the near future. We conclude by describing potential customers, estimating the potential market size and possible timing.

Journal of Advances in Applied & Computational Mathematics, 2017

Medium access control (MAC) and efficient spectrum allocation function particularly, are real challenges that wireless communications are facing nowadays and Dynamic Spectrum Access (DSA), enhanced with quantum computation techniques, is the most promising alternative. In such a context, we capitalize quantum games and quantum decisions strengths to design protocols that make classic communications more efficient. That is, we focus on protocols running on quantum devices whose input and output signals are classic. In this work we propose a quantum media access control (QMAC) that allows dynamic and fair spectrum allocation. Particularly, we point to two of the main DSA functions, which are Spectrum Sharing and Spectrum Allocation.

Physical Review A, 2001

Recently the concept of quantum information has been introduced into game theory. Here we present the first study of quantum games with more than two players. We discover that such games can possess a new form of equilibrium strategy, one which has no analogue either in traditional games or even in two-player quantum games. In these 'pure' coherent equilibria, entanglement shared among multiple players enables new kinds of cooperative behavior: indeed it can act as a contract, in the sense that it prevents players from successfully betraying one-another.

2019

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 work, Flitney and Abbott [Phys. Rev. A 65, 062318 (2002)] showed that by using a maximally entangled system for Alice and Bob's choices, and using quantum strategies, Bob and Alice can win or lose depending on the strategy chosen by either of the players. Here we develop a new quantum algorithm with quantum circuits for playing the quantum Monty Hall game by a user. Our quantum algorithm uses the quantum principles of superposition and entanglement so that it can be efficiently played on a quantum computer. We present two schemes, one calculating the probability of winning or loss and the other determining whether a player (say Alice) wins or not.

New Journal of Physics, 2010

Abstract. 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 systems, quantum game theory has emerged as a framework for understanding the competitive flow of quantum information. Up till now, only two-and three-player quantum games have been demonstrated with restricted strategy sets. Here, we report the first experiment that implements a four-player ...

2005

Attention to the very physical aspects of information characterizes the current research in quantum computation, quantum cryptography and quantum communication. In most of the cases quantum description of the system provides advantages over the classical approach. Game theory, the study of decision making in conflict situation has already been extended to the quantum domain. We would like to review the latest development in quantum game theory that is relevant to information processing. We will begin by illustrating the general idea of a quantum game and methods of gaining an advantage over "classical opponent". Then we review the most important game theoretical aspects of quantum information processing. On grounds of the discussed material, we reason about possible future development of quantum game theory and its impact on information processing and the emerging information society. The idea of quantum artificial intelligence is explained.

Physical Review A, 2001

I show that a simple multi-party communication task can be performed more efficiently with quantum communication than with classical communication, even with low detection efficiency η. The task is a communication complexity problem in which distant parties need to compute a function of the distributed inputs, while minimizing the amount of communication between them. A quantum optical setup is suggested that can demonstrate a 5-party quantum protocol with higher-than-classical performance whenever η > 0.25 .