Exploring near critical lattice gauge simulators with Rydberg atoms facilities

• URL: http://arxiv.org/abs/2507.14128v2
• Date: Thu, 14 Aug 2025 21:17:56 GMT
• Title: Exploring near critical lattice gauge simulators with Rydberg atoms facilities
• Authors: Avi Kaufman, Muhammad Asaduzzaman, Zane Ozzello, Blake Senseman, James Corona, Yannick Meurice,
• Abstract summary: We motivate the use of a ladder of Rydberg atoms as an analog simulator for a lattice gauge theory version of scalar electrodynamics also called the compact Abelian Higgs model.<n>We demonstrate that by using a few thousand shots from a single copy of the ladder simulator it is possible to estimate the bipartite quantum von Neumann entanglement entropy $SvN_A$.
• Score: 0.8356448113586906
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We motivate the use of a ladder of Rydberg atoms as an analog simulator for a lattice gauge theory version of scalar electrodynamics also called the compact Abelian Higgs model. We demonstrate that by using a few thousand shots from a single copy of the ladder simulator it is possible to estimate the bipartite quantum von Neumann entanglement entropy $S^{vN}_A$. The estimation relies on an optimized filtration of the mutual information associated with the bitstrings obtained from public facilities of configurable Rydberg arrays named Aquila. We discuss the limitations associated with finite sampling, sorting fidelity, adiabatic preparation, ramp-down of the Rabi frequency before measurement, and readout errors. We use cumulative probability distribution to compare Aquila results with high accuracy density matrix renormalization group (DMRG) or exact results. The state preparation appears to be the main source of error. We discuss the large volume behavior of the cumulative probability distribution and show examples where for a finite number of shots, there appears to be some large enough size for which, with high probability, any given state is seen at most once. We show that the results presented can be extended to multipartite entanglement. We briefly discuss the cost of the calculations for large square arrays in the context of obtaining quantum advantage in the near future.

Related papers

• Improved entanglement entropy estimates from filtered bitstring probabilities [0.8356448113586906]
  We calculate the mutual information which is a lower bound on the corresponding bipartite von Neumann quantum entanglement entropy $SvN_A$.<n>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.
  arXiv  Detail & Related papers  (2024-11-11T16:14:02Z)
• Quasi-Bayes meets Vines [2.3124143670964448]
  We propose a different way to extend Quasi-Bayesian prediction to high dimensions through the use of Sklar's theorem. We show that our proposed Quasi-Bayesian Vine (QB-Vine) is a fully non-parametric density estimator with emphan analytical form.
  arXiv  Detail & Related papers  (2024-06-18T16:31:02Z)
• Detecting Hidden Order in Fractional Chern Insulators [0.0]
  We propose a scheme for detecting the hidden off-diagonal long-range order (HODLRO) characterizing Laughlin states. This is achieved by large-scale numerical density matrix renormalization group (DMRG) simulations based on matrix product states. We confirm the characteristic power-law scaling of HODLRO, with an exponent $frac1nu = 2$, and show that its detection requires only a few thousand snapshots.
  arXiv  Detail & Related papers  (2023-09-07T12:05:43Z)
• Quantum Monte Carlo simulations in the restricted Hilbert space of Rydberg atom arrays [0.0]
  Rydberg atom arrays have emerged as a powerful platform to simulate a number of exotic quantum ground states and phase transitions.<n>We develop a versatile quantum Monte Carlo sampling technique which operates in the reduced Hilbert space generated by enforcing the constraint of a Rydberg blockade.<n>We show that it can efficiently generate the phase diagram of a Rydberg atom array, to temperatures much smaller than all energy scales involved, on a Kagom'e link lattice.
  arXiv  Detail & Related papers  (2023-09-01T14:18:54Z)
• Probabilistic Unrolling: Scalable, Inverse-Free Maximum Likelihood Estimation for Latent Gaussian Models [69.22568644711113]
  We introduce probabilistic unrolling, a method that combines Monte Carlo sampling with iterative linear solvers to circumvent matrix inversions. Our theoretical analyses reveal that unrolling and backpropagation through the iterations of the solver can accelerate gradient estimation for maximum likelihood estimation. In experiments on simulated and real data, we demonstrate that probabilistic unrolling learns latent Gaussian models up to an order of magnitude faster than gradient EM, with minimal losses in model performance.
  arXiv  Detail & Related papers  (2023-06-05T21:08:34Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Phase Diagram Detection via Gaussian Fitting of Number Probability Distribution [0.0]
  We investigate the number probability density function that characterizes sub-portions of a quantum many-body system with globally conserved number of particles. We put forward a linear fitting protocol capable of mapping out the ground-state phase diagram of the rich one-dimensional extended Bose-Hubbard model.
  arXiv  Detail & Related papers  (2022-07-04T15:15:01Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Convergence of Gaussian-smoothed optimal transport distance with sub-gamma distributions and dependent samples [12.77426855794452]
  This paper provides convergence guarantees for estimating the GOT distance under more general settings. A key step in our analysis is to show that the GOT distance is dominated by a family of kernel maximum mean discrepancy distances.
  arXiv  Detail & Related papers  (2021-02-28T04:30:23Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Linear-time inference for Gaussian Processes on one dimension [17.77516394591124]
  We investigate data sampled on one dimension for which state-space models are popular due to their linearly-scaling computational costs. We provide the first general proof of conjecture that state-space models are general, able to approximate any one-dimensional Gaussian Processes. We develop parallelized algorithms for performing inference and learning in the LEG model, test the algorithm on real and synthetic data, and demonstrate scaling to datasets with billions of samples.
  arXiv  Detail & Related papers  (2020-03-11T23:20:13Z)

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.