REVIEW 4 cited by
Improved entanglement entropy estimates from filtered bitstring probabilities
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Improved entanglement entropy estimates from filtered bitstring probabilities
read the original abstract
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.
Forward citations
Cited by 4 Pith papers
-
Local Thermalization of SU(2) Lattice Gauge Fields on Quantum Computers
Quantum hardware simulation of SU(2) lattice gauge thermalization matches classical extrapolations up to 101 plaquettes after error mitigation, establishing feasibility for chaotic quantum field systems.
-
Local Thermalization of SU(2) Lattice Gauge Fields on Quantum Computers
Error-mitigated IBM quantum hardware reproduces extrapolated classical simulations of entanglement growth and local thermalization for a truncated SU(2) gauge theory on chains up to 101 plaquettes.
-
Finite size scaling of bitstring probability distributions for Rydberg arrays
Cumulative bitstring probabilities for Rydberg-ladder vacua collapse onto a Fermi-like form in −ln(p), and the shots needed to suppress the low-p tail scale exponentially with system size.
-
Estimating classical mutual information between quantum subsystems with neural networks
Neural networks reconstruct classical mutual information and specific entropy from limited projective measurements in the antiferromagnetic quantum Ising model, enabling reconstruction of the phase diagram even for de...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.