Enhanced atom-by-atom assembly of arbitrary tweezers arrays
- URL: http://arxiv.org/abs/2011.06827v1
- Date: Fri, 13 Nov 2020 09:33:19 GMT
- Title: Enhanced atom-by-atom assembly of arbitrary tweezers arrays
- Authors: Kai-Niklas Schymik, Vincent Lienhard, Daniel Barredo, Pascal Scholl,
Hannah Williams, Antoine Browaeys, Thierry Lahaye
- Abstract summary: We extend the capabilities of the atom-by-atom assembler described in [Barredo et al., Science 354, 1021]
We create fully-loaded target arrays of more than 100 single atoms in optical tweezers.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We report on improvements extending the capabilities of the atom-by-atom
assembler described in [Barredo et al., Science 354, 1021 (2016)] that we use
to create fully-loaded target arrays of more than 100 single atoms in optical
tweezers, starting from randomly-loaded, half-filled initial arrays. We
describe four variants of the sorting algorithm that (i) allow decrease the
number of moves needed for assembly and (ii) enable the assembly of arbitrary,
non-regular target arrays. We finally demonstrate experimentally the
performance of this enhanced assembler for a variety of target arrays.
Related papers
- Iterative assembly of $^{171}$Yb atom arrays with cavity-enhanced optical lattices [0.1441195472527485]
Assembling and maintaining large arrays of individually addressable atoms is a key requirement for continued scaling of neutral-atom-based quantum computers and simulators.
We demonstrate a new paradigm for assembly of atomic arrays, based on a synergistic combination of optical tweezers and cavity-enhanced optical lattices.
arXiv Detail & Related papers (2024-01-29T14:20:28Z) - Multi-level Reasoning for Robotic Assembly: From Sequence Inference to
Contact Selection [74.40109927350856]
We present the Part Assembly Sequence Transformer (PAST) to infer assembly sequences from a target blueprint.
We then use a motion planner and optimization to generate part movements and contacts.
Experimental results show that our approach generalizes better than prior methods.
arXiv Detail & Related papers (2023-12-17T00:47:13Z) - Sampled Transformer for Point Sets [80.66097006145999]
sparse transformer can reduce the computational complexity of the self-attention layers to $O(n)$, whilst still being a universal approximator of continuous sequence-to-sequence functions.
We propose an $O(n)$ complexity sampled transformer that can process point set elements directly without any additional inductive bias.
arXiv Detail & Related papers (2023-02-28T06:38:05Z) - 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) - 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) - In-situ equalization of single-atom loading in large-scale optical
tweezers arrays [0.0]
We report on the realization of large assembled arrays of more than 300 single $87$Rb atoms trapped in optical tweezers in a cryogenic environment.
For arrays with $N_rm a=324$ atoms, the assembly process results in defect-free arrays in $sim37%$ of the realizations.
arXiv Detail & Related papers (2022-07-13T19:43:59Z) - LoopStack: a Lightweight Tensor Algebra Compiler Stack [61.04098601022665]
LoopStack is a domain specific compiler stack for tensor operations.
It generates machine code that matches and frequently exceeds the performance of in state-of-the-art machine learning frameworks.
It has a very small memory footprint - a binary size of 245KB, and under 30K lines of effective code makes it ideal for use on mobile and embedded devices.
arXiv Detail & Related papers (2022-05-02T01:57:58Z) - 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 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) - Multi-View Spectral Clustering with High-Order Optimal Neighborhood
Laplacian Matrix [57.11971786407279]
Multi-view spectral clustering can effectively reveal the intrinsic cluster structure among data.
This paper proposes a multi-view spectral clustering algorithm that learns a high-order optimal neighborhood Laplacian matrix.
Our proposed algorithm generates the optimal Laplacian matrix by searching the neighborhood of the linear combination of both the first-order and high-order base.
arXiv Detail & Related papers (2020-08-31T12:28:40Z) - Sampling from a $k$-DPP without looking at all items [58.30573872035083]
Given a kernel function and a subset size $k$, our goal is to sample $k$ out of $n$ items with probability proportional to the determinant of the kernel matrix induced by the subset (a.k.a. $k$-DPP)
Existing $k$-DPP sampling algorithms require an expensive preprocessing step which involves multiple passes over all $n$ items, making it infeasible for large datasets.
We develop an algorithm which adaptively builds a sufficiently large uniform sample of data that is then used to efficiently generate a smaller set of $k$ items.
arXiv Detail & Related papers (2020-06-30T16:40:44Z) - From Sets to Multisets: Provable Variational Inference for Probabilistic
Integer Submodular Models [82.95892656532696]
Submodular functions have been studied extensively in machine learning and data mining.
In this work, we propose a continuous DR-submodular extension for integer submodular functions.
We formulate a new probabilistic model which is defined through integer submodular functions.
arXiv Detail & Related papers (2020-06-01T22:20:45Z)
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.