Two optimal transport problems between determinantal point processes (DPP for short) are investigated. It is shown how to estimate the Kantorovitch–Rubinstein and Wasserstein-2 distances between distributions of DPP. These results are applied to evaluate the accuracy of a fast but approximate simulation algorithm of the Ginibre point process restricted to a circle. One can now simulate in a reasonable amount of time more than ten thousands points.