Pondering the implications of quantum computing on classical computational complexity problems, I have reached a hypothesis. If quantum supremacy is indeed a reality, then we can postulate a multiverse wherein P=NP holds true. Taking into account the phenomenon of quantum entanglement, could it be that non-deterministic polynomial problems are in …