Marc Bacvanski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Marc Bacvanski 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 - Barry E. Cimring
Massachusetts Institute of Technology
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
Latest Publications
- 4 August 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 108 (2) , 023107
Efficient algorithms to solve atom reconfiguration problems. I. Redistribution-reconfiguration algorithm
We propose the redistribution-reconfiguration (red-rec) algorithm to prepare large configurations of atoms using programmable arrays of optical traps. Red-rec exploits simple heuristics and exact subroutines to solve atom reconfiguration problems on grids. It admits a fast and efficient implementation suitable for real-time operation. We numerically quantify its performance using realistic physical parameters and operational constraints, in both the absence and presence of loss. Red-rec enables assembling large configurations of atoms with high mean success probability. Fast preparation times are achieved by harnessing parallel control operations that actuate multiple traps simultaneously. Faster preparation times are achieved by rejecting configurations of atoms containing fewer atoms than a given threshold. However, the number of traps required to prepare a compact-centered configuration of atoms on a grid with a probability of 0.5 scales as the 3/2 power of the number of desired atoms. This finding highlights some of the challenges associated with scaling up configurations of atoms beyond tens of thousands of atoms.
- 4 August 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 108 (2) , 023107
Efficient algorithms to solve atom reconfiguration problems. I. Redistribution-reconfiguration algorithm
We propose the redistribution-reconfiguration (red-rec) algorithm to prepare large configurations of atoms using programmable arrays of optical traps. Red-rec exploits simple heuristics and exact subroutines to solve atom reconfiguration problems on grids. It admits a fast and efficient implementation suitable for real-time operation. We numerically quantify its performance using realistic physical parameters and operational constraints, in both the absence and presence of loss. Red-rec enables assembling large configurations of atoms with high mean success probability. Fast preparation times are achieved by harnessing parallel control operations that actuate multiple traps simultaneously. Faster preparation times are achieved by rejecting configurations of atoms containing fewer atoms than a given threshold. However, the number of traps required to prepare a compact-centered configuration of atoms on a grid with a probability of 0.5 scales as the 3/2 power of the number of desired atoms. This finding highlights some of the challenges associated with scaling up configurations of atoms beyond tens of thousands of atoms.