Logo image
Improved entanglement entropy estimates from filtered bitstring probabilities
Preprint   Open access

Improved entanglement entropy estimates from filtered bitstring probabilities

Avi Kaufman, James Corona, Zane Ozzello, Muhammad Asaduzzaman and Yannick Meurice
ArXiv.org
Cornell University
11/11/2024
DOI: 10.48550/arxiv.2411.07092
url
https://doi.org/10.48550/arxiv.2411.07092View
Preprint (Author's original)This preprint has not been evaluated by subject experts through peer review. Preprints may undergo extensive changes and/or become peer-reviewed journal articles. Open Access

Abstract

The von Neumann entanglement entropy provides important information regarding critical points and continuum limits for analog simulators such as arrays of Rydberg atoms. The easily accessible mutual information associated with the bitstring probabilities of complementary subsets A and B of one-dimensional quantum chains, provide reasonably sharp lower bounds on the corresponding bipartite von Neumann quantum entanglement entropy SvNA. Here, we show that these bounds can in most cases be improved by removing the bitstrings with a probability lower than some value pmin and renormalizing the remaining probabilities (filtering). Surprisingly, in some cases, as we increase pmin the filtered mutual information tends to plateaus at values very close to SvNA over some range of pmin. We discuss the dependence on the size of the system, the lattice spacing, and the bipartition of the system. These observations were found for ladders of Rydberg atoms using numerical methods. We also compare with analog simulations involving Rubidium atoms performed remotely with the Aquila device.
Physics - High Energy Physics - Lattice Physics - High Energy Physics - Theory Physics - Quantum Physics

Details

Metrics

14 Record Views
Logo image