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

arXiv:1702.05719 · Games and Economic Behavior

Playing games with bounded entropy

Mehrdad Valizadeh, Amin Gohari

Published Jun 1, 2017• 7 citations
arXivHTMLPDF
DOI
10.1016/j.geb.2019.03.013

Related papers

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

Quantum Games and Minimum Entropy

Edward Jiménez

Lecture notes in computer science•Nov 19, 2010•6 citations

Quantum games entropy

Esteban Guevara Hidalgo

arXiv:quant-ph/0606045•Physica A Statistical Mechanics and its Applications•May 24, 2007•13 citations

The heat price of precision

Seth Douglas, Nidhal Mghirbi

Does playing a nonlocal game more precisely require more heat? We study devices that start and finish in pure product blanks, receive thermal answer carriers, and release classical answers. The answer depends on when the devices may communicate again. If they reset locally first, their minimum cyclic work differs from the game's minimum mutual information by a bounded alphabet cost and is at least twice its one-way distillable entanglement demand. Published entanglement bounds therefore give fixed finite games with local work $2\alpha\log_2(1/\varepsilon)+O(\log\log(1/\varepsilon))$, for a dense set of coefficients $\alpha$, including transcendental values. Quantum reunion before reset keeps the work bounded. With coherent block recovery allowing $q$ qubits and $c$ dephased bits per play, the leading cost is $(\alpha L-q)_++(\alpha L-q-c)_+$, where $L=\log_2(1/\varepsilon)$. A relative-entropy potential proves the lower bound; compression proves the upper bound. An exact entropy-production identity records arbitrary schedules without solving their optimization. For exactly matched controls, a sector allocation theorem evaluates the entanglement and correlation costs. A W-state example shows why knowledge of accessible marginals cannot replace operational access. Perfect magic-square play has cyclic local work exactly four units. Work and bath heat agree at the zero-energy endpoints used here; one unit is $k_BT\ln2$.

•Oct 27, 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

Playing quantum games

Karmela Padavic-Callaghan

The New Scientist•Jul 1, 2026•0 citations
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.
Does playing a nonlocal game more precisely require more heat? We study devices that start and finish in pure product blanks, receive thermal answer carriers, and release classical answers. The answer depends on when the devices may communicate again. If they reset locally first, their minimum cyclic work differs from the game's minimum mutual information by a bounded alphabet cost and is at least twice its one-way distillable entanglement demand. Published entanglement bounds therefore give fixed finite games with local work 2αlog⁡2(1/ε)+O(log⁡log⁡(1/ε))2\alpha\log_2(1/\varepsilon)+O(\log\log(1/\varepsilon))2αlog2​(1/ε)+O(loglog(1/ε)), for a dense set of coefficients α\alphaα, including transcendental values. Quantum reunion before reset keeps the work bounded. With coherent block recovery allowing qqq qubits and ccc dephased bits per play, the leading cost is (αL−q)++(αL−q−c)+(\alpha L-q)_++(\alpha L-q-c)_+(αL−q)+​+(αL−q−c)+​, where L=log⁡2(1/ε)L=\log_2(1/\varepsilon)L=log2​(1/ε). A relative-entropy potential proves the lower bound; compression proves the upper bound. An exact entropy-production identity records arbitrary schedules without solving their optimization. For exactly matched controls, a sector allocation theorem evaluates the entanglement and correlation costs. A W-state example shows why knowledge of accessible marginals cannot replace operational access. Perfect magic-square play has cyclic local work exactly four units. Work and bath heat agree at the zero-energy endpoints used here; one unit is kBTln⁡2k_BT\ln2kB​Tln2.
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.