Recently the exponential Randić index ${\mathrm{e}}^{\chi }$ was introduced. The exponential Randić index of a graph $G$ is defined as the sum of the weights ${\mathrm{e}}^{\frac{1}{\sqrt{d\left(u\right)d\left(v\right)}}}$ of all edges $uv$ of $G$, where $d(u)$ denotes the degree of a vertex $u$ in $G$. In this paper, we give sharp lower and upper bounds on the exponential Randić index of unicyclic graphs.