--- title: Unitary Circuit Games url: https://www.emergentmind.com/topics/unitary-circuit-games type: topic --- # Unitary Circuit Games Searching arXiv for recent and directly relevant papers on unitary circuit games and related formulations. arXiv search query: "unitary circuit games entanglement transitions matchgates game semantics higher-order unitary quantum computation" Unitary circuit games are research constructions in which unitary transformations function as strategic moves on quantum states, circuits, or higher-order computational objects. The literature includes zero-sum games on a shared many-body register with energy as payoff [2308.09673], one-dimensional entangler–disentangler dynamics in which local gates compete to produce volume-law or area-law steady states [2304.12965, 2507.05055], cooperative-game quantization schemes based on Quantum Register Algebra and quantum Shapley values [2310.18067], and a game-semantics model of higher-order unitary quantum computation formulated as a symmetric monoidal closed category [2404.06646]. Across these strands, the common element is the treatment of unitary operations as moves constrained by locality, entangling capacity, or semantic type, while the objectives range from energy optimization to entanglement suppression, coalition payoff allocation, and denotational representation. ## 1. Research scope and principal formulations Current work on unitary circuit games does not define a single canonical formalism. Instead, the literature develops several distinct but related frameworks, each centered on unitary control under game-like interaction. | Formulation | System | Central quantity | |---|---|---| | Shared-register zero-sum game | \(N\)-qubit register | Energy \(E=\langle \psi_f|H|\psi_f\rangle\) | | Entangler–disentangler circuit game | 1D chain of \(L\) qubits | Half-chain entropy \(S_{L/2}\) | | Cooperative-game quantization | Two- and three-player circuits | Quantum Shapley value \(\widetilde\Phi_i\) | | Higher-order game semantics | Games and strategies in \(\G\) or \(\UG\) | Induced linear map \([\sigma]\) | The zero-sum strand studies sequential play on the same register, with one player maximizing and the other minimizing the expectation value of a fixed Hamiltonian [2308.09673]. The circuit-dynamical strand studies repeated random application of entangling and disentangling local gates, yielding nonequilibrium steady states with entanglement transitions [2304.12965, 2507.05055]. The cooperative strand adapts Eisert–Wilkens–Lewenstein-type quantization to coalition games and uses the expected Shapley value with respect to quantum measurement probabilities [2310.18067]. The semantic strand treats unitary computation itself as a category of games and strategies expressive enough to realize all finite-dimensional unitaries at base types [2404.06646]. A plausible implication is that the phrase “unitary circuit games” should be read contextually. In some papers it denotes a competitive dynamical model on a lattice, in others a cooperative payoff mechanism, and in others a denotational semantics for unitary higher-order computation. ## 2. Shared-register zero-sum games and entangling advantage A formal shared-register game is defined on \(N\) qubits with Hilbert space \(\mathcal H=(\mathbb C^2)^{\otimes N}\) and Hamiltonian \[ H=\sum_{n=1}^N \sigma_n^z. \] Player \(A\) begins in a known pure product state \(|\psi_0\rangle\), applies \(U_A\in U(2^{N_A})\) on a subset of at most \(N_A\) qubits, and player \(B\), knowing \(U_A\), applies \(U_B\in U(2^{N_B})\) on up to \(N_B\) qubits. The final state is \[ |\psi_f\rangle=(U_B\otimes I_{\mathrm{rest}})(U_A\otimes I_{\mathrm{rest}})|\psi_0\rangle, \] the energy is measured as \(E=\langle\psi_f|H|\psi_f\rangle\), and the payoffs are \(\Pi_A=+E\) and \(\Pi_B=-E\) [2308.09673]. Entangling capability is quantified operationally. One says that \(A\) has a \(k\)-qubit entangling advantage if \(N_A\ge k>N_B\), in particular \(N_A>N_B\). Any pure state \(|\psi_A\rangle\) prepared by \(A\) has a Schmidt decomposition across \(B\)'s \(N_B\)-qubit subsystem, \[ |\psi_A\rangle=\sum_{i=1}^R \sqrt{\lambda_i}\,|\alpha_i\rangle_A|\beta_i\rangle_B, \] where \(R\le \min(2^{N_A-N_B},2^{N_B})\). The nonzero \(\lambda_i\) determine how mixed \(\rho_B\) is. A simple entanglement-power measure for a unitary \(U\) on \(k\) qubits is \[ e_p(U):=\left\langle S_L\!\left(\mathrm{Tr}_A[U(|\phi\rangle\otimes|\psi\rangle)]\right)\right\rangle_{|\phi,\psi\rangle}, \qquad S_L(\rho)=1-\mathrm{Tr}\,\rho^2, \] with the bound \(e_p(U)\le 1-1/2^k\) [2308.09673]. The origin of the second-mover advantage is explicit when \(N_A=N_B\). In that case, \(B\) can completely undo \(A\)'s action and then passify his register, so that for any \(U_A\) on his full support there exists \(U_B\) such that \[ U_B U_A|\psi_0\rangle = |{\rm ground}\rangle_B\otimes(\mathrm{something})_{\rm rest}, \] hence \[ \min_{U_B}\langle H\rangle=-N_B. \] If \(N_B=N\) and \(A\) acted first, \(A\) cannot prevent \(B\) from reaching the global ground state. The analysis yields the saddle-point property \[ \max_{U_A}\min_{U_B}\langle H\rangle = -\max_{U_B}\min_{U_A}\langle H\rangle =0 \] whenever \(N_A=N_B\), so the second player wins on average [2308.09673]. A larger entangling capacity weakens this advantage. Let \(M=N_A-N_B\ge 1\). By choosing \(U_A\) so that the reduced state on \(B\) has maximal rank \(R=2^M\) when \(M\le N_B\), player \(A\) can enforce \[ \rho_B=(1/2^M)\,I_{2^M}\oplus 0. \] Then \(B\)'s best passification can only occupy the \(R\) lowest energy levels of \[ H_B=\sum_{i\in B}\sigma_i^z, \] and \[ \min_{U_B}\langle H\rangle_{AB} = \sum_{i=1}^R (1/2^M)\,E_i = -\frac{1}{2^M}\sum_{i=1}^R |E_i|. \] For \(M(1/k)\sum_i W(\rho_i;h_i), \] so a first mover with the larger entangler can extract strictly more work than any sequence of local operations [2308.09673]. A worked example at total size \(N=5\) with \(N_A=3\) and \(N_B=2\) illustrates the mechanism. Player \(A\) prepares an AME on qubits \(\{1,2,3\}\) and a Bell pair on \(\{4,5\}\), so that every two-qubit marginal available to \(B\) has rank \(4\) with eigenvalues \(\{1/4,1/4,1/4,1/4\}\). \(B\)'s optimal two-plus-one-qubit unitaries then yield \(\langle H\rangle_{AB}=-1\), hence \(\langle H\rangle_{AB}/N=-1/5\) [2308.09673]. ## 3. One-dimensional entangler–disentangler dynamics A second major use of the term concerns repeated local competition on a chain of qubits. The system is an open chain of \(L\) qubits with Hilbert space \(\mathcal H=(\mathbb C^2)^{\otimes L}\). At each elementary update, a bond \(x\in\{1,\dots,L-1\}\) is chosen uniformly at random. With probability \[ p_{\rm dis}\equiv p \] the disentangler acts, and with probability \[ p_{\rm ent}\equiv 1-p \] the entangler acts. A full time step consists of \(L\) such updates. The entangler places a random two-qubit unitary drawn from an allowed ensemble, while the disentangler, using limited local knowledge of the state on the chosen bond, picks a unitary that minimizes the bipartite entanglement entropy across that bond [2304.12965]. The entanglement measure is the bipartite von Neumann entropy \[ S(A)=-\,\mathrm{Tr}\bigl[\rho_A\ln\rho_A\bigr], \] with \(A=\{1,\dots,x\}\). A two-qubit gate on bond \(x\) can change \(S(x)\) by at most one unit in the qubit case, and the disentangler selects an allowed local unitary \(V\) so that the post-update entropy across \(x\) is minimal, subject to local consistency with neighboring bipartitions [2304.12965]. Three variants were studied. | Variant | Critical point | Reported critical behavior | |---|---|---| | Classical discrete height model | \(p_c^{\rm(classical)}=1/2\) | \(\overline{h_{L/2}}\sim \sqrt{L}\), \(\beta=1/4\), \(z=2\), \(\nu=1\) | | Clifford circuit model | \(p_c^{\rm(Clifford)}\approx 0.382\) | \(\overline{S_{L/2}}\sim \sqrt{L}\), \(W\sim\sqrt{L}\), \(\beta=1/4\), \(z=2\), \(\nu\approx 1\) | | General \(U(4)\) Haar-random circuit | No finite \(p_c<1\) | Volume law for all \(0\le p<1\) | In the classical discrete-height or RSOS model, quantum entropies are replaced by a nonnegative height field \(h_x(t)\) with constraints \[ |h_{x+1}-h_x|\le 1,\qquad h_x\ge 0,\qquad h_0=h_L=0. \] The entangler update is \[ h_x(t+\Delta t)=\min\{h_{x-1}(t),h_{x+1}(t)\}+1, \] and the disentangler update is \[ h_x(t+\Delta t)=\max\{h_{x-1}(t),h_{x+1}(t),1\}-1. \] Numerically, the model has a continuous transition at \(p_c^{\rm(classical)}=1/2\), separating a volume-law phase from an area-law phase. At criticality, \(\overline{h_{L/2}}\sim \sqrt{L}\) and the spatial fluctuations \(W\sim\sqrt{L}\). Dynamically, \(\overline{h_{L/2}(t)}\sim t^\beta\) with \(\beta=1/4\) and \(z=2\). Through a mapping to the stochastic Fredkin chain, one analytically obtains \(\nu=1\), consistent with \(\xi\sim |p-p_c|^{-1}\) [2304.12965]. In the Clifford circuit model, the entangler places a random two-qubit Clifford gate and the disentangler uses local stabilizer information on qubits \(x,x+1\) to search a minimal subset of 19 Clifford gates, shown sufficient in the appendix, that maximally reduce the entropy across \(x\). The resulting transition occurs at \[ p_c^{\rm(Clifford)}\approx 0.382. \] The reported scaling mirrors the classical model: \(\overline{S_{L/2}}\sim \sqrt{L}\), \(W\sim\sqrt{L}\), growth \(\sim t^{1/4}\), \(\nu\approx 1\), and \(z=2\) at criticality. Deep in the volume-law phase the dynamics recover KPZ scaling with \(z=3/2\), while the area-law regime has \(z=0\) [2304.12965]. The Haar-random \(U(4)\) model behaves differently. The entangler draws each two-qubit gate from Haar measure on \(U(4)\), and the disentangler performs a local continuous optimization over 9 parameters to minimize the von Neumann entropy. The reported numerics show no finite \(p_c<1\): for any \(0\le p<1\), the late-time state is maximally entangled, with \[ S_{L/2}/L\to 1/2 \] as \(L\to\infty\). The heuristic argument is that Haar-random dynamics rapidly build high-Schmidt-rank multipartite entanglement regions of length \(\ell\), whose local disentangling time scales as \(\exp(\ell)\), while the entangler can grow them linearly in \(\ell\). The equilibration time diverges exponentially in \(1/(1-p)\) as \(p\to 1\) [2304.12965]. This contrast is central to the subject. In restricted models, local unitary disentanglers can drive genuine area-law/volume-law transitions. In fully Haar-random local dynamics, the entangler wins for any nonzero entangling rate. The literature therefore distinguishes sharply between the effectiveness of local unitary “cooling” and the more drastic entanglement suppression associated with non-unitary measurement dynamics [2304.12965]. ## 4. Matchgate realizations and free-fermion entanglement transitions A later development studies unitary circuit games within matchgate dynamics, equivalently evolutions of non-interacting fermions. The system is an open chain of \(L\) qubits carrying a fermionic Gaussian state. At each time step one bond \(b\in\{1,\dots,L-1\}\) is chosen uniformly, and with probability \(1-p\) an entangler applies a random two-qubit unitary from an allowed ensemble, while with probability \(p\) a disentangler applies a two-qubit unitary chosen to reduce entanglement according to a specified strategy. Repetition for many time steps yields a steady state whose phase is diagnosed by the half-chain entropy \(S_{L/2}^{(n)}\) [2507.05055]. A nearest-neighbor matchgate on qubits \(i,i+1\) has the form \[ G(A,B) = \begin{pmatrix} a_{11}&0&0&a_{12}\\ 0&b_{11}&b_{12}&0\\ 0&b_{21}&b_{22}&0\\ a_{21}&0&0&a_{22} \end{pmatrix}, \qquad \det A=\det B, \] and is equivalent via Jordan–Wigner to evolution by a quadratic fermion Hamiltonian. Any pure fermionic Gaussian state is specified by its \(2L\times 2L\) covariance matrix \[ \Gamma_{kl}=\tfrac{i}{2}\langle[\gamma_k,\gamma_l]\rangle, \qquad \Gamma\Gamma^T=\mathds1. \] For a bipartition \(A\cup B\), the Rényi-\(n\) entropies are determined by the Williamson eigenvalues \(\lambda_j\) of the reduced \(\Gamma_A\), \[ S^{(n)}=\frac1{1-n}\sum_j \log_2\!\left[\left(\frac{1+\lambda_j}{2}\right)^n+\left(\frac{1-\lambda_j}{2}\right)^n\right]. \] The circuit representation called Right Standard Form organizes any pure fermionic Gaussian state into at most \(\lfloor L^2/4\rfloor\) nearest-neighbor matchgates arranged in diagonals. The RSF is optimal in gate count, and generalized Yang–Baxter moves, left–right moves on basis states, and local gate fusion allow any new gate to be absorbed into the RSF structure [2507.05055]. This representation yields a specific disentangling procedure. Given an RSF state and a chosen bond \(b\), one inserts an auxiliary identity gate on bond \(b\) and runs the absorption algorithm. The identity is absorbed by an existing gate, which becomes the target to remove. Reversing the absorption steps produces a two-qubit unitary \(A\) such that \[ |\psi\rangle = A_{b,b+1}\,V\,|00\ldots 0\rangle, \] where \(V\) has one fewer gate. The disentangling move is then \(A^\dagger\) on bond \(b\). Repeated application is guaranteed to reduce the total gate count to zero, i.e. to a product state [2507.05055]. The phase structure depends strongly on the allowed gate set and the disentangling rule. For braiding gates, which are the intersection of Clifford gates and matchgates, the local entropy minimizer works perfectly. The critical point is \[ p_c=0, \] so any finite \(p>0\) yields an area law. As \(p\to 0\), the correlation length diverges as \(\xi\sim p^{-\nu}\) with numerically \(\nu\approx 1\). At \(p=0\), entanglement growth is diffusive, \(S\sim \sqrt{t}\), and the equilibration time scales as \(L^2\), while the disentangling time scales as \(L\) [2507.05055]. For generic matchgates, the local von Neumann-entropy minimizer does not reveal a clear transition up to \(p\approx 0.6\); the numerics are reported as inconclusive. By contrast, the gate disentangler based on RSF gives sharp results. For Rényi-0 entropy, an exact Bell-pair mapping with \(O(1)\) updates yields \[ p_c=1/2,\qquad \nu\approx 1. \] For \(p<1/2\), the steady state has volume law \(S^{(0)}_{L/2}=L/2\); for \(p>1/2\), it has area law \(O(1)\); and at \(p_c\) it shows submaximal volume law \(S^{(0)}_{L/2}=L/4\). Growth is ballistic in the volume phase with velocity \(\sim (1/2-p)\) and diffusive at criticality [2507.05055]. For the von Neumann entropy with the same gate disentangler, the critical point remains \[ p_c=1/2. \] Below criticality, \[ S_{L/2}\sim s(p)\,L, \qquad s(p)\sim (1/2-p)^\beta, \qquad \beta\approx 0.33. \] At \(p=1/2\), the leading scaling is \(S_{L/2}\propto \sqrt{L}\), with a fitted subleading term \(\sim L^{1/2-\gamma}\) and \(\gamma\approx 0.19\), while for \(p>1/2\) the system is again area law with \(S=O(1)\) [2507.05055]. These results sharpen the broader entangler–disentangler picture. They show that the existence and location of an entanglement transition are not determined by the competition rate \(p\) alone, but also by algebraic structure of the gate set and by whether the disentangler uses a merely local entropy minimizer or an optimal gate-count compression strategy. A plausible implication is that “disentangling power” in unitary circuit games is best understood as a representation-dependent resource, not simply as a local variational optimization criterion. ## 5. Cooperative quantization, QRA, and quantum Shapley payoffs A distinct line of work studies cooperative games by quantizing their circuit representation. The framework is inspired by the Eisert–Wilkens–Lewenstein protocol, modified to represent cooperation between players and extended to \(3\)-qubit states. In the two-qubit case, the entangling gate is \[ J(\gamma)=\exp\!\bigl(i\,\tfrac{\gamma}{2}\,\sigma_x\otimes\sigma_x\bigr), \] with matrix form given explicitly in the source, and the initial state is \[ |\psi_0\rangle=|00\rangle, \] corresponding to “no one cooperates.” Acting on \(|00\rangle\), this produces \[ J(\gamma)|00\rangle = \cos\frac{\gamma}{2}\,|00\rangle + i\sin\frac{\gamma}{2}\,|11\rangle, \] which interpolates from product to Bell-type entanglement, with full Bell-type entanglement at \(\gamma=\pi/2\) [2310.18067]. Each player \(i\) chooses a local unitary \[ U_i(\theta_i,\phi_i) = \begin{pmatrix} e^{i\phi_i}\cos\frac{\theta_i}{2} & \sin\frac{\theta_i}{2}\\ -\sin\frac{\theta_i}{2} & e^{-i\phi_i}\cos\frac{\theta_i}{2} \end{pmatrix}. \] The classical binary actions are embedded by identifying “Cooperate” with \(\theta=0\) and “Defect” with \(\theta=\pi\). The two-player circuit prepares \(|0\rangle_A\otimes |0\rangle_B\), applies \(J(\gamma)\), applies local strategy unitaries \(U_A\otimes U_B\), optionally applies \(J^\dagger(\gamma)\otimes I\), and finally measures in the computational basis. Algebraically, \[ |\psi_f\rangle = (J^\dagger(\gamma)\otimes I)\, [U_A\otimes U_B]\, (J(\gamma)\otimes I)\,|00\rangle \] in the formulation that includes the final disentangler [2310.18067]. The computational formalism is Quantum Register Algebra, built from a real geometric algebra \(\mathbb G_{2n+2}\) with signature \((n,n)\), a pseudo-scalar \(\iota\), and a Witt basis \[ f_i=\tfrac12(e_i+\iota e_{i+n}), \qquad f_i^\dagger=\tfrac12(e_i-\iota e_{i+n}), \] satisfying \[ \{f_i,f_j\}=0,\qquad \{f_i,f_j^\dagger\}=\delta_{ij},\qquad (f_i)^2=(f_i^\dagger)^2=0. \] With the idempotent \[ I=f_1f_1^\dagger\cdots f_nf_n^\dagger, \] basis states are identified as \[ |a_1\cdots a_n\rangle \longleftrightarrow (f_1^\dagger)^{a_1}\cdots (f_n^\dagger)^{a_n} I. \] Gates are even multivectors, serial composition is Clifford multiplication, and tensor products require a sign-bookkeeping rule. In particular, \[ \sigma_x^{(i)}\sim f_i+f_i^\dagger, \qquad \sigma_z^{(i)}\sim f_i f_i^\dagger-f_i^\dagger f_i, \] while more complex gates such as CNOT, SWAP, and Hadamard have closed-form expressions in the \(f_i,f_i^\dagger\) language [2310.18067]. Payoffs are assigned through a quantum Shapley value. For final density matrix \(\rho_f=|\psi_f\rangle\langle\psi_f|\), the value for player \(i\) is \[ \widetilde\Phi_i = \sum_{S\subseteq N\setminus\{i\}} \frac{|S|!\,(n-|S|-1)!}{n!}\, \bigl[ \mathrm{Tr}(P_{S\cup\{i\}}\rho_f) - \mathrm{Tr}(P_S\rho_f) \bigr], \] where \(P_T\) projects onto computational basis states whose support of “1”s is exactly \(T\). This replaces classical coalition probabilities by quantum measurement probabilities while retaining classical Shapley weights [2310.18067]. The framework also emphasizes symbolic verification. QRA descriptions can be entered into the GAALOPWeb symbolic engine, and the ordering inside \[ J_2(\gamma_{12},\gamma_{13},\gamma_{23}) = (\mathrm{SWAP}\otimes I)\,(I\otimes J_{13})\,(\mathrm{SWAP}\otimes I)\,(I\otimes J_{23})\,(J_{12}\otimes I) \] is proved commutative by checking \[ S_1-S_2=0,\qquad S_1-S_3=0,\qquad S_2-S_3=0 \] for three orderings. The paper describes this as an automated proof of circuit equivalence and presents the construction as a blueprint for scaling to \(n\)-player cooperative quantum games [2310.18067]. ## 6. Higher-order game semantics for unitary computation A more abstract strand replaces concrete players and qubit chains by a category of games whose morphisms represent unitary computation. The basic category \(\G\) has objects \[ G=(M,\lambda,\qcoh,P), \] where \(M\) is a finite set of moves, \(\lambda:M\to\{O,P\}\times\{Q,A\}\) labels each move as Opponent or Player and Question or Answer, \(\qcoh\subseteq M_A\times M_A\) is a symmetric coherence relation on answer moves, and \(P\subseteq M^*\) is the set of maximal plays satisfying alternation, well-balanced question–answer structure, existence of maximal \(O\)- and \(P\)-cliques of answers, and an extension property for partial plays [2404.06646]. From each game one obtains finite-dimensional Hilbert spaces \[ \mathcal H_O(G)=\mathbb C^{\{\text{maximal $O$-cliques in }G\}}, \qquad \mathcal H_P(G)=\mathbb C^{\{\text{maximal $P$-cliques in }G\}}. \] A morphism or strategy \(\sigma:G\to H\) is a suitable subset of plays in \(G\multimap H\) satisfying determinacy, receptivity, monotonicity, and \(\qcoh\)-preservation. Extensional equivalence is equality of the induced linear map \[ [\sigma]:\mathcal H_O(G)\longrightarrow \mathcal H_P(H). \] Composition is parallel composition plus hiding, or equivalently a trace-operator of a GoI-style construction, and the model proves \[ [\sigma;\tau]=[\sigma]\circ[\tau], \] guaranteeing strict associativity [2404.06646]. The category is symmetric monoidal closed. Tensor product \(G\otimes H\) is a disjoint sum of moves with Opponent switching between components, yielding \[ \mathcal H_O(G\otimes H)\cong \mathcal H_O(G)\otimes \mathcal H_O(H), \qquad \mathcal H_P(G\otimes H)\cong \mathcal H_P(G)\otimes \mathcal H_P(H). \] The internal hom \(G\multimap H\) is formed by reversing polarity in \(G\) and imposing the constraint that a maximal play visits \(G\) first and then \(H\). Additives are also defined: \(G\with H\), where Opponent chooses the component, and \(G\oplus H\), where Player chooses it. The coherence diagrams for units, associators, symmetries, and distributivities commute up to the stated strategy-equivalences [2404.06646]. Base quantum types are encoded directly. The quantum bit is the game \[ \qbit = (\{\star\},\lambda(\star)=(O,Q),\emptyset,P=\{\star 0,\star 1\}), \] so \[ \mathcal H_O(\qbit)=\mathbb C\{\ket\star\}, \qquad \mathcal H_P(\qbit)=\mathbb C\{\ket 0,\ket 1\}\cong \mathbb C^2. \] More generally, \[ n\text{-}\qbit=\qbit^{\otimes n}, \qquad \mathcal H_P(n\text{-}\qbit)\cong (\mathbb C^2)^{\otimes n}. \] A strategy \(\sigma:n\text{-}\qbit\to n\text{-}\qbit\) is called unitary iff \([\sigma]\) is a unitary matrix and \(\sigma\) can be written as a finite \(\mathbb C\)-linear combination of reversible partial-injection strategies. These morphisms form a subcategory \(\UG\subseteq \G\) [2404.06646]. Concrete gates appear as strategies. The Hadamard gate is written as \[ H=\frac1{\sqrt2}(\Id+X), \] with copycat implementing the identity and a NOT-strategy implementing the swap matrix. CNOT on two qubits is represented by a single deterministic reversible strategy whose action on maximal \(O\)-cliques is exactly the CNOT truth table. Sequential composition models back-to-back gates, tensor models side-by-side gates on disjoint wires, and the closed structure interprets higher-order circuit constructors such as morphisms \[ \Sigma:(A\otimes B)\multimap C \qquad\text{or equivalently}\qquad A\to (B\multimap C). \] The universality theorem states that every unitary operator \[ U:(\mathbb C^2)^{\otimes n}\to (\mathbb C^2)^{\otimes n} \] is realized by some morphism \[ \sigma:n\text{-}\qbit\to n\text{-}\qbit \] in \(\UG\) [2404.06646]. This semantic line broadens the meaning of unitary circuit games from explicit multi-agent competition to a structured theory of interactive computation. It shows that “game” can refer not only to strategic conflict or cooperation but also to the combinatorial organization of higher-order unitary processes themselves. Source: https://www.emergentmind.com/topics/unitary-circuit-games