Improved entanglement entropy estimates from filtered bitstring probabilities

• URL: http://arxiv.org/abs/2411.07092v1
• Date: Mon, 11 Nov 2024 16:14:02 GMT
• Title: Improved entanglement entropy estimates from filtered bitstring probabilities
• Authors: Avi Kaufman, James Corona, Zane Ozzello, Muhammad Asaduzzaman, Yannick Meurice,
• Abstract summary: von Neumann entanglement entropy provides information regarding critical points and continuum limits for analog simulators. We show that these bounds can in most cases be improved by removing bitstrings with a probability lower than some value. We discuss the dependence on the size of the system, the lattice spacing, and the bipartition of the system.
• Score: 0.8854624631197944
• License:
• 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 $S^{vN}_A$. Here, we show that these bounds can in most cases be improved by removing the bitstrings with a probability lower than some value $p_{min}$ and renormalizing the remaining probabilities (filtering). Surprisingly, in some cases, as we increase $p_{min}$ the filtered mutual information tends to plateaus at values very close to $S^{vN}_A$ over some range of $p_{min}$. 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.

Related papers

• Quantum Error Suppression with Subgroup Stabilisation [3.4719087457636792]
  Quantum state purification is the functionality that, given multiple copies of an unknown state, outputs a state with increased purity. We propose an effective state purification gadget with a moderate quantum overhead by projecting $M$ noisy quantum inputs to their subspace. Our method, applied in every short evolution over $M$ redundant copies of noisy states, can suppress both coherent and errors by a factor of $1/M$, respectively.
  arXiv  Detail & Related papers  (2024-04-15T17:51:47Z)
• Experimental lower bounds on entanglement entropy without twin copy [0.0]
  We calculate the Shannon entropy $S_ABX$ associated with the experimental measurements of adiabatically prepared ground states. We show several examples for which, in good approximation, $S_AvNpropto (2S_AX-S_ABX)$ with a constant of proportionality slightly larger than one.
  arXiv  Detail & Related papers  (2024-04-15T17:02:17Z)
• Pseudoentanglement Ain't Cheap [0.43123403062068827]
  We show that any pseudoentangled state ensemble with a gap of $t$ bits of entropy requires $Omega(t)$ non-Clifford gates to prepare. This is tight up to polylogarithmic factors if linear-time-secure pseudorandom functions exist.
  arXiv  Detail & Related papers  (2024-03-29T19:39:59Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Contextual Combinatorial Bandits with Probabilistically Triggered Arms [55.9237004478033]
  We study contextual bandits with probabilistically triggered arms (C$2$MAB-T) under a variety of smoothness conditions. Under the triggering modulated (TPM) condition, we devise the C$2$-UC-T algorithm and derive a regret bound $tildeO(dsqrtT)$.
  arXiv  Detail & Related papers  (2023-03-30T02:51:00Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• A Law of Robustness beyond Isoperimetry [84.33752026418045]
  We prove a Lipschitzness lower bound $Omega(sqrtn/p)$ of robustness of interpolating neural network parameters on arbitrary distributions. We then show the potential benefit of overparametrization for smooth data when $n=mathrmpoly(d)$. We disprove the potential existence of an $O(1)$-Lipschitz robust interpolating function when $n=exp(omega(d))$.
  arXiv  Detail & Related papers  (2022-02-23T16:10:23Z)
• Quasi-polynomial time algorithms for free quantum games in bounded dimension [11.56707165033]
  We give a semidefinite program of size $exp(mathcalObig(T12(log2(AT)+log(Q)log(AT))/epsilon2big)) to compute additive $epsilon$-approximations on the values of two-player free games. We make a connection to the quantum separability problem and employ improved multipartite quantum de Finetti theorems with linear constraints.
  arXiv  Detail & Related papers  (2020-05-18T16:55:08Z)
• Robustly Learning any Clusterable Mixture of Gaussians [55.41573600814391]
  We study the efficient learnability of high-dimensional Gaussian mixtures in the adversarial-robust setting. We provide an algorithm that learns the components of an $epsilon$-corrupted $k$-mixture within information theoretically near-optimal error proofs of $tildeO(epsilon)$. Our main technical contribution is a new robust identifiability proof clusters from a Gaussian mixture, which can be captured by the constant-degree Sum of Squares proof system.
  arXiv  Detail & Related papers  (2020-05-13T16:44:12Z)
• From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography [0.0]
  We first conjecture on the basis of experimental data that the entropy of the posterior is minimized by the constant strings. We then establish a connection between covert communication and deniability to propose DC-QKE. We present an efficient coercion-resistant and quantum-secure voting scheme, based on fully homomorphic encryption.
  arXiv  Detail & Related papers  (2020-03-25T22:20:47Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.