Optimal Matching Problem on the Boolean Cube

We establish upper and lower bounds for the expected Wasserstein distance between the random empirical measure and the uniform measure on the Boolean cube. Our analysis leverages techniques from Fourier analysis, following the framework introduced in \cite{bobkov2021simple}, as well as methods from large deviations theory.