Jessica Bohm
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jessica Bohm has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Alexandre Cooper
University of Waterloo
1 shared publication - Amer E. Mouawad
Department of Computer Science American University of Beirut Lebanon
1 shared publication - Izzat El Hajj
American University of Beirut, Beirut, Lebanon
1 shared publication - Naomi Nishimura
David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
1 shared publication - Remy El Sabeh
University of Waterloo
1 shared publication - Stephanie Maaz
David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
1 shared publication
Latest Publications
- 4 August 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 108 (2) , 023108
Efficient algorithms to solve atom reconfiguration problems. II. Assignment-rerouting-ordering algorithm
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 control operations to transform an arbitrary configuration of atoms into a predetermined one requires solving an atom reconfiguration problem quickly and efficiently. A typical approach to solving atom reconfiguration problems is to use an assignment algorithm to determine which atoms to move to which traps. This approach results in control protocols that exactly minimize the number of displacement operations; however, this approach does not optimize for the number of displaced atoms or the number of times each atom is displaced, resulting in unnecessary control operations that increase the execution time and failure rate of the control protocol. In this work we propose the assignment-rerouting-ordering (ARO) algorithm to improve the performance of assignment-based algorithms in solving atom reconfiguration problems. The ARO algorithm uses an assignment subroutine to minimize the total distance traveled by all atoms, a rerouting subroutine to reduce the number of displaced atoms, and an ordering subroutine to guarantee that each atom is displaced at most once. The ordering subroutine relies on the existence of a partial ordering of moves that can be obtained using a polynomial-time algorithm that we introduce within the formal framework of graph theory. We numerically quantify the performance of the ARO algorithm in the presence and in the absence of loss and show that it outperforms the exact, approximation, and heuristic algorithms that we use as benchmarks. Our results are useful for assembling large configurations of atoms with high success probability and fast preparation time, as well as for designing and benchmarking novel atom reconfiguration algorithms.
- 4 August 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 108 (2) , 023108
Efficient algorithms to solve atom reconfiguration problems. II. Assignment-rerouting-ordering algorithm
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 control operations to transform an arbitrary configuration of atoms into a predetermined one requires solving an atom reconfiguration problem quickly and efficiently. A typical approach to solving atom reconfiguration problems is to use an assignment algorithm to determine which atoms to move to which traps. This approach results in control protocols that exactly minimize the number of displacement operations; however, this approach does not optimize for the number of displaced atoms or the number of times each atom is displaced, resulting in unnecessary control operations that increase the execution time and failure rate of the control protocol. In this work we propose the assignment-rerouting-ordering (ARO) algorithm to improve the performance of assignment-based algorithms in solving atom reconfiguration problems. The ARO algorithm uses an assignment subroutine to minimize the total distance traveled by all atoms, a rerouting subroutine to reduce the number of displaced atoms, and an ordering subroutine to guarantee that each atom is displaced at most once. The ordering subroutine relies on the existence of a partial ordering of moves that can be obtained using a polynomial-time algorithm that we introduce within the formal framework of graph theory. We numerically quantify the performance of the ARO algorithm in the presence and in the absence of loss and show that it outperforms the exact, approximation, and heuristic algorithms that we use as benchmarks. Our results are useful for assembling large configurations of atoms with high success probability and fast preparation time, as well as for designing and benchmarking novel atom reconfiguration algorithms.