Parallel compression algorithm for fast preparation of defect-free atom arrays

• URL: http://arxiv.org/abs/2212.03047v3
• Date: Wed, 7 Aug 2024 13:45:27 GMT
• Title: Parallel compression algorithm for fast preparation of defect-free atom arrays
• Authors: Shangguo Zhu, Yun Long, Mingbo Pu, Xiangang Luo,
• Abstract summary: We propose a novel parallel compression algorithm which leverages multiple mobile tweezers to transfer atoms simultaneously. The total time cost could be reduced to scale linearly with the number of target sites.
• Score: 2.9592586928462308
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Defect-free atom arrays have emerged as a powerful and versatile platform for quantum sciences and technologies, offering high programmability and promising scalability. The arrays can be prepared by rearranging atoms from a partially loaded initial array to the designated target sites. However, achieving large defect-free arrays presents challenges due to atom loss during rearrangement and the vacuum-limited lifetime which is inversely proportional to the array size. Efficient rearrangement algorithms which minimize time cost and atom loss are crucial for successful atom rearrangement. Here we propose a novel parallel compression algorithm which leverages multiple mobile tweezers to transfer atoms simultaneously. The total time cost could be reduced to scale linearly with the number of target sites. This algorithm can be readily implemented in current experimental setups.

Related papers

• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• 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)
• Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm [51.02512563152503]
  We numerically quantify the performance of the red-rec algorithm, both in the absence and in the presence of loss. We show that the number of traps required to prepare a compact-centered configuration of atoms on a grid with a mean success probability of one half scales as the 3/2 power of the number of desired atoms. The red-rec algorithm admits an efficient implementation that can readily be deployed on real-time control systems.
  arXiv  Detail & Related papers  (2022-12-07T19:00:01Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Accelerating the assembly of defect-free atomic arrays with maximum parallelisms [16.079283601909435]
  Defect-free atomic arrays have been demonstrated as a scalable and fully-controllable platform for quantum simulations and quantum computations. We design an integrated measurement and feedback system, based on field programmable gate array (FPGA), to quickly assemble two-dimensional defect-free atomic array. We present the overall performance for different target geometries, and demonstrate a significant reduction in rearrangement time and the potential to scale up defect-free atomic array system to thousands of qubits.
  arXiv  Detail & Related papers  (2022-10-19T08:11:01Z)
• Parallel assembly of arbitrary defect-free atom arrays with a multi-tweezer algorithm [0.0]
  Large-scale defect-free atom arrays are an important precursor for quantum information processing and quantum simulation. Here, we demonstrate a novel parallel rearrangement algorithm that uses multiple mobile tweezers to sort and compress atom arrays. With a high degree of parallelism, our algorithm offers a reduced move complexity compared to both single-tweezer algorithms and existing multi-tweezer algorithms.
  arXiv  Detail & Related papers  (2022-09-16T16:34:29Z)
• Efficient two-dimensional defect-free dual-species atom arrays rearrangement algorithm with near-fewest atom moves [12.346877792340315]
  We propose an efficient connectivity optimization algorithm (HCOA) to rearrange theally loaded atoms into arbitrary configurations. Our algorithm shows a high success rate (> 97%), low extra atom moves ratio, good scalability, and flexibility.
  arXiv  Detail & Related papers  (2022-03-22T17:03:09Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Efficient preparation of 2D defect-free atom arrays with near-fewest sorting-atom moves [17.56031315827533]
  We propose a new sorting algorithm (heuristic cluster algorithm, HCA) which provides near-fewest moves in our tailored atom assembler scheme. Our method is essential to scale hundreds of assembled atoms for bottom-up quantum computation, quantum simulation and precision measurement.
  arXiv  Detail & Related papers  (2020-11-20T13:08:06Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.