Preprint
Finite size scaling of bitstring probability distributions for Rydberg arrays
arXiv
arXiv
07/29/2026
DOI: 10.48550/arxiv.2607.27013
Abstract
We calculate the probabilitiesp_({n})of the measured bitstrings{n}for the vacuum of Rydberg ladders withN_(q)atoms. AsN_(q)increases, thep_({n})decrease but become more dense in the lowpregion raising the possibility that their smallness could be compensated by their large number. The importance of the low probability states can be estimated from the cumulative probability distributionΣ(p_(Λ),N_(q)) , which is the probability to observe any state having a probabilityp≤ p_(Λ) . For not too large values ofp_(Λ) , it is possible to approximately collapse theΣ(p_(Λ),N_(q))for successiveN_(q)into a function resembling the Fermi function when plotted as a function of-\ln{(}{p}{_(Λ)}) . We show that the number of shots necessary to reduceΣ(p_(Λ),N_(q))to some low enough value grows exponentially withN_(q) . We discuss the implications for calculating observables associated with the vacuum.
Details
- Title: Subtitle
- Finite size scaling of bitstring probability distributions for Rydberg arrays
- Creators
- Zane OzzelloAvi KaufmanYannick Meurice
- Resource Type
- Preprint
- Publication Details
- arXiv
- DOI
- 10.48550/arxiv.2607.27013
- ISSN
- 2331-8422
- Publisher
- arXiv
- Language
- English
- Date posted
- 07/29/2026
- Academic Unit
- Physics and Astronomy
- Record Identifier
- 9985214915402771
Metrics
1 Record Views