No, it doesn't.
A tautology consists of a certain type of statement form which satisfies the given formation rules and always holds true under all evaluations. Using bold letters, instead of capital letters, some tautologies are:
(B=>B)
and
(A=>(B=>A))
and
(($\lnot$A=>$\lnot$B)=>(($\lnot$A=>B)=>A))
On the other hand, though an implication will hold true for all valuations of the letters, it need not satisfy the formation rules for statement forms. As an example, consider the following:
A logically implies ((A=>B)=>B)
Or we might write |= as a short-hand for logically implies and write:
A |= ((A=>B)=>B)
That doesn't satisfy the formation rules for statement forms. To indicate that the premisses having the form "A" and the form "(A=>B)" logically imply B we might write
A, (A=>B) |= B
or
{A, (A=>B)} |= B
But, the component parts are different from those of tautologies. With the idea of having a set of premisses in mind we could rewrite the above as:
{(A=>B), A} |= B
or
{A, A, A, (A=>B), A, A, (A=>B), (A=>B), A} |= B
Those immediately above all represent a single logical implication, at least as a single concept.
But, a tautology like
((A=>(A=>B))=>(A=>B))
is distinct from the tautology:
(((A=>(A=>B))=>(A=>(A=>B)))=>(A=>B)).
Those consist of two different statement forms.