Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity

Abstract

The well-known quantization schemes for two-player nonzero-sum games are Eisert–Wilkens–Lewenstein scheme and Marinatto–Weber scheme. In this work, we establish the connection between the two schemes from the perspective of quantum circuits. Further, we provide the correspondence between any game quantization schemes and the CNOT complexity, where CNOT complexity is up to the local unitary operations. While CNOT complexity is known to be useful in the analysis of universal quantum circuit, in this work, we find its applicability in quantum game theory.