Abstract: Quantum computers promise to eventually provide significant algorithmic advantage over classical computers for a variety of problems. Executing algorithms on a physical device requires compiling circuits to the native gate set of your device. We are in the Noisy Intermediate Scale Quantum (NISQ) era of quantum computers where circuit execution depths are severely limited by qubit decoherence and gate errors. Large defect-free atom arrays can be produced by initially loading into traps with ~50% success and rearranging the trapped atoms into a desired pattern to enable enhanced data rates for calibrating control operations and running circuits. We present on our implementation of defect-free array generation using the Hungarian matching algorithm and on a partially parallelized rearrangement algorithm. Quantum computers based on a register of neutral Cs atoms have demonstrated significant improvements in gate fidelities in recent years. We present the first implementation of quantum algorithms on an array of neutral Cs atoms. Algorithms executed include Greenberger-Horne-Zeilinger state preparation, Quantum Phase Estimation of the ground state energy of the Hydrogen molecule, the Quantum Approximate Optimization Algorithm (QAOA) applied to the MAXCUT problem, and the Variational Quantum Eigensolver algorithm applied to finding the ground state energy of the Lipkin model. Looking to the future, high performance quantum error correction (QEC) codes will eventually be necessary to run very deep circuits that promise to eventually provide quantum advantage. We present on a qubit allocation scheme and Rydberg gate protocol that would allow for the implementation of a recently characterized class of quantum QEC codes known as Bivariate Bicycle codes on a 2D array of Cs qubits.