We present a method for approximate counting simple cycles of a given length in graphs. The main result of this paper is an $(\epsilon,\delta)$-approximation to the number of simple cycles of length $k$ which runs in $\O$$(M(n) \log n/ \epsilon^2 \log (1/\delta))$ time, where $\O$$(M(n))$ is the complexity of matrix multiplication.