Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity
Autor: | S. Balakrishnan, V. Vijayakrishnan |
---|---|
Rok vydání: | 2018 |
Předmět: |
Computer Science::Computer Science and Game Theory
Computer science Statistical and Nonlinear Physics Quantum Physics 01 natural sciences Unitary state 010305 fluids & plasmas Theoretical Computer Science Electronic Optical and Magnetic Materials Algebra Quantization (physics) Quantum circuit Computer Science::Emerging Technologies Controlled NOT gate Modeling and Simulation 0103 physical sciences Signal Processing Quantum game theory Electrical and Electronic Engineering Connection (algebraic framework) 010306 general physics Quantum Hardware_LOGICDESIGN Quantum computer |
Zdroj: | Quantum Information Processing. 17 |
ISSN: | 1573-1332 1570-0755 |
DOI: | 10.1007/s11128-018-1870-5 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |
Pro tento záznam nejsou dostupné žádné jednotky.