On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective