Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1212.6727 · AIP conference proceedings

Strategies in a symmetric quantum Kolkata restaurant problem

Puya Sharif, Hoshang Heydari

Published Jan 1, 2012• 6 citations
arXivHTMLPDF

Abstract

The Quantum Kolkata restaurant problem is a multiple-choice version of the quantum minority game, where a set of n non-communicating players have to chose between one of m choices. A payoff is granted to the players that make a unique choice. It has previously been shown that shared entanglement and quantum operations can aid the players to coordinate their actions and acquire higher payoffs than is possible with classical randomization. In this paper the initial quantum state is expanded to a family of GHZ-type states and strategies are discussed in terms of possible final outcomes. It is shown that the players individually seek outcomes that maximize the collective good.

DOI
10.1063/1.4773171

Related papers

Quantum solution to a three player Kolkata restaurant problem using entangled qutrits

Puya Sharif, Hoshang Heydari

Three player quantum Kolkata restaurant problem is modelled using three entangled qutrits. This first use of three level quantum states in this context is a step towards a $N$-choice generalization of the $N$-player quantum minority game. It is shown that a better than classical payoff is achieved by a Nash equilibrium solution where the space of available strategies is spanned by subsets of SU(3) and the players share a tripartite entangled initial state.

arXiv:1111.1962•Quantum Information and Computation•Mar 1, 2014•5 citations

An introduction to multi-player, multi-choice quantum games

Puya Sharif, Hoshang Heydari

We give a self contained introduction to a few quantum game protocols, starting with the quantum version of the two-player two-choice game of Prisoners dilemma, followed by a n-player generalization trough the quantum minority games, and finishing with a contribution towards a n-player m-choice generalization with a quantum version of a three-player Kolkata restaurant problem. We have omitted some technical details accompanying these protocols, and instead laid the focus on presenting some general aspects of the field as a whole. This review contains an introduction to the formalism of quantum information theory, as well as to important game theoretical concepts, and is aimed to work as an introduction suiting economists and game theorists with limited knowledge of quantum physics as well as to physicists with limited knowledge of game theory.

arXiv:1204.0661•Apr 3, 2012•2 citations

How Quantum Entanglement Helps to Coordinate Non-Communicating Players

G.V. Klimovitch

We consider a coalitional game with the same payoff for all players. To maximize the payoff, the players need to use one collective strategy, if all players are in certain states, and the other strategy otherwise. The current state of each player changes according to external conditions and is not known to the other players. In one example of such a game, quantum entanglement between players results in the optimal payoff thrice the maximal payoff for unentangled players.

arXiv:quant-ph/0405093•May 17, 2004•1 citation

An Introduction to Multi-player, Multi-choice Quantum Games: Quantum Minority Games & Kolkata Restaurant Problems

Puya Sharif, Hoshang Heydari

New economic windows•Aug 6, 2012•4 citations

Quantum minority game utilizing various forms of entanglement

Adrian P. Flitney, Lloyd C. L. Hollenberg

The quantum Minority game provides a means of studying the effect of multi-partite entanglement in a game theoretic setting. We study symmetric Nash equilibria and symmetric Pareto optimal strategies arising in a four-player quantum Minority game that uses an initial state that is a superposition of a GHZ state and products of EPR pairs. We find that the payoff curve for the symmetric Pareto optimal strategy is the same as that for the maximal violation of the Mermin-Ardehali-Belinskii-Klyshko inequality for the initial state, indicating a correspondence between quantum game theory and Bell inequalities. We also show that no advantage over the classical Minority game can be obtained when the initial state has only two party entanglement.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Dec 3, 2007•4 citations

Quantum solution to a three player Kolkata restaurant problem using entangled qutrits

SharifPuya, HeydariHoshang

Three player quantum Kolkata restaurant problem is modelled using three entangled qutrits. This first use of three level quantum states in this context is a step towards a N-choice generalization o...

Quantum Information and Computation•Mar 1, 2014•0 citations
The Quantum Kolkata restaurant problem is a multiple-choice version of the quantum minority game, where a set of n non-communicating players have to chose between one of m choices. A payoff is granted to the players that make a unique choice. It has previously been shown that shared entanglement and quantum operations can aid the players to coordinate their actions and acquire higher payoffs than is possible with classical randomization. In this paper the initial quantum state is expanded to a family of GHZ-type states and strategies are discussed in terms of possible final outcomes. It is shown that the players individually seek outcomes that maximize the collective good.
Three player quantum Kolkata restaurant problem is modelled using three entangled qutrits. This first use of three level quantum states in this context is a step towards a NNN-choice generalization of the NNN-player quantum minority game. It is shown that a better than classical payoff is achieved by a Nash equilibrium solution where the space of available strategies is spanned by subsets of SU(3) and the players share a tripartite entangled initial state.
We give a self contained introduction to a few quantum game protocols, starting with the quantum version of the two-player two-choice game of Prisoners dilemma, followed by a n-player generalization trough the quantum minority games, and finishing with a contribution towards a n-player m-choice generalization with a quantum version of a three-player Kolkata restaurant problem. We have omitted some technical details accompanying these protocols, and instead laid the focus on presenting some general aspects of the field as a whole. This review contains an introduction to the formalism of quantum information theory, as well as to important game theoretical concepts, and is aimed to work as an introduction suiting economists and game theorists with limited knowledge of quantum physics as well as to physicists with limited knowledge of game theory.
The quantum Minority game provides a means of studying the effect of multi-partite entanglement in a game theoretic setting. We study symmetric Nash equilibria and symmetric Pareto optimal strategies arising in a four-player quantum Minority game that uses an initial state that is a superposition of a GHZ state and products of EPR pairs. We find that the payoff curve for the symmetric Pareto optimal strategy is the same as that for the maximal violation of the Mermin-Ardehali-Belinskii-Klyshko inequality for the initial state, indicating a correspondence between quantum game theory and Bell inequalities. We also show that no advantage over the classical Minority game can be obtained when the initial state has only two party entanglement.