No, it is not true that the equality NP = P has been demonstrated by a simulator with quantum computing power. The question of whether NP (nondeterministic polynomial time) is equal to P (polynomial time) is one of the most significant unsolved problems in theoretical computer science, known as the P versus NP problem.
Quantum computing has the potential to offer speedup over classical computers for certain problems. While quantum computers can solve some problems faster than classical computers using quantum algorithms like Shor's algorithm for factoring large numbers, they have not been proven to solve NP-complete problems in polynomial time. In fact, the P versus NP problem remains open even in the context of quantum computing.
It is important to note that quantum computers are not a direct solution to the P versus NP problem. The impact of quantum computing on complexity theory is an active area of research, and it is yet to be fully understood how quantum computing will affect our understanding of computational complexity classes like NP and P.
To date, no demonstration has been made that shows NP = P using a quantum computing simulator or any other means. The P versus NP problem remains an open question, and resolving it would have profound implications for computational theory and practical applications in fields such as cryptography, optimization, and artificial intelligence.