We introduce $\ell$-leaky positive semidefinite forcing and the $\ell$-leaky positive semidefinite number of a graph, $Z_{(\ell)}^+{G}$, which combines the positive semidefinite color change rule with the addition of leaks to the graph. Furthermore, we determine general properties of $Z_{(\ell)}^+{G}$ and $Z_{(\ell)}^+{G}$ for various graphs, including path graphs, complete graphs, wheel graphs, complete bipartite graphs, trees, hypercubes, and prisms. We also define $\ell$-leaky positive semidefinite forts with the purpose of unveiling differences between $\ell$-leaky standard forcing and $\ell$-leaky positive semidefinite forcing.