Noisy three-player dilemma game: Robustness of the quantum advantage
arXiv:2004.04533 · doi:10.1007/s11128-020-02830-2
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.
arXiv commentPersistence 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 (25)
- Quantum Computing in the NISQ era and beyond
- Quantum Games and Quantum Strategies
- Quantum strategies
- Optimal Cloning of Pure States
- The uncertainty principle determines the non-locality of quantum mechanics
- Multi-Player Quantum Games
- Local orthogonality as a multipartite principle for quantum correlations
- Direct Characterization of Quantum Dynamics
- Bell nonlocality and Bayesian game theory
- A Monogamy-of-Entanglement Game With Applications to Device-Independent Quantum Cryptography
- Machine learning quantum states in the NISQ era
- Playing a quantum game with a corrupted source
- Experimental realization of nondestructive discrimination of Bell states using a five-qubit quantum computer
- Experimental implementation of a four-player quantum game
- Dilemma and Quantum Battle of Sexes
- Design and experimental realization of an optimal scheme for teleportion of an -qubit quantum state
- Experimental Demonstration of Non-local Controlled-Unitary Quantum Gates Using a Five-qubit Quantum Computer
- Proposal for optically realizing quantum game
- Quantum cryptography over non-Markovian channels
- Aharon-Vaidman quantum game with a Young-type photonic qutrit
- Complete characterization of the directly implementable quantum gates used in the IBM quantum processors
- Quantum machine learning with glow for episodic tasks and decision games
- Contextuality in multipartite pseudo-telepathy graph games
- Game-theoretic perspective of Ping-Pong Protocol
- Circuit optimization for IBM processors: A way to get higher fidelity and higher values of nonclassicality witnesses