Can Hill Cipher be considered as Asymmetric?
No, because matrix inversion can be done efficiently. Namely, if encryption is multiplication by a matrix $A$, then you can define decryption with $A$ as first computing the inverse of $A$ and then multiplying.

An essential property of public-key cryptosystems is that it should not be possible to efficiently derive the (private) decryption key from the (public) encryption key. In the Hill cipher, the matrix must be kept secret.