We introduce ℓ-leaky positive semidefinite forcing and the ℓ-leaky positive semidefinite number of a graph, Z(ℓ)+G, which combines the positive semidefinite color change rule with the addition of leaks to the graph. Furthermore, we determine general properties of Z(ℓ)+G
Nearby in the stack
and
Z(ℓ)+G
for various graphs, including path graphs, complete graphs, wheel graphs, complete bipartite graphs, trees, hypercubes, and prisms. We also define
ℓ
-leaky positive semidefinite forts with the purpose of unveiling differences between