Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2411.07092 · Physical Review A

Improved entanglement entropy estimates from filtered bitstring probabilities

Avi Kaufman, James Corona, Zane Ozzello, Blake Senseman, Muhammad Asaduzzaman, Yannick Meurice

Published Sep 5, 2025• 8 citations
arXivHTMLPDF

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.

DOI
10.1103/lbv3-2z7r

Related papers

Lower bounds on entanglement entropy without twin copy

Yannick Meurice

We discuss the possibility of estimating experimentally the von Neumann entanglement entropy S A v N of a symmetric bipartite quantum system A B by using the basic measurement counts (bitstrings) for a single copy of a prepared state. Using exact diagonalization and analog simulations performed with the publicly available QuEra facilities for chains and ladders of Rydberg atoms, we calculate the Shannon entropy S A B X associated with the bitstrings of adiabatically prepared ground states and the reduced entropies S A X and S B X obtained from the marginal probabilities in A and B . We then calculate the classical mutual information I A B X = S A X + S B X − S A B X , which is a lower bound on S A v N . We show that for a broad range of lattice spacing and detuning, I A B X is typically 20% below S A v N in regions where S A v N is large and a less close bound in regions where S A v N is low. We argue that this use of the easily available bitstrings provides a robust and efficient way to explore empirically the phase diagram of qubit-based quantum simulators and identify critical regions.

arXiv:2404.09935•Physical Review Research•Apr 24, 2025•10 citations

Multipartite entanglement for d -level systems in 1 + 1 D

Zane Ozzello, Yannick Meurice

We show that multipartite entanglement can be used as an efficient way of identifying the critical points of 1+1D systems. We demonstrate this with the quantum Ising model, lattice $λϕ^4$ approximated with qutrits, and arrays of Rydberg atoms. To do so we make use of multipartite compositions of entanglement quantities for different parts combined to form the strong subadditivity, weak monotonicity, and a convex combination of these with conformal properties. These quantities display some remarkable properties. We will demonstrate how the entanglement of individual parts together displays behavior at phase boundaries, but the combination of these in the aforementioned quantities sharpens and localizes this behavior to the boundaries even better. We will show that we can extend a scheme for approximating the entanglement with the mutual information, and that this acts as a lower bound which will also follow the changes in the entanglement for the above quantities, despite the additional contributions of different signs. This mutual information approximation to the identifying quantities can have its lower probabilities removed in a process we call filtering, and despite the combination of terms will respond well to the filtering and offer improvements to the lower bound.

arXiv:2507.14422•Physical review. D/Physical review. D.•Feb 25, 2026•3 citations

An interpretable closed form for entanglement entropy from bitstrings, guided by a graph neural network

Anas Saleh

The empirical bitstring distribution is the most accessible observable on Rydberg-atom arrays, but the bipartite von~Neumann entropy it constrains is far costlier to obtain. We present a six-term linear closed form for the entropy, built on bitstring-derivable physics scalars, and characterize its accuracy, portability, scaling behaviour, and calibration cost. The feature set is selected with guidance from a trained graph neural network: probing the network localizes its entropy prediction to the two-point correlators on the bipartition boundary, and an exhaustive ground-truth search restricted to those boundary correlators isolates the form. It reaches $0.024$~nats mean absolute error in distribution: $6.4$ times the network's error, but in a form a human can read and apply without retraining. Fit once and applied unchanged, it has lower error than the base network on five of six out-of-distribution pools and ties the sixth. An independent density-matrix renormalization-group study to one hundred atoms -- five times the reach of exact diagonalization -- settles the size-extrapolation question: coefficients frozen at small size fail at scale, but the failure is structured. Refit per size the form holds to $25$--$50$~mnat (cross-validated); two of its six slopes follow clean inverse-size laws, one a downward curving growth, and the others are trendless; the fitted laws deploy the form label-free at roughly $40$--$80$~mnat. The result fixes a label-budget rule: at large sizes, a few dozen labels recalibrate the closed form to match a fine-tuned in-distribution ensemble on the same features, while nonlinear ML models pull ahead only given large labelled datasets.

quant-pharXiv:2606.22713•Jun 23, 2026•0 citations

Estimation of the Reduced Density Matrix and Entanglement Entropies Using Autoregressive Networks

P. Białas, Piotr Korcyl, Tomasz Stebel +1 more

Matrix elements of the density matrix of small quantum systems have recently become experimentally accessible within the cold atoms simulations. Numerical estimation of these quantities is known to be computationally challenging. Tracing out a part of the studied system and hence accessing the reduced density matrices offers similar difficulties, but it is more interesting, as the reduced density matrix is the basis of entanglement entropy measures. In this work, we present a method of estimating the individual elements of the reduced density matrices that uses autoregressive neural networks and the path integral quantization approach. We use a hierarchy of neural networks capable of estimating conditional probabilities of consecutive spins to evaluate elements of reduced density matrices directly. Using the Ising chain as an example, we calculate the continuum limit of the ground state’s von Neumann and Rényi bipartite entanglement entropies of an interval built of up to 5 spins. We demonstrate that our architecture is able to estimate all the needed matrix elements with just a single training for a fixed temperature discretization and lattice volume. Our method can be applied to other types of spin chains, possibly with defects, as well as to estimating entanglement entropies of thermal states at non-zero temperature. Hence, it may offer an attractive computational approach as a counterpart to the experimental effort. Abstract Published by the Jagiellonian University 2025 authors

arXiv:2506.04170•Acta Physica Polonica B•Dec 4, 2025•3 citations

Sample-efficient estimation of entanglement entropy through supervised learning

Maximilian Rieger, Moritz Reh, Martin Gärttner

We explore a supervised machine-learning approach to estimate the entanglement entropy of multiqubit systems from few experimental samples. We put a particular focus on estimating both aleatoric and epistemic uncertainty of the network's estimate and benchmark against the best-known conventional estimation algorithms. For states that are contained in the training distribution, we observe convergence in a regime of sample sizes in which the baseline method fails to give correct estimates, while extrapolation only seems possible for regions close to the training regime. As a further application of our method, highly relevant for quantum simulation experiments, we estimate the quantum mutual information for nonunitary evolution by training our model on different noise strengths.

arXiv:2309.07556•Physical Review A•Jan 2, 2024•13 citations

Conditional entropy and information of quantum processes

Siddhartha Das, Kaumudibikash Goswami, Vivek Pandey

What would be a reasonable definition of the conditional entropy of bipartite quantum processes, and what novel insight would it provide? We develop this notion using four information-theoretic axioms and define the corresponding quantitative formulas. Our definitions of the conditional entropies of channels are based on the generalized state and channel divergences, for instance, quantum relative entropy. We find that the conditional entropy of quantum channels has potential to reveal insights for quantum processes that aren't already captured by the existing entropic functions, entropy or conditional entropy, of the states and channels. The von Neumann conditional entropy $S[A|B]_{\mathcal{N}}$ of the channel $\mathcal{N}_{A'B'\to AB}$ is based on the quantum relative entropy, with system pairs $A',A$ and $B',B$ being nonconditioning and conditioning systems, respectively. We identify a connection between the underlying causal structure of a bipartite channel and its conditional entropy. In particular, we provide a necessary and sufficient condition for a bipartite quantum channel $\mathcal{N}_{A'B'\to AB}$ in terms of its von Neumann conditional entropy $S[A|B]_{\mathcal{N}}$, to have no causal influence from $A'$ to $B$. As a consequence, if $S[A|B]_{\mathcal{N}}< -\log|A|$ then the channel necessarily has causal influence (signaling) from $A'$ to $B$. Our definition of the conditional entropy establishes the strong subadditivity of the entropy for quantum channels. We also study the total amount of correlations possible due to quantum processes by defining the multipartite mutual information of quantum channels.

arXiv:2410.01740•Oct 2, 2024•13 citations
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 SAvNS^{vN}_ASAvN​. We show that in many cases these lower bounds can be improved by removing the bitstrings with a probability lower than some value pminp_{min}pmin​ 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 SAvNS^{vN}_ASAvN​. 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 SAvNS^{vN}_ASAvN​. We briefly discuss practical implementations with QuEra's Aquila device.
We discuss the possibility of estimating experimentally the von Neumann entanglement entropy S A v N of a symmetric bipartite quantum system A B by using the basic measurement counts (bitstrings) for a single copy of a prepared state. Using exact diagonalization and analog simulations performed with the publicly available QuEra facilities for chains and ladders of Rydberg atoms, we calculate the Shannon entropy S A B X associated with the bitstrings of adiabatically prepared ground states and the reduced entropies S A X and S B X obtained from the marginal probabilities in A and B . We then calculate the classical mutual information I A B X = S A X + S B X − S A B X , which is a lower bound on S A v N . We show that for a broad range of lattice spacing and detuning, I A B X is typically 20% below S A v N in regions where S A v N is large and a less close bound in regions where S A v N is low. We argue that this use of the easily available bitstrings provides a robust and efficient way to explore empirically the phase diagram of qubit-based quantum simulators and identify critical regions.
We show that multipartite entanglement can be used as an efficient way of identifying the critical points of 1+1D systems. We demonstrate this with the quantum Ising model, lattice λϕ4λϕ^4λϕ4 approximated with qutrits, and arrays of Rydberg atoms. To do so we make use of multipartite compositions of entanglement quantities for different parts combined to form the strong subadditivity, weak monotonicity, and a convex combination of these with conformal properties. These quantities display some remarkable properties. We will demonstrate how the entanglement of individual parts together displays behavior at phase boundaries, but the combination of these in the aforementioned quantities sharpens and localizes this behavior to the boundaries even better. We will show that we can extend a scheme for approximating the entanglement with the mutual information, and that this acts as a lower bound which will also follow the changes in the entanglement for the above quantities, despite the additional contributions of different signs. This mutual information approximation to the identifying quantities can have its lower probabilities removed in a process we call filtering, and despite the combination of terms will respond well to the filtering and offer improvements to the lower bound.
The empirical bitstring distribution is the most accessible observable on Rydberg-atom arrays, but the bipartite von~Neumann entropy it constrains is far costlier to obtain. We present a six-term linear closed form for the entropy, built on bitstring-derivable physics scalars, and characterize its accuracy, portability, scaling behaviour, and calibration cost. The feature set is selected with guidance from a trained graph neural network: probing the network localizes its entropy prediction to the two-point correlators on the bipartition boundary, and an exhaustive ground-truth search restricted to those boundary correlators isolates the form. It reaches 0.0240.0240.024~nats mean absolute error in distribution: 6.46.46.4 times the network's error, but in a form a human can read and apply without retraining. Fit once and applied unchanged, it has lower error than the base network on five of six out-of-distribution pools and ties the sixth. An independent density-matrix renormalization-group study to one hundred atoms -- five times the reach of exact diagonalization -- settles the size-extrapolation question: coefficients frozen at small size fail at scale, but the failure is structured. Refit per size the form holds to 252525--505050~mnat (cross-validated); two of its six slopes follow clean inverse-size laws, one a downward curving growth, and the others are trendless; the fitted laws deploy the form label-free at roughly 404040--808080~mnat. The result fixes a label-budget rule: at large sizes, a few dozen labels recalibrate the closed form to match a fine-tuned in-distribution ensemble on the same features, while nonlinear ML models pull ahead only given large labelled datasets.
Matrix elements of the density matrix of small quantum systems have recently become experimentally accessible within the cold atoms simulations. Numerical estimation of these quantities is known to be computationally challenging. Tracing out a part of the studied system and hence accessing the reduced density matrices offers similar difficulties, but it is more interesting, as the reduced density matrix is the basis of entanglement entropy measures. In this work, we present a method of estimating the individual elements of the reduced density matrices that uses autoregressive neural networks and the path integral quantization approach. We use a hierarchy of neural networks capable of estimating conditional probabilities of consecutive spins to evaluate elements of reduced density matrices directly. Using the Ising chain as an example, we calculate the continuum limit of the ground state’s von Neumann and Rényi bipartite entanglement entropies of an interval built of up to 5 spins. We demonstrate that our architecture is able to estimate all the needed matrix elements with just a single training for a fixed temperature discretization and lattice volume. Our method can be applied to other types of spin chains, possibly with defects, as well as to estimating entanglement entropies of thermal states at non-zero temperature. Hence, it may offer an attractive computational approach as a counterpart to the experimental effort. Abstract Published by the Jagiellonian University 2025 authors
We explore a supervised machine-learning approach to estimate the entanglement entropy of multiqubit systems from few experimental samples. We put a particular focus on estimating both aleatoric and epistemic uncertainty of the network's estimate and benchmark against the best-known conventional estimation algorithms. For states that are contained in the training distribution, we observe convergence in a regime of sample sizes in which the baseline method fails to give correct estimates, while extrapolation only seems possible for regions close to the training regime. As a further application of our method, highly relevant for quantum simulation experiments, we estimate the quantum mutual information for nonunitary evolution by training our model on different noise strengths.
What would be a reasonable definition of the conditional entropy of bipartite quantum processes, and what novel insight would it provide? We develop this notion using four information-theoretic axioms and define the corresponding quantitative formulas. Our definitions of the conditional entropies of channels are based on the generalized state and channel divergences, for instance, quantum relative entropy. We find that the conditional entropy of quantum channels has potential to reveal insights for quantum processes that aren't already captured by the existing entropic functions, entropy or conditional entropy, of the states and channels. The von Neumann conditional entropy S[A∣B]NS[A|B]_{\mathcal{N}}S[A∣B]N​ of the channel NA′B′→AB\mathcal{N}_{A'B'\to AB}NA′B′→AB​ is based on the quantum relative entropy, with system pairs A′,AA',AA′,A and B′,BB',BB′,B being nonconditioning and conditioning systems, respectively. We identify a connection between the underlying causal structure of a bipartite channel and its conditional entropy. In particular, we provide a necessary and sufficient condition for a bipartite quantum channel NA′B′→AB\mathcal{N}_{A'B'\to AB}NA′B′→AB​ in terms of its von Neumann conditional entropy S[A∣B]NS[A|B]_{\mathcal{N}}S[A∣B]N​, to have no causal influence from A′A'A′ to BBB. As a consequence, if S[A∣B]N<−log⁡∣A∣S[A|B]_{\mathcal{N}}< -\log|A|S[A∣B]N​<−log∣A∣ then the channel necessarily has causal influence (signaling) from A′A'A′ to BBB. Our definition of the conditional entropy establishes the strong subadditivity of the entropy for quantum channels. We also study the total amount of correlations possible due to quantum processes by defining the multipartite mutual information of quantum channels.