Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm

• URL: http://arxiv.org/abs/2212.03885v1
• Date: Wed, 7 Dec 2022 19:00:01 GMT
• Title: Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm
• Authors: Barry Cimring, Remy El Sabeh, Marc Bacvanski, Stephanie Maaz, Izzat El Hajj, Naomi Nishimura, Amer E. Mouawad and Alexandre Cooper
• Abstract summary: 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.
• Score: 51.02512563152503
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose the redistribution-reconfiguration~(red-rec) algorithm to efficiently compute control protocols to assemble compact-centered configurations of atoms in two-dimensional arrays of optical traps with lattice geometries. The red-rec algorithm redistributes atoms among pairs of donor-receiver columns and reconfigures each column using an exact displacement-minimizing algorithm, harnessing parallel control operations that simultaneously actuate multiple traps to reduce the execution time. We numerically quantify the performance of the red-rec algorithm, both in the absence and in the presence of loss, using realistic physical parameters and operational constraints. 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, highlighting the challenges of assembling configurations of tens of thousands of atoms. We further demonstrate that faster preparation times can be achieved by rejecting configurations of atoms containing fewer atoms than a given threshold. The red-rec algorithm admits an efficient implementation that can readily be deployed on real-time control systems to assemble large configurations of atoms with high mean success probability and fast preparation times.

Related papers

• Atomique: A Quantum Compiler for Reconfigurable Neutral Atom Arrays [19.543879449267372]
  We introduce Atomique, a compilation framework designed for qubit mapping, atom movement, and gate scheduling. Atomique consistently outperforms IBM Superconducting, FAA with long-range gates, and FAA with rectangular and triangular topologies.
  arXiv  Detail & Related papers  (2023-11-25T21:57:41Z)
• Efficient Approximations of Complete Interatomic Potentials for Crystal Property Prediction [63.4049850776926]
  A crystal structure consists of a minimal unit cell that is repeated infinitely in 3D space. Current methods construct graphs by establishing edges only between nearby nodes. We propose to model physics-principled interatomic potentials directly instead of only using distances.
  arXiv  Detail & Related papers  (2023-06-12T07:19:01Z)
• 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)
• Parallel compression algorithm for fast preparation of defect-free atom arrays [2.9592586928462308]
  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.
  arXiv  Detail & Related papers  (2022-12-06T15:20:40Z)
• 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)
• Optimization-based Block Coordinate Gradient Coding for Mitigating Partial Stragglers in Distributed Learning [58.91954425047425]
  This paper aims to design a new gradient coding scheme for mitigating partial stragglers in distributed learning. We propose a gradient coordinate coding scheme with L coding parameters representing L possibly different diversities for the L coordinates, which generates most gradient coding schemes.
  arXiv  Detail & Related papers  (2022-06-06T09:25:40Z)
• 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)
• Efficient Micro-Structured Weight Unification and Pruning for Neural Network Compression [56.83861738731913]
  Deep Neural Network (DNN) models are essential for practical applications, especially for resource limited devices. Previous unstructured or structured weight pruning methods can hardly truly accelerate inference. We propose a generalized weight unification framework at a hardware compatible micro-structured level to achieve high amount of compression and acceleration.
  arXiv  Detail & Related papers  (2021-06-15T17:22:59Z)
• Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks [79.16773494166644]
  We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network. We design two optimal algorithms that attain these lower bounds. We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-08T15:54:44Z)
• SPANet: Generalized Permutationless Set Assignment for Particle Physics using Symmetry Preserving Attention [62.43586180025247]
  Collisions at the Large Hadron Collider produce variable-size sets of observed particles. Physical symmetries of decay products complicate assignment of observed particles to decay products. We introduce a novel method for constructing symmetry-preserving attention networks.
  arXiv  Detail & Related papers  (2021-06-07T18:18:20Z)
• 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)
• FastFlowNet: A Lightweight Network for Fast Optical Flow Estimation [81.76975488010213]
  Dense optical flow estimation plays a key role in many robotic vision tasks. Current networks often occupy large number of parameters and require heavy computation costs. Our proposed FastFlowNet works in the well-known coarse-to-fine manner with following innovations.
  arXiv  Detail & Related papers  (2021-03-08T03:09:37Z)
• 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)
• Lagrangian Decomposition for Neural Network Verification [148.0448557991349]
  A fundamental component of neural network verification is the computation of bounds on the values their outputs can take. We propose a novel approach based on Lagrangian Decomposition. We show that we obtain bounds comparable with off-the-shelf solvers in a fraction of their running time.
  arXiv  Detail & Related papers  (2020-02-24T17:55:10Z)

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.