Noisy three-player dilemma game: Robustness of the quantum advantage

Abstract

Games involving quantum strategies often yield higher payoff. Here, we study a practical realization of the three-player dilemma game using the superconductivity-based quantum processors provided by IBM Q Experience. We analyze the persistence of the quantum advantage under corruption of the input states and how this depends on parameters of the payoff table. Specifically, experimental fidelity and error are observed not to be properly anti correlated, i.e., there are instances where a class of experiments with higher fidelity yields a greater error in the payoff. Further, we find that the classical strategy will always outperform the quantum strategy if corruption is higher than half.

Persistence of the quantum advantage under corruption of the input states is analyzed for a 3-player dilemma game implemented using superconductivity-based quantum processors

References in corpus (5)

• The uncertainty principle determines the non-locality of quantum mechanics
• Machine learning quantum states in the NISQ era
• Complete characterization of the directly implementable quantum gates used in the IBM quantum processors
• Game-theoretic perspective of Ping-Pong Protocol
• Circuit optimization for IBM processors: A way to get higher fidelity and higher values of nonclassicality witnesses