Papers › Balls and Walls: A Compact Unary Coding for Bosonic States
Balls and Walls: A Compact Unary Coding for Bosonic States
Hatem Barghathi, Caleb Usadi, Micah Beck, Adrian Del Maestro
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We introduce a unary coding of bosonic occupation states based on the famous "balls and walls" counting for the number of configurations of N indistinguishable particles on L distinguishable sites. Each state is represented by an integer with a human readable bit string that has a compositional structure allowing for the efficient application of operators that locally modify the number of bosons. By exploiting translational and inversion symmetries, we identify a speedup factor of order L over current methods when generating the basis states of bosonic lattice models. The unary coding is applied to a one-dimensional Bose-Hubbard Hamiltonian with up to L=N=20, and the time needed to generate the ground state block is reduced to a fraction of the diagonalization time. For the ground state symmetry resolved entanglement, we demonstrate that variational approaches restricting the local bosonic Hilbert space could result in an error that scales with system size.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections