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

The heat price of precision

Seth Douglas, Nidhal Mghirbi

Published Oct 27, 2026• 0 citations
Publisher

Abstract

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$.

DOI
10.5281/zenodo.23701731

Related papers

The price of precision: usable entanglement in nonlocal games and the geometry of groups

Seth Douglas, Nidhal Mghirbi

In a nonlocal game of quantum value one that no finite-dimensional strategy wins, near-perfect play needs growing dimension, which separable states can have. We ask how much usable entanglement it needs: the demand at loss $\varepsilon$ is the least one-way distillable entanglement of the original state of a strategy of loss at most $\varepsilon$. For synchronous games with tested diagonals and for constraint-variable consistency games, demand diverges exactly when no finite-dimensional strategy is perfect; then, for any number of Bell pairs and any fidelity below one, every sufficiently good mixed strategy yields that many at that fidelity by local isometries. For rational synchronous or binary constraint games, a loss guaranteeing this is computable under a promise, but boundedness of demand is undecidable among games of value one. Demand is at least logarithmic if near-winners have a sign relation and an even dilation mirrored by both players, as in a game from Abels' group. For agreement games the directions agree up to a factor three in loss, optimal among Bob-fixed deterministic local symmetrizations. The geometry of the group behind a game, not its presentation, sets the rates. Fixed games demand $\alpha\log(1/\varepsilon)$ for every $\alpha=\frac12\sum_i\log_{m_i}q_i$ with $q_i\ge2$ a power of two dividing $m_i$, a dense set containing all positive rationals and some transcendentals, such as $\frac12\log_62$; a configuration-lamp game demands $\varepsilon^{-1+o(1)}$; Pauli lamps on the points of Houghton's three rays give demand between $\varepsilon^{-0.0690}$ and $\varepsilon^{-1/4}$. If group relations hold exactly and Alice matches Bob to error $e$, demand counts qubits addressable by short words: $\Theta(1/e)$, $\Theta(e^{-k})$ for integers $k\ge1$, or $2^{\Theta(1/e)}$. Conditional on our attainment and tail bounds, the $I_{3322}$ optimum needs bounded usable entanglement.

•Oct 27, 2026•3 citations

The thermodynamics of deadlines: one law for the work cost of acting in time

Seth Douglas, Nidhal Mghirbi

A quantum channel specifies what happens, but the work cost also depends on when inputs arrive, outputs leave and hardware must return. For every finite schedule in which carriers return with their Hamiltonians and the controller comes back, we prove that the optimal asymptotic work rate is the least record entropy plus transferred energy against the most demanding observer. Landauer erasure, thermodynamic capacity and the costs of real-time channels and processes are this law on different schedules. For each positive limit-computable ($\Delta^0_2$) real $\alpha$, a fixed finite nonlocal game has bounded joint-reset work and local-reset work $2\alpha\log_2(1/\varepsilon)+o(\log(1/\varepsilon))$ in units of $k_BT\ln2$, with hardware allowed to grow as precision improves. The precision-reset bounds are proved directly under a separate contract. Thus a reset deadline can force an uncomputable logarithmic cost coefficient, related to Kolchinsky and Wolpert's noncomputable Turing-machine heat functions. We prove the reset sandwich, the quantum/classical recovery tradeoff, a paired heat gap, the four-unit magic-square floor, and exact sector-allocation and access-obstruction results, using explicitly cited game-demand inputs. Early release adds no cost for classical memoryless channels, but has a quantum surcharge; tasks with memory have a fiber-count price. A returned clock has a single-letter batch cost and a separate size requirement. Freeness is decidable in batch and undecidable in real time, already in fixed dimension. Proofs, finite checks and a two-qubit work certificate connect these results to a proposed three-arm experiment. Lean certifies the schedule law for finite-dilation targets, including its physical compiler. The costs survive arbitrarily slow operation: the order of access and reset sets the price. Schedule-law and precision-reset arguments, with explicitly cited smoothing, closure and game-demand inputs, Python checks, older finite formal lemmas, and a selected Lean certificate of the schedule law for finite-dilation targets, including its physical compiler. The certificate excludes the complete channel, clock, fiber and heat/reset theorems outside its selected graph. This paper incorporates The heat price of precision (10.5281/zenodo.23701732). Concept DOI of this paper: 10.5281/zenodo.23719179. See the manuscript for the separate operating contracts and verification scope.

•Oct 28, 2026•0 citations

The price of time order

Seth Douglas, Nidhal Mghirbi

A physical device acts in time: inputs arrive, outputs are released and can no longer be touched, some systems are kept, and some must come back. This paper shows that the optimal work rate of such a device, over many uses at vanishing error, is fixed by one quantity, the least entropy that one implementation must add to its own record, plus the energy it hands over to the carriers, against the most demanding observer its schedule allows. One law for every schedule in which each borrowed system comes back with the Hamiltonian it arrived with: Landauer's bound, the thermodynamic capacity of time-covariant channels, the real-time cost of channels, interactive processes and the batch cost of a channel whose clock must be returned are special cases. Order, not speed. The cost survives arbitrarily slow operation; an operation can cost more merely because some of its outputs must leave sooner. Which carriers to hold. For linear tasks the price of a schedule is a rank, and deciding whether holding a given number of carriers lowers it at all is NP-complete. A witness. A two-qubit process that is free when held costs every early-release device at least 0.87 kT ln 2 per episode at 1% error, when the energy and entropy budgets of its controller and battery total at most 0.025 (energies in kT ln 2, entropies in bits); the error that enters is fixed by three Pauli measurements on one probe. A classical version needs no coherence. Beyond thermodynamics. Order has a price in entanglement and coherence theory too, with no single exchange rate between theories. Holding is decidable, releasing is not. In thermodynamics, whether a channel is free is decidable when outputs may be held and undecidable when they must be released; in the other theories examined, both are decidable. All rates here are optimal asymptotic work rates at vanishing error over the complete interaction, with hardware allowed to grow; where a controller comes back only approximately, its actual mean energy and entropy are also refunded up to sublinear changes. This record archives the manuscript, its TeX source and its machine checks (Python, and Lean with Mathlib). The manuscript is the authority for exact statements and hypotheses; the verification notes list what is checked by machine and what is proved only in the text. How the work was done, including the use of AI models, is described in the manuscript. This paper is one of four on the thermodynamics of time order: Only quantum channels save work by waiting (https://github.com/Apsiape/save-work-by-waiting); The work cost of answering in real time (https://github.com/Apsiape/answering-in-real-time); The price of keeping time (https://github.com/Apsiape/price-of-keeping-time). Scoped licenses: the manuscript, PDF and TeX source are licensed under Creative Commons Attribution 4.0 International (CC-BY-4.0). The software and machine-readable verification artifacts are additionally available under the MIT License. See RIGHTS.md in the archive. The aggregate Other (Open) category represents this mixed-license package.

•Oct 12, 2026•5 citations

Perfect play in a finite nonlocal game requires infinite entanglement entropy

Seth Douglas, Nidhal Mghirbi

How much infinity can a finite nonlocal game require? We construct a finite two-player game with classical questions, classical answers and a Boolean winning rule. It has a perfect strategy on a tensor product of separable Hilbert spaces. Every perfect normal spatial strategy contains, under local isometries, the same pure entangled state with infinite entropy. For mixed strategies, both marginal entropies are infinite and the pure state remains a tensor factor. Thus infinite dimension can be strengthened to infinite entropy without losing spatial attainment. The proof constructs a rational Bell functional whose perfect strategies contain a state with Catalan Schmidt multiplicities, and compiles it into Boolean tests. For either construction, the minimum marginal entropy at loss $\varepsilon$ is $\Theta(\log(1/\varepsilon))$. The lower bound holds for every normal spatial strategy, including mixed states and POVMs. It follows from polynomial decoding on the actual state and a finite-strip entropy estimate. Height and size cutoffs give the matching upper order. The sharp leading constant remains open.

•Nov 2, 2026•5 citations

The price of unreachable perfection: dimension laws at every regular scale

Seth Douglas, Nidhal Mghirbi

How expensive is an optimum that a finite quantum system can approach but never attain? For a fixed finite rational nonlocal game of quantum value one, write A_G(n)=log2 D_G(2^(−n)), where D_G is the least local dimension at loss 2^(−n). We prescribe log2 A_G(n) at every logarithmic-space, nondecreasing unit-increment scale F with F(n)/log n → ∞, up to an additive O(log n+log²(F(n)+2)) error, and match the one-way distillable entanglement of the original mixed strategy state. At every asymptotically flat such scale, the positive finite lower and upper normalized dimension endpoints are exactly the ordered pairs with lower endpoint in Σ⁰₂ and upper endpoint in Π⁰₂; existing positive limits are exactly Δ⁰₂. A single uniform spectral-tail construction supplies the density-free profile law behind these results. It also classifies stretched-scale pairs in the unit square and gives quasi-polynomial dimension windows of width three in the exponent. A computable unit-increment target outside every rational game's profile shows that computability alone is insufficient. We locate the boundaries through a quantitative locality cap, an honest-linear compression cap, and an explicitly conditional route to finite exponents above one. A separate exact-marginal correlation theorem identifies a Farey law and its Diophantine endpoint curve. The dimension arithmetic necessity applies to all rational games; the operational realization statements concern the constructed games.

•Oct 29, 2026•1 citation

An explicit nonlocal game of quantum value one that needs exponential entanglement

Nidhal Mghirbi, Seth Douglas

How much entanglement does near-optimal play of a two-player nonlocal game require? We give an explicit binary linear system game, with $1687$ equations in $1993$ variables and at most three variables in each equation, whose quantum value is one, and in which every strategy that wins with probability $1-\varepsilon$ needs entanglement entropy $\varepsilon^{-1+o(1)}$, hence local dimension $\exp(\varepsilon^{-1+o(1)})$. The same bound holds for the entanglement of formation of mixed strategies, and a strategy on a maximally entangled state of local dimension $\exp(C\varepsilon^{-1}\log(1/\varepsilon))$ suffices, so the exponent is sharp. For explicit two-player games of quantum value one, the best previous lower bound was polynomial in $1/\varepsilon$. The game comes from a finitely generated, elementary amenable group: a lamplighter whose lamps are Pauli pairs indexed by finite sets of points on the three rays on which Houghton's group acts. Exponentially many of these pairs share one central involution, yet the relation that any two of them commute can be derived from a fixed finite set of relations in a number of steps only quasi-polynomial in the number of points. Two tools may be of independent use. The first counts qubits from approximate Pauli relations measured in an arbitrary state, with the errors of different pairs adding in squares. The second identifies, in both directions and at the natural precision $\sqrt\varepsilon$, the near-optimal strategies of a linear system game with approximate representations of its solution group measured in the players' actual state, so that no power of $\varepsilon$ is lost by passing to a flat state. The same tools give sharp rates for two earlier examples: the CHSH$(n)$ games need $\Theta(\min(n,1/\varepsilon))$ ebits, and the linear system game of Slofstra and Vidick needs local dimension $\Theta(\varepsilon^{-1/2})$.

•Oct 27, 2026•2 citations
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.
In a nonlocal game of quantum value one that no finite-dimensional strategy wins, near-perfect play needs growing dimension, which separable states can have. We ask how much usable entanglement it needs: the demand at loss ε\varepsilonε is the least one-way distillable entanglement of the original state of a strategy of loss at most ε\varepsilonε. For synchronous games with tested diagonals and for constraint-variable consistency games, demand diverges exactly when no finite-dimensional strategy is perfect; then, for any number of Bell pairs and any fidelity below one, every sufficiently good mixed strategy yields that many at that fidelity by local isometries. For rational synchronous or binary constraint games, a loss guaranteeing this is computable under a promise, but boundedness of demand is undecidable among games of value one. Demand is at least logarithmic if near-winners have a sign relation and an even dilation mirrored by both players, as in a game from Abels' group. For agreement games the directions agree up to a factor three in loss, optimal among Bob-fixed deterministic local symmetrizations. The geometry of the group behind a game, not its presentation, sets the rates. Fixed games demand αlog⁡(1/ε)\alpha\log(1/\varepsilon)αlog(1/ε) for every α=12∑ilog⁡miqi\alpha=\frac12\sum_i\log_{m_i}q_iα=21​∑i​logmi​​qi​ with qi≥2q_i\ge2qi​≥2 a power of two dividing mim_imi​, a dense set containing all positive rationals and some transcendentals, such as 12log⁡62\frac12\log_6221​log6​2; a configuration-lamp game demands ε−1+o(1)\varepsilon^{-1+o(1)}ε−1+o(1); Pauli lamps on the points of Houghton's three rays give demand between ε−0.0690\varepsilon^{-0.0690}ε−0.0690 and ε−1/4\varepsilon^{-1/4}ε−1/4. If group relations hold exactly and Alice matches Bob to error eee, demand counts qubits addressable by short words: Θ(1/e)\Theta(1/e)Θ(1/e), Θ(e−k)\Theta(e^{-k})Θ(e−k) for integers k≥1k\ge1k≥1, or 2Θ(1/e)2^{\Theta(1/e)}2Θ(1/e). Conditional on our attainment and tail bounds, the I3322I_{3322}I3322​ optimum needs bounded usable entanglement.
A quantum channel specifies what happens, but the work cost also depends on when inputs arrive, outputs leave and hardware must return. For every finite schedule in which carriers return with their Hamiltonians and the controller comes back, we prove that the optimal asymptotic work rate is the least record entropy plus transferred energy against the most demanding observer. Landauer erasure, thermodynamic capacity and the costs of real-time channels and processes are this law on different schedules. For each positive limit-computable (Δ20\Delta^0_2Δ20​) real α\alphaα, a fixed finite nonlocal game has bounded joint-reset work and local-reset work 2αlog⁡2(1/ε)+o(log⁡(1/ε))2\alpha\log_2(1/\varepsilon)+o(\log(1/\varepsilon))2αlog2​(1/ε)+o(log(1/ε)) in units of kBTln⁡2k_BT\ln2kB​Tln2, with hardware allowed to grow as precision improves. The precision-reset bounds are proved directly under a separate contract. Thus a reset deadline can force an uncomputable logarithmic cost coefficient, related to Kolchinsky and Wolpert's noncomputable Turing-machine heat functions. We prove the reset sandwich, the quantum/classical recovery tradeoff, a paired heat gap, the four-unit magic-square floor, and exact sector-allocation and access-obstruction results, using explicitly cited game-demand inputs. Early release adds no cost for classical memoryless channels, but has a quantum surcharge; tasks with memory have a fiber-count price. A returned clock has a single-letter batch cost and a separate size requirement. Freeness is decidable in batch and undecidable in real time, already in fixed dimension. Proofs, finite checks and a two-qubit work certificate connect these results to a proposed three-arm experiment. Lean certifies the schedule law for finite-dilation targets, including its physical compiler. The costs survive arbitrarily slow operation: the order of access and reset sets the price. Schedule-law and precision-reset arguments, with explicitly cited smoothing, closure and game-demand inputs, Python checks, older finite formal lemmas, and a selected Lean certificate of the schedule law for finite-dilation targets, including its physical compiler. The certificate excludes the complete channel, clock, fiber and heat/reset theorems outside its selected graph. This paper incorporates The heat price of precision (10.5281/zenodo.23701732). Concept DOI of this paper: 10.5281/zenodo.23719179. See the manuscript for the separate operating contracts and verification scope.
A physical device acts in time: inputs arrive, outputs are released and can no longer be touched, some systems are kept, and some must come back. This paper shows that the optimal work rate of such a device, over many uses at vanishing error, is fixed by one quantity, the least entropy that one implementation must add to its own record, plus the energy it hands over to the carriers, against the most demanding observer its schedule allows. One law for every schedule in which each borrowed system comes back with the Hamiltonian it arrived with: Landauer's bound, the thermodynamic capacity of time-covariant channels, the real-time cost of channels, interactive processes and the batch cost of a channel whose clock must be returned are special cases. Order, not speed. The cost survives arbitrarily slow operation; an operation can cost more merely because some of its outputs must leave sooner. Which carriers to hold. For linear tasks the price of a schedule is a rank, and deciding whether holding a given number of carriers lowers it at all is NP-complete. A witness. A two-qubit process that is free when held costs every early-release device at least 0.87 kT ln 2 per episode at 1% error, when the energy and entropy budgets of its controller and battery total at most 0.025 (energies in kT ln 2, entropies in bits); the error that enters is fixed by three Pauli measurements on one probe. A classical version needs no coherence. Beyond thermodynamics. Order has a price in entanglement and coherence theory too, with no single exchange rate between theories. Holding is decidable, releasing is not. In thermodynamics, whether a channel is free is decidable when outputs may be held and undecidable when they must be released; in the other theories examined, both are decidable. All rates here are optimal asymptotic work rates at vanishing error over the complete interaction, with hardware allowed to grow; where a controller comes back only approximately, its actual mean energy and entropy are also refunded up to sublinear changes. This record archives the manuscript, its TeX source and its machine checks (Python, and Lean with Mathlib). The manuscript is the authority for exact statements and hypotheses; the verification notes list what is checked by machine and what is proved only in the text. How the work was done, including the use of AI models, is described in the manuscript. This paper is one of four on the thermodynamics of time order: Only quantum channels save work by waiting (https://github.com/Apsiape/save-work-by-waiting); The work cost of answering in real time (https://github.com/Apsiape/answering-in-real-time); The price of keeping time (https://github.com/Apsiape/price-of-keeping-time). Scoped licenses: the manuscript, PDF and TeX source are licensed under Creative Commons Attribution 4.0 International (CC-BY-4.0). The software and machine-readable verification artifacts are additionally available under the MIT License. See RIGHTS.md in the archive. The aggregate Other (Open) category represents this mixed-license package.
How much infinity can a finite nonlocal game require? We construct a finite two-player game with classical questions, classical answers and a Boolean winning rule. It has a perfect strategy on a tensor product of separable Hilbert spaces. Every perfect normal spatial strategy contains, under local isometries, the same pure entangled state with infinite entropy. For mixed strategies, both marginal entropies are infinite and the pure state remains a tensor factor. Thus infinite dimension can be strengthened to infinite entropy without losing spatial attainment. The proof constructs a rational Bell functional whose perfect strategies contain a state with Catalan Schmidt multiplicities, and compiles it into Boolean tests. For either construction, the minimum marginal entropy at loss ε\varepsilonε is Θ(log⁡(1/ε))\Theta(\log(1/\varepsilon))Θ(log(1/ε)). The lower bound holds for every normal spatial strategy, including mixed states and POVMs. It follows from polynomial decoding on the actual state and a finite-strip entropy estimate. Height and size cutoffs give the matching upper order. The sharp leading constant remains open.
How expensive is an optimum that a finite quantum system can approach but never attain? For a fixed finite rational nonlocal game of quantum value one, write A_G(n)=log2 D_G(2^(−n)), where D_G is the least local dimension at loss 2^(−n). We prescribe log2 A_G(n) at every logarithmic-space, nondecreasing unit-increment scale F with F(n)/log n → ∞, up to an additive O(log n+log²(F(n)+2)) error, and match the one-way distillable entanglement of the original mixed strategy state. At every asymptotically flat such scale, the positive finite lower and upper normalized dimension endpoints are exactly the ordered pairs with lower endpoint in Σ⁰₂ and upper endpoint in Π⁰₂; existing positive limits are exactly Δ⁰₂. A single uniform spectral-tail construction supplies the density-free profile law behind these results. It also classifies stretched-scale pairs in the unit square and gives quasi-polynomial dimension windows of width three in the exponent. A computable unit-increment target outside every rational game's profile shows that computability alone is insufficient. We locate the boundaries through a quantitative locality cap, an honest-linear compression cap, and an explicitly conditional route to finite exponents above one. A separate exact-marginal correlation theorem identifies a Farey law and its Diophantine endpoint curve. The dimension arithmetic necessity applies to all rational games; the operational realization statements concern the constructed games.
How much entanglement does near-optimal play of a two-player nonlocal game require? We give an explicit binary linear system game, with 168716871687 equations in 199319931993 variables and at most three variables in each equation, whose quantum value is one, and in which every strategy that wins with probability 1−ε1-\varepsilon1−ε needs entanglement entropy ε−1+o(1)\varepsilon^{-1+o(1)}ε−1+o(1), hence local dimension exp⁡(ε−1+o(1))\exp(\varepsilon^{-1+o(1)})exp(ε−1+o(1)). The same bound holds for the entanglement of formation of mixed strategies, and a strategy on a maximally entangled state of local dimension exp⁡(Cε−1log⁡(1/ε))\exp(C\varepsilon^{-1}\log(1/\varepsilon))exp(Cε−1log(1/ε)) suffices, so the exponent is sharp. For explicit two-player games of quantum value one, the best previous lower bound was polynomial in 1/ε1/\varepsilon1/ε. The game comes from a finitely generated, elementary amenable group: a lamplighter whose lamps are Pauli pairs indexed by finite sets of points on the three rays on which Houghton's group acts. Exponentially many of these pairs share one central involution, yet the relation that any two of them commute can be derived from a fixed finite set of relations in a number of steps only quasi-polynomial in the number of points. Two tools may be of independent use. The first counts qubits from approximate Pauli relations measured in an arbitrary state, with the errors of different pairs adding in squares. The second identifies, in both directions and at the natural precision ε\sqrt\varepsilonε​, the near-optimal strategies of a linear system game with approximate representations of its solution group measured in the players' actual state, so that no power of ε\varepsilonε is lost by passing to a flat state. The same tools give sharp rates for two earlier examples: the CHSH(n)(n)(n) games need Θ(min⁡(n,1/ε))\Theta(\min(n,1/\varepsilon))Θ(min(n,1/ε)) ebits, and the linear system game of Slofstra and Vidick needs local dimension Θ(ε−1/2)\Theta(\varepsilon^{-1/2})Θ(ε−1/2).