Let $G$ be a simple connected graph, $v_i$ its vertex, and $D_i$ the sum of distances between $v_i$ and the other vertices of $G$. Let $\delta_1, \delta_2,\ldots, \delta_n$ be the eigenvalues of the distance matrix $\mathbf D$ of $G$, and $\delta^L_1,\delta^L_2,\ldots,\delta^L_n$ the eigenvalues of the distance Laplacian matrix $\mathbf D^L$ of $G$. An earlier much studied quantity $E_D(G)=\sum_{i=1}^n|\delta_i|$ is the distance energy. We now define the distance Laplacian energy as $LE_D(G)=\sum_{i=1}^n \left|\delta_i^L-\frac{1}{n} um_{i=1}^n D_i \right|$, and obtain bounds for it.