Amenable groups with nearly exponential sofic profile, and quantum channels that need nearly linear memory
Abstract
How far from finite can an amenable group be? Every finite piece of an amenable group can be imitated by permutations of a finite set, and Cornulier's sofic profile counts how many points such an imitation needs at accuracy 1/r. We build a finitely presented elementary amenable group with a finite piece whose profile is exp(r1+o(1)), close to the most our counting method can ever detect. The construction is a lamplighter with its lamps on configurations rather than on points. Houghton's group moves the points of three rays, finitely supported affine maps act on their binary configurations, and a copy of S3 sits on every configuration. Then N points carry 2N lamps, yet any two lamps can be brought together by moves that each involve at most three points. The group embeds in Brin's group 3V, so 3V too has a finite piece of nearly exponential profile. The group also gives an explicit quantum channel on ℂ873 that is cheap to use once and expensive to use many times. A device that applies it n times, releasing each output before the next input arrives, needs about n/B qubits of memory when it may spend B bits of purity, and exact devices achieve this up to polylogarithmic factors. With exchange at the optimal rate, the least memory is about √n, attained with purity of the same order. The channel is factorizable and lies in the closure of channels with finite maximally mixed baths, yet any such bath that imitates it to accuracy u needs dimension exp(u−1+o(1)), although its minimal Stinespring dilation implements it exactly with a pure environment of dimension $130$. The engine is a one-round theorem: after a single use, the memory of any such device carries an approximate representation of the group.
Related
- An exponential strong converse for private communication over degradable quantum channels
- Unlocking Exponential and Unbounded Robust Gains in Shannon Capacity of Classical Multiple Access Channels with Causal CSIT via Quantum Entanglement Assistance
- Groups with rapid decay and trivial amenable radical are C*-simple
- Selflessness for twisted group C*-algebras of amenable groups and their inclusions
- The universal valued Abelian groups of Niemiec are Lévy, strongly exotic, extremely amenable, and 𝔾r(0) is generically monothetic
BibTeX
@misc{douglas2026amenable,
title = {{Amenable groups with nearly exponential sofic profile, and quantum channels that need nearly linear memory}},
author = {Seth Douglas and Nidhal Mghirbi},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.04271},
eprint = {2610.04271},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.04271},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Amenable groups with nearly exponential sofic profile, and quantum channels that need nearly linear memory
AU - Seth Douglas
AU - Nidhal Mghirbi
PY - 2026
DA - 2026/10/03
PB - arXiv
DO - 10.48550/arxiv.2610.04271
UR - https://arxiv.org/abs/2610.04271
AB - How far from finite can an amenable group be? Every finite piece of an amenable group can be imitated by permutations of a finite set, and Cornulier's sofic profile counts how many points such an imitation needs at accuracy 1/r. We build a finitely presented elementary amenable group with a finite piece whose profile is exp(r^1+o(1)), close to the most our counting method can ever detect. The construction is a lamplighter with its lamps on configurations rather than on points. Houghton's group moves the points of three rays, finitely supported affine maps act on their binary configurations, and a copy of S_3 sits on every configuration. Then N points carry 2^N lamps, yet any two lamps can be brought together by moves that each involve at most three points. The group embeds in Brin's group 3V, so 3V too has a finite piece of nearly exponential profile. The group also gives an explicit quantum channel on ℂ^873 that is cheap to use once and expensive to use many times. A device that applies it n times, releasing each output before the next input arrives, needs about n/B qubits of memory when it may spend B bits of purity, and exact devices achieve this up to polylogarithmic factors. With exchange at the optimal rate, the least memory is about √n, attained with purity of the same order. The channel is factorizable and lies in the closure of channels with finite maximally mixed baths, yet any such bath that imitates it to accuracy u needs dimension exp(u^−1+o(1)), although its minimal Stinespring dilation implements it exactly with a pure environment of dimension $130$. The engine is a one-round theorem: after a single use, the memory of any such device carries an approximate representation of the group.
ER -