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

Sharp embezzlement laws for quantum chains and finite Bell tests

Seth Douglas, Nidhal Mghirbi

Published Nov 11, 2026• 0 citations
Publisher

Abstract

For the finite open critical XX and Ising chains, we prove a sharp entanglement-embezzlement law from their exact discrete Schmidt spectra, including all degeneracies. For a maximally entangled target of fixed dimension d, the optimal squared local-unitary error is E_d = (ln d)^2/(4S) + O_d(S^-2), where S is the half-chain entanglement entropy. A counting criterion gives a Gaussian crossover for growing d and the same sharp law for the XXZ corner-transfer-matrix spectrum as Δ decreases to 1. We compare the optimal loss in a fixed Bell game with 243 question pairs to the Bell-pair embezzlement error with explicit constants, and prove the loss floor (3−2√2)/243 for maximally entangled states of every dimension. With a shared nine-dimensional maximally entangled register, the open XX ground state at N = 2^19 beats this floor in the original game. At N = 2^84 the chain alone suffices. A tagged test gives an exact tilted CHSH separation for the four-spin XX ground state, with classical play in the original game branch. For the infinite critical XX ground state, the half-chain factors are type III_1 and the game value is one without attainment.

DOI
10.5281/zenodo.24146764

Related papers

The right entanglement for perfect nonlocality and zero-error communication

Laura Mančinska

We identify a structural mechanism by which perfect play in a nonlocal game requires and self-tests a specific non-maximally entangled state. To this end, we construct a Flagged Magic-Square game by extending the standard Magic-Square game with an additional ``flag'' outcome and two additional questions for each player. The game admits a perfect strategy using a state with Schmidt coefficients proportional to $(1,\sqrt{2},\sqrt{2},\sqrt{2},\sqrt{2})$. We give a direct algebraic proof that maximally entangled strategies have winning probability bounded away from one, independently of dimension. Moreover, the game self-tests this state, providing an example of a two-party pseudo-telepathy game that certifies a specific non-maximally entangled state. Our construction illustrates how adding suitable constraints to a rigid measurement geometry can enforce specific Schmidt ratios and provides a modular route to further self-tests based on other rigid pseudo-telepathy games. We establish a general game-to-channel reduction that transfers separations in the game model to one-shot zero-error communication over classical channels. Applied to the Flagged Magic-Square game, it yields a classical channel for which entanglement permits the zero-error transmission of ten messages in a single use, whereas any finite-dimensional maximally entangled resource permits at most nine. Thus, maximally entangled states are not a universally optimal entanglement resource for zero-error communication over classical noisy channels.

quant-pharXiv:2610.06512•Oct 6, 2026•1 citation

Embezzling entanglement from a de Sitter observer: sharp entropy-deficit bounds on finite von Neumann algebras

Dylan Z. Liu Liu

The type III₁ algebras of quantum field theory are universal embezzlers of entanglement, while semifinite algebras admit no embezzling state. The algebra of a de Sitter static patch with an observer is of type II₁, so gravity excludes exact embezzlement there; we determine how small the error can be. For a state ω on a finite factor and a target pure state ψ with entanglement entropy S(ψ), the smallest one-sided embezzlement error obeys δ ≥ S(ψ)/[D+ln 2D+O(1)], where D is the relative entropy of ω to the tracial state. If the density of ω is bounded by e^(Λ), then δ ≥ 2S(ψ)/[Λ+ln Λ+O(1)]. Both bounds are attained to this order, the first by an observer with uniformly distributed energy and the second by the van Dam–Hayden states. In the observer algebra of Chandrasekaran, Longo, Penington and Witten, D is the deficit of generalized entropy below that of empty de Sitter space. An observer whose energy distribution is not sharper than the de Sitter temperature T_dS therefore needs mean energy ⟨E⟩ ≳ T_dS S(ψ)/δ. If the generalized entropy is nonnegative, every state has δ ≥ S(ψ)/S_dS up to logarithmic corrections, an error of first order in Newton's constant.

•Sep 28, 2023•0 citations

Entanglement Embezzlement from Diffusive Hydrodynamics

Shi-Xin Zhang, Shuo Liu, Yu-Qin Chen

Entanglement embezzlement asks how much entanglement can be borrowed from a many-body state by local operations and classical communication while returning that state with a small error. We uncover a conservation-law mechanism that redistributes the dominant probability mass of the Schmidt spectrum in the logarithmic Schmidt-rank coordinate and thereby controls this operational resource. For typical random pure states at fixed U(1) charge, we prove a finite-error conversion law: away from half filling, the charge bias converts $O(\sqrt L)$ charge fluctuations into $O(\sqrt L)$ borrowable entanglement, whereas particle--hole symmetry at half filling removes this contribution entirely. We then show how the resource develops dynamically in charge-conserving random circuits. Combining hydrodynamic analysis with large-scale replica tensor-network calculations, we find that diffusion broadens the operationally relevant distribution in the logarithmic Schmidt-rank coordinate on the scale $t^{1/4}$ and increases the amount of entanglement that can be borrowed. Charge transport therefore continues to reorganize the entanglement spectrum and activate embezzlement after the leading volume-law entropy has saturated.

quant-pharXiv:2609.26362•Sep 23, 2026•1 citation

A commuting operator self-test for exact entanglement embezzlement

Connor Paddock, Simon Schmidt

We show that the optimal commuting operator correlation for a variant of Coladangelo's two-player generalized nonlocal game, based on the embezzlement of entanglement, is a commuting operator self-test. Our result gives the first correlation self-test for an exact entanglement embezzlement protocol in the commuting operator framework. Because the unique optimal correlation necessitates the exact embezzlement of entanglement, the correlation is unrealizable using quantum tensor-product models, even if the local spaces are allowed to be infinite dimensional. As such, our result provides an example of a commuting operator self-test where the Hilbert space shared by the two parties cannot be factored into a tensor-product of local spaces that is compatible with the local measurement operators. Our main proof technique relies on Harris' unique abstract state characterization of exact embezzlement of entanglement involving Cuntz algebras.

quant-pharXiv:2609.38083•Sep 30, 2026•1 citation

Self-testing of exact entanglement embezzlement

Samuel J. Harris

We consider bipartite exact entanglement embezzlement with a catalyst state vector $ψ$ in a Hilbert space $\mathcal{H}$ using unitaries (or more generally, contractions). If $\mathcal{M} \subseteq \mathcal{B}(\mathcal{H})$ is a von Neumann algebra and $U \in M_d \otimes \mathcal{M}$ and $V \in \mathcal{M}' \otimes M_d$ are unitaries (or more generally contractions), then such a protocol is of the form $(U \otimes I_d)(I_d \otimes V)(e_0 \otimes ψ\otimes e_0)=\sum_{i=0}^{d-1} α_i e_i \otimes ψ\otimes e_i$, where each $α_i>0$ and $\sum_{i=0}^{d-1} α_i^2=1$. We show that any such protocol must arise from a unique state on the tensor product $\mathcal{O}_d \otimes \mathcal{O}_d$ of the Cuntz algebra with itself. As a result, we prove that exact entanglement embezzlement is a self-test for a collection of $d$ Cuntz isometries for each party and a unique quasi-free state on the Cuntz algebra $\mathcal{O}_d$ in the sense of \cite{Iz93}. Moreover, we use modular theory to show that the von Neumann algebra generated by the copy of $\mathcal{O}_d$ is the unique separable approximately finite-dimensional Type $\text{III}_λ$ factor for some $0<λ\leq 1$, where $λ$ can be determined by an algebraic condition on the Schmidt coefficients of the state $\varphi=\sum_{i=0}^{d-1} α_i e_i \otimes e_i$.

math.OACross-listedarXiv:2605.22713•May 22, 2026•1 citation

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
For the finite open critical XX and Ising chains, we prove a sharp entanglement-embezzlement law from their exact discrete Schmidt spectra, including all degeneracies. For a maximally entangled target of fixed dimension d, the optimal squared local-unitary error is E_d = (ln d)^2/(4S) + O_d(S^-2), where S is the half-chain entanglement entropy. A counting criterion gives a Gaussian crossover for growing d and the same sharp law for the XXZ corner-transfer-matrix spectrum as Δ decreases to 1. We compare the optimal loss in a fixed Bell game with 243 question pairs to the Bell-pair embezzlement error with explicit constants, and prove the loss floor (3−2√2)/243 for maximally entangled states of every dimension. With a shared nine-dimensional maximally entangled register, the open XX ground state at N = 2^19 beats this floor in the original game. At N = 2^84 the chain alone suffices. A tagged test gives an exact tilted CHSH separation for the four-spin XX ground state, with classical play in the original game branch. For the infinite critical XX ground state, the half-chain factors are type III_1 and the game value is one without attainment.
We identify a structural mechanism by which perfect play in a nonlocal game requires and self-tests a specific non-maximally entangled state. To this end, we construct a Flagged Magic-Square game by extending the standard Magic-Square game with an additional ``flag'' outcome and two additional questions for each player. The game admits a perfect strategy using a state with Schmidt coefficients proportional to (1,2,2,2,2)(1,\sqrt{2},\sqrt{2},\sqrt{2},\sqrt{2})(1,2​,2​,2​,2​). We give a direct algebraic proof that maximally entangled strategies have winning probability bounded away from one, independently of dimension. Moreover, the game self-tests this state, providing an example of a two-party pseudo-telepathy game that certifies a specific non-maximally entangled state. Our construction illustrates how adding suitable constraints to a rigid measurement geometry can enforce specific Schmidt ratios and provides a modular route to further self-tests based on other rigid pseudo-telepathy games. We establish a general game-to-channel reduction that transfers separations in the game model to one-shot zero-error communication over classical channels. Applied to the Flagged Magic-Square game, it yields a classical channel for which entanglement permits the zero-error transmission of ten messages in a single use, whereas any finite-dimensional maximally entangled resource permits at most nine. Thus, maximally entangled states are not a universally optimal entanglement resource for zero-error communication over classical noisy channels.
The type III₁ algebras of quantum field theory are universal embezzlers of entanglement, while semifinite algebras admit no embezzling state. The algebra of a de Sitter static patch with an observer is of type II₁, so gravity excludes exact embezzlement there; we determine how small the error can be. For a state ω on a finite factor and a target pure state ψ with entanglement entropy S(ψ), the smallest one-sided embezzlement error obeys δ ≥ S(ψ)/[D+ln 2D+O(1)], where D is the relative entropy of ω to the tracial state. If the density of ω is bounded by e^(Λ), then δ ≥ 2S(ψ)/[Λ+ln Λ+O(1)]. Both bounds are attained to this order, the first by an observer with uniformly distributed energy and the second by the van Dam–Hayden states. In the observer algebra of Chandrasekaran, Longo, Penington and Witten, D is the deficit of generalized entropy below that of empty de Sitter space. An observer whose energy distribution is not sharper than the de Sitter temperature T_dS therefore needs mean energy ⟨E⟩ ≳ T_dS S(ψ)/δ. If the generalized entropy is nonnegative, every state has δ ≥ S(ψ)/S_dS up to logarithmic corrections, an error of first order in Newton's constant.
Entanglement embezzlement asks how much entanglement can be borrowed from a many-body state by local operations and classical communication while returning that state with a small error. We uncover a conservation-law mechanism that redistributes the dominant probability mass of the Schmidt spectrum in the logarithmic Schmidt-rank coordinate and thereby controls this operational resource. For typical random pure states at fixed U(1) charge, we prove a finite-error conversion law: away from half filling, the charge bias converts O(L)O(\sqrt L)O(L​) charge fluctuations into O(L)O(\sqrt L)O(L​) borrowable entanglement, whereas particle--hole symmetry at half filling removes this contribution entirely. We then show how the resource develops dynamically in charge-conserving random circuits. Combining hydrodynamic analysis with large-scale replica tensor-network calculations, we find that diffusion broadens the operationally relevant distribution in the logarithmic Schmidt-rank coordinate on the scale t1/4t^{1/4}t1/4 and increases the amount of entanglement that can be borrowed. Charge transport therefore continues to reorganize the entanglement spectrum and activate embezzlement after the leading volume-law entropy has saturated.
We show that the optimal commuting operator correlation for a variant of Coladangelo's two-player generalized nonlocal game, based on the embezzlement of entanglement, is a commuting operator self-test. Our result gives the first correlation self-test for an exact entanglement embezzlement protocol in the commuting operator framework. Because the unique optimal correlation necessitates the exact embezzlement of entanglement, the correlation is unrealizable using quantum tensor-product models, even if the local spaces are allowed to be infinite dimensional. As such, our result provides an example of a commuting operator self-test where the Hilbert space shared by the two parties cannot be factored into a tensor-product of local spaces that is compatible with the local measurement operators. Our main proof technique relies on Harris' unique abstract state characterization of exact embezzlement of entanglement involving Cuntz algebras.
We consider bipartite exact entanglement embezzlement with a catalyst state vector ψψψ in a Hilbert space H\mathcal{H}H using unitaries (or more generally, contractions). If M⊆B(H)\mathcal{M} \subseteq \mathcal{B}(\mathcal{H})M⊆B(H) is a von Neumann algebra and U∈Md⊗MU \in M_d \otimes \mathcal{M}U∈Md​⊗M and V∈M′⊗MdV \in \mathcal{M}' \otimes M_dV∈M′⊗Md​ are unitaries (or more generally contractions), then such a protocol is of the form (U⊗Id)(Id⊗V)(e0⊗ψ⊗e0)=∑i=0d−1αiei⊗ψ⊗ei(U \otimes I_d)(I_d \otimes V)(e_0 \otimes ψ\otimes e_0)=\sum_{i=0}^{d-1} α_i e_i \otimes ψ\otimes e_i(U⊗Id​)(Id​⊗V)(e0​⊗ψ⊗e0​)=∑i=0d−1​αi​ei​⊗ψ⊗ei​, where each αi>0α_i>0αi​>0 and ∑i=0d−1αi2=1\sum_{i=0}^{d-1} α_i^2=1∑i=0d−1​αi2​=1. We show that any such protocol must arise from a unique state on the tensor product Od⊗Od\mathcal{O}_d \otimes \mathcal{O}_dOd​⊗Od​ of the Cuntz algebra with itself. As a result, we prove that exact entanglement embezzlement is a self-test for a collection of ddd Cuntz isometries for each party and a unique quasi-free state on the Cuntz algebra Od\mathcal{O}_dOd​ in the sense of \cite{Iz93}. Moreover, we use modular theory to show that the von Neumann algebra generated by the copy of Od\mathcal{O}_dOd​ is the unique separable approximately finite-dimensional Type IIIλ\text{III}_λIIIλ​ factor for some 0<λ≤10<λ\leq 10<λ≤1, where λλλ can be determined by an algebraic condition on the Schmidt coefficients of the state φ=∑i=0d−1αiei⊗ei\varphi=\sum_{i=0}^{d-1} α_i e_i \otimes e_iφ=∑i=0d−1​αi​ei​⊗ei​.
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.