Improved entanglement entropy estimates from filtered bitstring probabilities
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915447042998272 |
|---|---|
| author | Kaufman, Avi Corona, James Ozzello, Zane Senseman, Blake Asaduzzaman, Muhammad Meurice, Yannick |
| author_facet | Kaufman, Avi Corona, James Ozzello, Zane Senseman, Blake Asaduzzaman, Muhammad Meurice, Yannick |
| contents | Using the bitstring probabilities of ground states of bipartitioned ladders of Rydberg atoms, we calculate the mutual information, which is a lower bound on the corresponding bipartite von Neumann quantum entanglement entropy $S^{vN}_A$. We show that in many cases these lower bounds can be improved by removing the bitstrings with a probability lower than some value $p_{min}$ and renormalizing the remaining probabilities (filtering). We propose a heuristic based on the change of the conditional entropy under filtering that very effectively improves the estimate of $S^{vN}_A$. We consider various sizes, lattice spacings and bipartitions. Our numerical investigation suggest that the filtered mutual information obtained with samples having just a few thousand bitstrings can provide reasonably close estimates of $S^{vN}_A$. We briefly discuss practical implementations with QuEra's Aquila device. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_07092 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Improved entanglement entropy estimates from filtered bitstring probabilities Kaufman, Avi Corona, James Ozzello, Zane Senseman, Blake Asaduzzaman, Muhammad Meurice, Yannick Quantum Physics High Energy Physics - Lattice High Energy Physics - Theory Using the bitstring probabilities of ground states of bipartitioned ladders of Rydberg atoms, we calculate the mutual information, which is a lower bound on the corresponding bipartite von Neumann quantum entanglement entropy $S^{vN}_A$. We show that in many cases these lower bounds can be improved by removing the bitstrings with a probability lower than some value $p_{min}$ and renormalizing the remaining probabilities (filtering). We propose a heuristic based on the change of the conditional entropy under filtering that very effectively improves the estimate of $S^{vN}_A$. We consider various sizes, lattice spacings and bipartitions. Our numerical investigation suggest that the filtered mutual information obtained with samples having just a few thousand bitstrings can provide reasonably close estimates of $S^{vN}_A$. We briefly discuss practical implementations with QuEra's Aquila device. |
| title | Improved entanglement entropy estimates from filtered bitstring probabilities |
| topic | Quantum Physics High Energy Physics - Lattice High Energy Physics - Theory |
| url | https://arxiv.org/abs/2411.07092 |