No because there is no relation between ambiguity and left recursion.
Ambiguity means that we can derive two parse tree for same string whereas Left recursion means that the parse tree will grow in leftward direction which will eventually lead to infinite recursion. That is the reason why Left recursive grammars can't be parsed by Top down parsers.