12 citations · 40 across the 11 of their papers we have counts for
15 papers
Efficient algorithms to solve atom reconfiguration problems. II. The assignment-rerouting-ordering (aro) algorithm
Remy El Sabeh, Jessica Bohm, Zhiqian Ding +5
Programmable arrays of optical traps enable the assembly of configurations of single atoms to perform controlled experiments on quantum many-body systems. Finding the sequence of c…
Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm
Barry Cimring, Remy El Sabeh, Marc Bacvanski +5
We propose the redistribution-reconfiguration (red-rec) algorithm to prepare large configurations of atoms using arrays of dynamic optical traps. Red-rec exploits simple heuristics…
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems
Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura +1
A graph vertex-subset problem defines which subsets of the vertices of an input graph are feasible solutions. We view a feasible solution as a set of tokens placed on the vertices…
Parameterized complexity of reconfiguration of atoms
Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad +1
Our work is motivated by the challenges presented in preparing arrays of atoms for use in quantum simulation. The recently-developed process of loading atoms into traps results in…
Incremental Optimization of Independent Sets under Reachability Constraints
Takehiro Ito, Haruka Mizuta, Naomi Nishimura +1
We introduce a new framework for reconfiguration problems, and apply it to independent sets as the first example. Suppose that we are given an independent set of a graph ,…
Reconfiguration of graph minors
Benjamin Moore, Naomi Nishimura, Vijay Subramanya
Under the reconfiguration framework, we consider the various ways that a target graph is a {\em minor} of a host graph , where a subgraph of can be transformed into …