Comparison of Atom Detection Algorithms for Neutral Atom Quantum Computing

• URL: http://arxiv.org/abs/2409.16856v1
• Date: Wed, 25 Sep 2024 12:08:06 GMT
• Title: Comparison of Atom Detection Algorithms for Neutral Atom Quantum Computing
• Authors: Jonas Winklmann, Andrea Alberti, Martin Schulz,
• Abstract summary: In atom quantum computers, the brightness or some comparable metric is estimated and used to predict the presence or absence of an atom. We investigate several different algorithms and compare their performance in terms of both precision and execution run time. Our comparison shows that of our tested algorithms, a global non-linear least-squares solver that uses the optical system's PSF to return a each sites' number of photoelectrons performed the best.
• Score: 1.1762674777779538
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In neutral atom quantum computers, readout and preparation of the atomic qubits are usually based on fluorescence imaging and subsequent analysis of the acquired image. For each atom site, the brightness or some comparable metric is estimated and used to predict the presence or absence of an atom. Across different setups, we can see a vast number of different approaches used to analyze these images. Often, the choice of detection algorithm is either not mentioned at all or it is not justified. We investigate several different algorithms and compare their performance in terms of both precision and execution run time. To do so, we rely on a set of synthetic images across different simulated exposure times with known occupancy states. Since the use of simulation provides us with the ground truth of atom site occupancy, we can easily state precise error rates and variances of the reconstructed property. To also rule out the possibility of better algorithms existing, we calculated the Cram\'er-Rao bound in order to establish an upper limit that even a perfect estimator cannot outperform. As the metric of choice, we used the number of photonelectrons that can be contributed to a specific atom site. Since the bound depends on the occupancy of neighboring sites, we provide the best and worst cases, as well as a half filled one. Our comparison shows that of our tested algorithms, a global non-linear least-squares solver that uses the optical system's PSF to return a each sites' number of photoelectrons performed the best, on average crossing the worst-case bound for longer exposure times. Its main drawback is its huge computational complexity and, thus, required calculation time. We manage to somewhat reduce this problem, suggesting that its use may be viable. However, our study also shows that for cases where utmost speed is required, simple algorithms may be preferable.

Related papers

• Realistic Neutral Atom Image Simulation [1.3220067655295737]
  Bottom-up simulator capable of generating sample images of neutral atom experiments from a description of the actual state in the simulated system. Use cases include the creation of exemplary images for demonstration purposes, fast training iterations for deconvolution algorithms, and generation of labeled data for machine-learning atom detection approaches.
  arXiv  Detail & Related papers  (2023-10-04T14:02:18Z)
• A Quadratic Speedup in the Optimization of Noisy Quantum Optical Circuits [5.074606924176912]
  Linear optical quantum circuits with photon number resolving (PNR) detectors are used for both Gaussian Boson Sampling (GBS) and for the preparation of non-Gaussian states such as Gottesman-Kitaev-Preskill (GKP) We introduce a family of algorithms that calculate detection probabilities, conditional states and their gradients with respect to circuit parametrizations. These algorithms are implemented and ready to use in the open-source photonic optimization library MrMustard.
  arXiv  Detail & Related papers  (2023-03-15T18:51:36Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Efficient algorithms to solve atom reconfiguration problems. II. The assignment-rerouting-ordering (aro) algorithm [51.02512563152503]
  atom reconfiguration problems require solving an atom problem quickly and efficiently. A typical approach to solve atom reconfiguration problems is to use an assignment algorithm to determine which atoms to move to which traps. This approach does not optimize for the number of displaced atoms nor the number of times each atom is displaced. We propose the assignment-rerouting-ordering (aro) algorithm to improve the performance of assignment-based algorithms in solving atom reconfiguration problems.
  arXiv  Detail & Related papers  (2022-12-11T19:48:25Z)
• 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)
• Classical modelling of a bosonic sampler with photon collisions [0.0]
  We present a classical algorithm that simulates a bosonic sampler. It calculates the probability of a given photon distribution at the interferometer outputs for a given distribution at the inputs.
  arXiv  Detail & Related papers  (2022-09-02T07:21:43Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• A hybrid quantum image edge detector for the NISQ era [62.997667081978825]
  We propose a hybrid method for quantum edge detection based on the idea of a quantum artificial neuron. Our method can be practically implemented on quantum computers, especially on those of the current noisy intermediate-scale quantum era.
  arXiv  Detail & Related papers  (2022-03-22T22:02:09Z)
• Classical simulation of boson sampling based on graph structure [2.5496329090462626]
  We present classical sampling algorithms for single-photon and Gaussian input states that take advantage of a graph structure of a linear-optical circuit. We show that when the circuit depth is less than the quadratic in the lattice spacing, the efficient simulation is possible with an exponentially small error. We implement a likelihood test with a recent numerically Gaussian boson sampling experiment and show that the treewidth-based algorithm with a limited treewidth renders a larger likelihood than the experimental data.
  arXiv  Detail & Related papers  (2021-10-04T17:02:35Z)
• Quadratic speedup for simulating Gaussian boson sampling [0.9236074230806577]
  We introduce an algorithm for the classical simulation of Gaussian boson sampling that is quadratically faster than previously known methods. The complexity of the algorithm is exponential in the number of photon pairs detected, not the number of photons. We show that an improved loop hafnian algorithm can be used to compute pure-state probabilities without the need of a supercomputer.
  arXiv  Detail & Related papers  (2020-10-29T13:53:30Z)
• Fast and robust quantum state tomography from few basis measurements [65.36803384844723]
  We present an online tomography algorithm designed to optimize all the aforementioned resources at the cost of a worse dependence on accuracy. The protocol is the first to give provably optimal performance in terms of rank and dimension for state copies, measurement settings and memory. Further improvements are possible by executing the algorithm on a quantum computer, giving a quantum speedup for quantum state tomography.
  arXiv  Detail & Related papers  (2020-09-17T11:28:41Z)

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.