Noisy three-player dilemma game: robustness of the quantum advantage
- PDF / 1,348,436 Bytes
- 18 Pages / 439.37 x 666.142 pts Page_size
- 85 Downloads / 224 Views
Noisy three-player dilemma game: robustness of the quantum advantage Pranav Kairon1 · Kishore Thapliyal2 · R. Srikanth3 · Anirban Pathak4 Received: 12 April 2020 / Accepted: 18 August 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
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 50%. Keywords Quantum game · Effect of noise on quantum advantages · Three-party dilemma game · Experimental realization of a quantum game
1 Introduction Game theory provides a way to learn about decisive communication between rational and self-seeking agents. Therefore, it plays an important role in the fields of computer science, economics, biology, psychology, etc. (see [1,2] for review articles). Computationally, game theory can be used to model algorithms [3,4] as well as to check
B
Anirban Pathak [email protected] Kishore Thapliyal [email protected]
1
Delhi Technological University, Bawana Road, Delhi 110042, India
2
RCPTM, Joint Laboratory of Optics of Palacky University and Institute of Physics of Academy of Science of the Czech Republic, Faculty of Science, Palacky University, 17. listopadu 12, 771 46 Olomouc, Czech Republic
3
Poornaprajna Institute of Scientific Research, Bengaluru, Karnataka 560080, India
4
Jaypee Institute of Information Technology, A-10, Sector-62, Noida UP-201309, India 0123456789().: V,-vol
123
327
Page 2 of 18
P. Kairon et al.
the robustness of networks and corresponding attack strategies [5]. In cryptography, the communication task can be visualized as a game between the parties trying to communicate securely and an eavesdropper (see [6] and references therein). With the advent of quantum computing, it is observed that resources used in quantum computing, such as quantum coherence and entanglement, provide alternative solutions to classical games. We may mention, for example, the emergence of cooperation in the prisoner’s dilemma game [7] and the resolution of the coordination in battle of sexes game [8] using entanglement. Specifically, as all the players wish to maximize their gain or payoff in games, for which the umpire has laid down the rule(s), players using quantum mechanical tactics are found to attain a higher payoff compared to the classical one [9]. Further, the dilemma disappears in prisoner’s dilemma with the use of quantum resources under unitary operations [10,11]. Along the same line, optimal cl
Data Loading...
