Homomorphism Games: Combinatorial & Quantum Approaches

Updated 11 May 2026

Homomorphism games are two-player perfect-information games that recast adjacency-preserving maps between discrete structures into interactive rounds, unifying graph theory with logic.
They have versatile applications including graph coloring, independence testing, and quantum non-locality, illustrating deep links between combinatorics and quantum information.
The framework leverages algebraic, categorical, and operator-algebraic methods to analyze logical equivalences, game invariants, and computational complexity.

A homomorphism game is a family of combinatorial, algebraic, and categorical constructs that translate structural questions about homomorphisms—adjacency-preserving maps—between discrete objects such as graphs, hypergraphs, trees, and operator systems into two-player perfect-information games. Central to finite model theory, quantum information, and modern categorical logic, homomorphism games generalize logical equivalence, graph invariants, and (quantum) non-local games, enabling the unification of classical, quantum, and operator-algebraic perspectives on combinatorics and logic.

1. Classical Homomorphism Games and Their Variants

In their elementary setting, homomorphism games operationalize the notion of a homomorphism between two structures (e.g., graphs $G$ and $H$ ) as a game between a "Spoiler" (Player I) and a "Duplicator" (Player II). For graphs, the homomorphism game is defined as follows:

Inputs: The referee selects vertices $x,x'\in V(G)$ and sends $x$ to Alice and $x'$ to Bob.
Outputs: Alice and Bob respond with $y,y'\in V(H)$ .
Winning condition: If $x=x'$ , then $y=y'$ ; if $x\sim x'$ ( $x$ is adjacent to $H$ 0), then $H$ 1 in $H$ 2 (Mančinska et al., 2012). Perfect play by deterministic strategies recovers classical homomorphisms: Alice and Bob can win with certainty if and only if $H$ 3.

Specializations and variants include:

Graph coloring games: $H$ 4, where a homomorphism to a $H$ 5-clique corresponds to a proper $H$ 6-coloring.
Independence and clique games: Encoded as $H$ 7 and $H$ 8, relating to quantum graph parameters (Harris, 2023).
Homomorphism games for labeled trees: The game $H$ 9 constructs a move-by-move simulation of partial homomorphisms, characterizing Shelah's and Erdős-type results for tree-indexed structures (Wilson, 2019).

In finite model theory, the classical homomorphism game framework naturally generalizes the Ehrenfeucht–Fraïssé game and pebble games, underpinning results such as Lovász's theorem: $x,x'\in V(G)$ 0 iff $x,x'\in V(G)$ 1 for all $x,x'\in V(G)$ 2 (Dawar et al., 2021).

2. Quantum and Operator-Algebraic Generalizations

The quantum homomorphism game upgrades classical input/output spaces and strategies to their operator-theoretic and entangled counterparts. In these settings, strategies are encoded by POVMs (or projectors), possibly over entangled states shared by players.

Quantum strategies: Alice and Bob, on receiving inputs $x,x'\in V(G)$ 3, respond with POVMs $x,x'\in V(G)$ 4 and $x,x'\in V(G)$ 5, producing the correlation $x,x'\in V(G)$ 6, subject to adjacency and diagonal constraints (Mančinska et al., 2012).
Perfect quantum strategies: $x,x'\in V(G)$ 7 whenever forbidden by the game's winning conditions; i.e., a quantum homomorphism $x,x'\in V(G)$ 8 exists (Mančinska et al., 2012).
Operator-algebraic framework: Strategies correspond to unital $x,x'\in V(G)$ 9-homomorphisms into appropriate C $x$ 0-algebras generated by the game's relations. Tracial states yield perfect quantum-commuting strategies (Brannan et al., 2021).
Quantum hypergraph and non-local games: Further abstraction leads to homomorphism games on quantum hypergraphs, where question-and-answer sets are operator systems or quantum sets, and homomorphisms are implemented as certain completely positive maps or no-signalling channels (Hoefer et al., 2023, Hoefer et al., 2022, Goldberg, 2024, Brannan et al., 2020).

An explicit characterization: For graphs, $x$ 1 if there exist projectors $x$ 2 satisfying:

$x$ 3 for all $x$ 4,
$x$ 5 whenever $x$ 6 and $x$ 7 or $x$ 8, $x$ 9 (Mančinska et al., 2012).

3. Universality and Reductions via Homomorphism Games

Homomorphism games encapsulate a universality: any synchronous non-local game is weakly $x'$ 0-equivalent to explicit graph coloring games and independence games, with quantum and classical strategies characterized via quantum graph parameters:

Reduction to 3-coloring: Any synchronous non-local game $x'$ 1 admits a weak $x'$ 2-equivalent 3-coloring game on a graph $x'$ 3 with $x'$ 4 vertices, where $x'$ 5 (Harris, 2023).
Independence-number universality: The game $x'$ 6 is hereditarily $x'$ 7-equivalent to $x'$ 8, where $x'$ 9 is the "graph of the game"; $y,y'\in V(H)$ 0 has a perfect $y,y'\in V(H)$ 1-strategy iff $y,y'\in V(H)$ 2 for $y,y'\in V(H)$ 3 in a hierarchy from classical to hereditary models.
Quantum graph parameters as invariants: The existence of perfect strategies—classical, quantum, approximately quantum, or commuting-operator—is fully determined by quantum chromatic, independence, and clique numbers derived from corresponding homomorphism games (Harris, 2023, Mančinska et al., 2012).

This establishes the complete invariant property of homomorphism game parameters across quantum logic models.

4. Categorical Logic and Game Comonads

Homomorphism games appear as the semantic content of various logical and categorical equivalences, especially via comonads:

Lovász-type theorems: Two objects $y,y'\in V(H)$ 4 are isomorphic in a locally finite category if and only if $y,y'\in V(H)$ 5 for all $y,y'\in V(H)$ 6 (Dawar et al., 2021).
Game comonads: The comonadic approach encodes combinatorial games (Ehrenfeucht–Fraïssé, $y,y'\in V(H)$ 7-pebble, etc.) as endofunctors with coalgebras corresponding to tree-depth, tree-width, or path-width decompositions (Dawar et al., 2021, Schindling, 24 Jun 2025).
Homomorphism indistinguishability: $y,y'\in V(H)$ 8 iff $y,y'\in V(H)$ 9 for all $x=x'$ 0 in a class $x=x'$ 1. Such equivalences correspond to isomorphisms in the co-Kleisli category of the associated game comonad (Schindling, 24 Jun 2025).

The categorical perspective unifies pebble games, pursuit-evasion games, and decomposition techniques, yielding new characterizations for logics with restricted conjunction, requantification, or resource constraints (Schindling, 24 Jun 2025).

Homomorphism games naturally generalize beyond Boolean semantics:

Semiring semantics: Interpreting logical models over commutative semirings $x=x'$ 2, homomorphism games characterize FO-equivalence up to rank $x=x'$ 3 provided $x=x'$ 4 admits a separating family of homomorphisms into the Boolean semiring. Soundness and completeness results hold for all lattice semirings—finite or infinite (Brinke et al., 2023).
Modal and other logics: Homomorphism counts over structured categories capture modal bisimulation games and their invariants, using synchronization-tree comonads (Dawar et al., 2021).
Transfinite and infinitary games: Infinite homomorphism games on labeled trees elucidate partition relations and yield proofs of Shelah-type combinatorial theorems (Wilson, 2019).

These directions demonstrate the broad scope of homomorphism games, connecting logic, combinatorics, operator algebras, and infinite combinatorics.

6. Limitations and Separations

Despite their universality, homomorphism games have expressivity constraints:

Limits of comonadic characterizations: Logics properly extending counting logics, such as linear-algebraic logics with invertible-map equivalences, cannot be characterized through homomorphism indistinguishability over any graph class, even with homomorphism counts in $x=x'$ 5 or finite fields. There is no finite-rank game comonad capturing IM-equivalence (Lichter et al., 2023).
Quantum vs. classical separation: There are hypergraphs and games admitting quantum, but not classical, isomorphisms and homomorphisms; e.g., cases where quantum independence number strictly exceeds the classical (Hoefer et al., 2022).
Model-theoretic separation: Homomorphism games can distinguish structures where classical games fail, and vice versa, especially in non-Boolean or weighted contexts (Brinke et al., 2023).

The boundaries of the homomorphism game paradigm thus correspond precisely to the algebraic and categorical structure of the models involved, and their interaction with logical expressiveness.

7. Operator-Algebraic and Channel-Theoretic Extensions

For quantum and noncommutative generalizations, homomorphism games naturally extend to:

Quantum-to-classical and quantum-to-quantum games: Input and/or output spaces may be operator systems or quantum sets. Strategies correspond to completely positive trace-preserving maps, or to tracial states on universal $x=x'$ 6-algebras resolving the game's relations (Brannan et al., 2020, Goldberg, 2024, Hoefer et al., 2023).
Simulation paradigm and no-signalling correlations: Quantum hypergraph homomorphisms are equivalently described by the existence of appropriate no-signalling channels, transforming information between quantum and classical channels, and relating to tensor products of canonical operator systems (Hoefer et al., 2022).
Order-theoretic properties: Quantum homomorphism relations form preorders modulo isomorphism, and in the local model are characterized by TRO equivalence of operator systems (Hoefer et al., 2023).