Constructing Entanglers in 2-Players--N-Strategies Quantum Game
英文摘要：
In quantum games based on 2-player--$N$-strategies classical games, each player has a quNit (a normalized vector in an $N$-dimensional Hilbert space ${\cal H}_N$) upon which he applies his strategy (a matrix $U \in$ SU(N)). The players draw their payoffs from a state $|Ψ\ra=J^\dagger U_1 \otimes U_2 J|Ψ_0 \ra \in {\cal H}_N \otimes {\cal H}_N $. Here $|Ψ_0 \ra$ and $J$ (both determined by the game's referee) are respectively an {\it unentangled} 2-quNit (pure) state and a unitary operator such that $|Ψ_1 \ra \equiv J|Ψ_0 \ra \in {\cal H}_N \otimes {\cal H}_N$ is {\it partially entangled}. The existence of pure strategy Nash equilibrium in the quantum game is intimately related to the degree of entanglement of $|Ψ_1 \ra$. Hence, it is practical to design the entangler $J=J(β)$ to be dependent on a {\it single} real parameter $β$ that controls the degree of entanglement of $|Ψ_1 \ra$, such that its von-Neumann entropy $ {\cal S}_N(β)$ is continuous and obtains {\it any value} in $[0, \log N]$. Moreover, an efficient control of $ {\cal S}_N(β)$ is possible only if $|Ψ_1 \ra$ appears in a Schmidt decomposed form. Designing $J(β)$ for $N=2$ is quite standard. Extension to $N>2$ is not obvious, and here we suggest an algorithm to achieve it.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
