No, the efficiency of quantum computers in solving certain problems does not imply that P = NP. The question of whether P = NP is a longstanding and unsolved problem in theoretical computer science.
P and NP are classes of computational problems. P represents the set of problems that can be solved in polynomial time by a deterministic classical computer, while NP represents the set of problems for which a potential solution can be verified in polynomial time by a deterministic classical computer.
Quantum computers, on the other hand, are a different model of computation that utilize quantum mechanical phenomena such as superposition and entanglement to perform certain computations more efficiently than classical computers. Quantum computers can solve some problems faster than classical computers, but they do not necessarily solve all problems in polynomial time.
The question of whether P = NP asks whether every problem for which a potential solution can be verified efficiently (in polynomial time) can also be solved efficiently (in polynomial time) by a deterministic classical computer. It remains an open question, and the efficiency of quantum computers does not provide a resolution to this problem.