  Defect-free atom arrays have emerged as a powerful and versatile platform for
quantum sciences and technologies, offering high programmability and promising
scalability. The arrays can be prepared by rearranging atoms from a partially
loaded initial array to the designated target sites. However, achieving large
defect-free arrays presents challenges due to atom loss during rearrangement
and the vacuum-limited lifetime which is inversely proportional to the array
size. Efficient rearrangement algorithms which minimize time cost and atom loss
are crucial for successful atom rearrangement. Here 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. This algorithm can be readily implemented in
current experimental setups.
