Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A finite game that normal hyperfinite strategies approach but never win

Seth Douglas, Nidhal Mghirbi

Published Oct 30, 2026• 2 citations
Publisher

Abstract

We exhibit non-closedness at perfect play for normal injective hosts: an explicit finite two-player game with 0/1 scoring has a perfect commuting-operator correlation approached by finite-dimensional quantum correlations, while no perfect strategy has a normal marginal on an injective von Neumann algebra of either player. The game has 561 Alice questions, 157 Bob questions, 3,696 sampled pairs and at most 20 answers per question. Perfect play is realized on a matrix amplification of the Bellaterra critical-KMS factor of type III with parameter 1/2. After restricting to the support of the chosen normal marginal, every perfect strategy yields a modular Cuntz pair and six self-similar relations that force the canonical trace on the free product of three groups of order two. The resulting noninjective group von Neumann algebra is an expected subalgebra of that support corner, with a faithful normal state-preserving expectation. A two-sided POVM lift through a matrix ultraproduct proves approximation by finite systems. Consequently correlations admitting normal injective hosts are not closed. Under the explicit hypotheses of Halvorson's Proposition 2.31, locally normal quantum-field-theory strategies cannot win exactly. We also formulate a KMS-face criterion for complete modular presentations. Exact arithmetic certificates check every supported losing event; the forcing proof applies to arbitrary normal strategies.

DOI
10.5281/zenodo.23816140

Related papers

Finite games that read the type of a von Neumann algebra

Seth Douglas, Nidhal Mghirbi

We construct finite two-player games with binary scoring whose normal strategies distinguish operator-algebraic type. A 243-pair game has perfect play in type III and none when either ambient algebra is semifinite. For factors with separable predual, hosting it is equivalent to an invariant normal state on the flow of weights, or to an expected hyperfinite type III1 subfactor. A different quantifier recovers that invariant: every faithful normal state has value one for the flagged magic-square game exactly when 1/2 belongs to the Connes invariant; a nine-question conference-basis game gives the corresponding criterion for 1/3. Together these two response properties characterize type III1. One prepared state already wins both games in dimension 25. We prove that every positive rational is forced as a modular ratio by some finite game, and identify the exact rational orthogonal-pair single-bridge parameters. For the type-III-only game, a robust sorted spectral law holds for every normal semifinite strategy. It yields matching entropy, deficit, dimension and variance exponents, including an exponential inverse-square-root dimension law. The sharp robustness constant is conjectural. No validated numerical constant is given. Normal spatial perfection forces log dimension and entropy to be little-o of the inverse square root of loss, giving a type-exponent wall. The specified normal semifinite perturbative gravitational models cannot attain perfect play, whereas suitable type III quantum-field-theory hosts can. This conditional algebraic consequence gives no preparation or energy bound.

•Oct 30, 2026•5 citations

Perfect play in a binary-scoring nonlocal game requires infinite dimension but only finite energy

Seth Douglas, Nidhal Mghirbi

A finite rational binary-scoring game can require infinite dimension for perfect play while admitting finite energy and finite entanglement entropy. Our game has ten Alice questions, eleven Bob questions, at most six answers, and 52 uniform question pairs. It is spatially perfect and never finitely perfect, with sharp dimension profile $D_\Gamma(\varepsilon)=10\log_2(1/\varepsilon)+O(\log\log(1/\varepsilon))$. Among pure perfect strategies, the displayed strategy attains the least entanglement entropy, $5.362740278498934$ ebits, and least mean occupation, $275/18$ per oscillator. We classify all perfect normal type-I marginal spectra and prove that this spectrum is the unique majorization maximum. These constants are also the small-loss limits of the entropy and one-sided oscillator energy prices. In the massive free scalar field we construct a pure perfect state in two strictly separated bounded regions, equal to the vacuum outside a bounded containing region and with every polynomial energy moment finite. In contrast, every fixed faithful split state has a positive loss floor; the complementary-wedge vacuum has supremum one without attainment. Energy-analytic states, bounded-region invertible vacuum preparations and product-Kraus preparations cannot be perfect. Every perfect pure spatial strategy has infinite Schmidt rank; finite entropy is attained but not forced. In every type-II$_1$ factor the normalized trace has a loss floor, while bounded faithful prepared densities win perfectly with sharp trace-entropy deficit $\Delta_* = \ln(7/6)-\ln(2)/7$. Type-II$_\infty$ permits every finite trace entropy. A graded modular ladder gives a normal semifinite hosting criterion. Its scalar fingerprint has sharp capacity and entropy-gap bounds; the capacity floor is approached but not attained in type I, and attained in type II.

•Oct 29, 2026•0 citations

Perfect play in a binary-scoring nonlocal game requires infinite dimension but only finite energy

Seth Douglas, Nidhal Mghirbi

A finite rational binary-scoring game can require infinite dimension for perfect play while admitting finite energy and finite entanglement entropy. Our game has ten Alice questions, eleven Bob questions, at most six answers, and 52 uniform question pairs. It is spatially perfect and never finitely perfect, with sharp dimension profile $D_\Gamma(\varepsilon)=10\log_2(1/\varepsilon)+O(\log\log(1/\varepsilon))$. Among pure perfect strategies, the displayed strategy attains the least entanglement entropy, $5.362740278498934$ ebits, and least mean occupation, $275/18$ per oscillator. We classify all perfect normal type-I marginal spectra and prove that this spectrum is the unique majorization maximum. These constants are also the small-loss limits of the entropy and one-sided oscillator energy prices. In the massive free scalar field we construct a pure perfect state in two strictly separated bounded regions, equal to the vacuum outside a bounded containing region and with every polynomial energy moment finite. In contrast, every fixed faithful split state has a positive loss floor; the complementary-wedge vacuum has supremum one without attainment. Energy-analytic states, bounded-region invertible vacuum preparations and product-Kraus preparations cannot be perfect. Every perfect pure spatial strategy has infinite Schmidt rank; finite entropy is attained but not forced. In every type-II$_1$ factor the normalized trace has a loss floor, while bounded faithful prepared densities win perfectly with sharp trace-entropy deficit $\Delta_* = \ln(7/6)-\ln(2)/7$. Type-II$_\infty$ permits every finite trace entropy. A graded modular ladder gives a normal semifinite hosting criterion. Its scalar fingerprint has sharp capacity and entropy-gap bounds; the capacity floor is approached but not attained in type I, and attained in type II.

•Oct 29, 2026•4 citations

Perfect play in a binary-scoring nonlocal game requires infinite dimension

Seth Douglas, Nidhal Mghirbi

We construct a finite rational two-player nonlocal game with ten Alice questions, eleven Bob questions, at most six answers per question and 52 equally likely supported pairs. It has a perfect spatial strategy and no perfect finite-dimensional strategy. For arbitrary finite-dimensional local POVMs and mixed states, its dimension profile is D_Gamma(epsilon) = 10 log2(1/epsilon) + O(log log(1/epsilon)). The lower bound is 10 log2(1/epsilon) - 10 log2 log2(1/epsilon) - O(1). A direct square-root magic-square extraction, robust flagged sector law and approximate gluing force twenty Schmidt coefficients per appreciable halving level. The explicit strategy compressed to 20K dimensions has loss exactly 1/[624(4^K-1)], yielding the matching leading upper coefficient 10.

•Oct 29, 2026•0 citations

Perfect play with spatial quantum strategies is Σ⁰₂-complete

Seth Douglas, Nidhal Mghirbi

When does a finite nonlocal game admit perfect spatial quantum play? We prove that this decision problem is complete for the second existential level of the arithmetical hierarchy. The same classification holds when a perfect strategy must have finite marginal entropy. Hardness persists among games whose finite-dimensional value is one and which have no finite-dimensional perfect strategy. A finite clock-phase order supplies the existential witness: normality forces a finite order on a nonzero sector, while the strategy chooses the order. For the upper bound, we normalize the largest Schmidt coefficient and use compact operator sandwiches. Fixing a lower bound on the largest Schmidt probability gives a co-recursively enumerable stratum. No computable bound selects a sufficient stratum for every game. Exact attainment of a rational Bell bound, of an unspecified supremum, and of a specified scalar value is also Sigma^0_2-complete. The hardness proof extends the modular-shift and rational-row toolkit of our earlier entropy-game paper to four calibrated bridges and a deterministic computation on rooted finite squares.

•Nov 3, 2026•4 citations

A trace costs one quantifier: the exact complexity of perfect play in nonlocal games

Seth Douglas, Nidhal Mghirbi

Given a finite nonlocal game, can the players win with certainty? We prove that the existence of a perfect normal spatial strategy is Σ⁰₂-complete, even when restricted to games of value one, so it cannot be decided even with an oracle for the halting problem. This is strictly harder than perfect play in the finite-dimensional and commuting-operator models, which are Σ⁰₁-complete and Π⁰₁-complete. Within the commuting model, the existence of a perfect normal strategy with a finite or semifinite von Neumann host is Σ⁰₂-complete, whereas for every fixed type III_λ subtype it has the same Π⁰₁-complete language as unrestricted commuting play. A trace thus costs one existential number quantifier: the hardness constructions force every perfect strategy to choose a finite clock period or a finite tree depth. The spatial classification persists when finite entanglement entropy is required, and it is formally verified in Lean, assuming only a special case of Tarski's decision theorem. We also prove Σ⁰₂-completeness for one-shot zero-error communication with normal entanglement, and construct a finite channel with zero-error codes of a given size every one of which needs infinite entanglement entropy.

arXiv:2611.10481•Nov 4, 2026•0 citations
We exhibit non-closedness at perfect play for normal injective hosts: an explicit finite two-player game with 0/1 scoring has a perfect commuting-operator correlation approached by finite-dimensional quantum correlations, while no perfect strategy has a normal marginal on an injective von Neumann algebra of either player. The game has 561 Alice questions, 157 Bob questions, 3,696 sampled pairs and at most 20 answers per question. Perfect play is realized on a matrix amplification of the Bellaterra critical-KMS factor of type III with parameter 1/2. After restricting to the support of the chosen normal marginal, every perfect strategy yields a modular Cuntz pair and six self-similar relations that force the canonical trace on the free product of three groups of order two. The resulting noninjective group von Neumann algebra is an expected subalgebra of that support corner, with a faithful normal state-preserving expectation. A two-sided POVM lift through a matrix ultraproduct proves approximation by finite systems. Consequently correlations admitting normal injective hosts are not closed. Under the explicit hypotheses of Halvorson's Proposition 2.31, locally normal quantum-field-theory strategies cannot win exactly. We also formulate a KMS-face criterion for complete modular presentations. Exact arithmetic certificates check every supported losing event; the forcing proof applies to arbitrary normal strategies.
We construct finite two-player games with binary scoring whose normal strategies distinguish operator-algebraic type. A 243-pair game has perfect play in type III and none when either ambient algebra is semifinite. For factors with separable predual, hosting it is equivalent to an invariant normal state on the flow of weights, or to an expected hyperfinite type III1 subfactor. A different quantifier recovers that invariant: every faithful normal state has value one for the flagged magic-square game exactly when 1/2 belongs to the Connes invariant; a nine-question conference-basis game gives the corresponding criterion for 1/3. Together these two response properties characterize type III1. One prepared state already wins both games in dimension 25. We prove that every positive rational is forced as a modular ratio by some finite game, and identify the exact rational orthogonal-pair single-bridge parameters. For the type-III-only game, a robust sorted spectral law holds for every normal semifinite strategy. It yields matching entropy, deficit, dimension and variance exponents, including an exponential inverse-square-root dimension law. The sharp robustness constant is conjectural. No validated numerical constant is given. Normal spatial perfection forces log dimension and entropy to be little-o of the inverse square root of loss, giving a type-exponent wall. The specified normal semifinite perturbative gravitational models cannot attain perfect play, whereas suitable type III quantum-field-theory hosts can. This conditional algebraic consequence gives no preparation or energy bound.
A finite rational binary-scoring game can require infinite dimension for perfect play while admitting finite energy and finite entanglement entropy. Our game has ten Alice questions, eleven Bob questions, at most six answers, and 52 uniform question pairs. It is spatially perfect and never finitely perfect, with sharp dimension profile DΓ(ε)=10log⁡2(1/ε)+O(log⁡log⁡(1/ε))D_\Gamma(\varepsilon)=10\log_2(1/\varepsilon)+O(\log\log(1/\varepsilon))DΓ​(ε)=10log2​(1/ε)+O(loglog(1/ε)). Among pure perfect strategies, the displayed strategy attains the least entanglement entropy, 5.3627402784989345.3627402784989345.362740278498934 ebits, and least mean occupation, 275/18275/18275/18 per oscillator. We classify all perfect normal type-I marginal spectra and prove that this spectrum is the unique majorization maximum. These constants are also the small-loss limits of the entropy and one-sided oscillator energy prices. In the massive free scalar field we construct a pure perfect state in two strictly separated bounded regions, equal to the vacuum outside a bounded containing region and with every polynomial energy moment finite. In contrast, every fixed faithful split state has a positive loss floor; the complementary-wedge vacuum has supremum one without attainment. Energy-analytic states, bounded-region invertible vacuum preparations and product-Kraus preparations cannot be perfect. Every perfect pure spatial strategy has infinite Schmidt rank; finite entropy is attained but not forced. In every type-II1_11​ factor the normalized trace has a loss floor, while bounded faithful prepared densities win perfectly with sharp trace-entropy deficit Δ∗=ln⁡(7/6)−ln⁡(2)/7\Delta_* = \ln(7/6)-\ln(2)/7Δ∗​=ln(7/6)−ln(2)/7. Type-II∞_\infty∞​ permits every finite trace entropy. A graded modular ladder gives a normal semifinite hosting criterion. Its scalar fingerprint has sharp capacity and entropy-gap bounds; the capacity floor is approached but not attained in type I, and attained in type II.
A finite rational binary-scoring game can require infinite dimension for perfect play while admitting finite energy and finite entanglement entropy. Our game has ten Alice questions, eleven Bob questions, at most six answers, and 52 uniform question pairs. It is spatially perfect and never finitely perfect, with sharp dimension profile DΓ(ε)=10log⁡2(1/ε)+O(log⁡log⁡(1/ε))D_\Gamma(\varepsilon)=10\log_2(1/\varepsilon)+O(\log\log(1/\varepsilon))DΓ​(ε)=10log2​(1/ε)+O(loglog(1/ε)). Among pure perfect strategies, the displayed strategy attains the least entanglement entropy, 5.3627402784989345.3627402784989345.362740278498934 ebits, and least mean occupation, 275/18275/18275/18 per oscillator. We classify all perfect normal type-I marginal spectra and prove that this spectrum is the unique majorization maximum. These constants are also the small-loss limits of the entropy and one-sided oscillator energy prices. In the massive free scalar field we construct a pure perfect state in two strictly separated bounded regions, equal to the vacuum outside a bounded containing region and with every polynomial energy moment finite. In contrast, every fixed faithful split state has a positive loss floor; the complementary-wedge vacuum has supremum one without attainment. Energy-analytic states, bounded-region invertible vacuum preparations and product-Kraus preparations cannot be perfect. Every perfect pure spatial strategy has infinite Schmidt rank; finite entropy is attained but not forced. In every type-II1_11​ factor the normalized trace has a loss floor, while bounded faithful prepared densities win perfectly with sharp trace-entropy deficit Δ∗=ln⁡(7/6)−ln⁡(2)/7\Delta_* = \ln(7/6)-\ln(2)/7Δ∗​=ln(7/6)−ln(2)/7. Type-II∞_\infty∞​ permits every finite trace entropy. A graded modular ladder gives a normal semifinite hosting criterion. Its scalar fingerprint has sharp capacity and entropy-gap bounds; the capacity floor is approached but not attained in type I, and attained in type II.
We construct a finite rational two-player nonlocal game with ten Alice questions, eleven Bob questions, at most six answers per question and 52 equally likely supported pairs. It has a perfect spatial strategy and no perfect finite-dimensional strategy. For arbitrary finite-dimensional local POVMs and mixed states, its dimension profile is D_Gamma(epsilon) = 10 log2(1/epsilon) + O(log log(1/epsilon)). The lower bound is 10 log2(1/epsilon) - 10 log2 log2(1/epsilon) - O(1). A direct square-root magic-square extraction, robust flagged sector law and approximate gluing force twenty Schmidt coefficients per appreciable halving level. The explicit strategy compressed to 20K dimensions has loss exactly 1/[624(4^K-1)], yielding the matching leading upper coefficient 10.
When does a finite nonlocal game admit perfect spatial quantum play? We prove that this decision problem is complete for the second existential level of the arithmetical hierarchy. The same classification holds when a perfect strategy must have finite marginal entropy. Hardness persists among games whose finite-dimensional value is one and which have no finite-dimensional perfect strategy. A finite clock-phase order supplies the existential witness: normality forces a finite order on a nonzero sector, while the strategy chooses the order. For the upper bound, we normalize the largest Schmidt coefficient and use compact operator sandwiches. Fixing a lower bound on the largest Schmidt probability gives a co-recursively enumerable stratum. No computable bound selects a sufficient stratum for every game. Exact attainment of a rational Bell bound, of an unspecified supremum, and of a specified scalar value is also Sigma^0_2-complete. The hardness proof extends the modular-shift and rational-row toolkit of our earlier entropy-game paper to four calibrated bridges and a deterministic computation on rooted finite squares.
Given a finite nonlocal game, can the players win with certainty? We prove that the existence of a perfect normal spatial strategy is Σ⁰₂-complete, even when restricted to games of value one, so it cannot be decided even with an oracle for the halting problem. This is strictly harder than perfect play in the finite-dimensional and commuting-operator models, which are Σ⁰₁-complete and Π⁰₁-complete. Within the commuting model, the existence of a perfect normal strategy with a finite or semifinite von Neumann host is Σ⁰₂-complete, whereas for every fixed type III_λ subtype it has the same Π⁰₁-complete language as unrestricted commuting play. A trace thus costs one existential number quantifier: the hardness constructions force every perfect strategy to choose a finite clock period or a finite tree depth. The spatial classification persists when finite entanglement entropy is required, and it is formally verified in Lean, assuming only a special case of Tarski's decision theorem. We also prove Σ⁰₂-completeness for one-shot zero-error communication with normal entanglement, and construct a finite channel with zero-error codes of a given size every one of which needs infinite entanglement entropy.