  Diners dilemma is one of the most interesting problems in both economic and
game theories. Here, we solve this problem for n (number of players) =4 with
quantum rules and we are able to remove the dilemma of diners between the
Pareto optimal and Nash equilibrium points of the game. We find the quantum
strategy that gives maximum payoff for each diner without affecting the payoff
and strategy of others. We use the quantum principles of superposition and
entanglement that gives supremacy over any classical strategies. We present the
circuit implementation for the game, design it on the IBM quantum simulator and
verify the strategies in the quantum model.
