NP (nondeterministic polynomial time)
QuantumNP (nondeterministic polynomial time): The class of problems whose answers are easy to check, widely misreported as the target of quantum computing though no general speedup is known.
NP (nondeterministic polynomial time): The class of problems whose answers are easy to check, widely misreported as the target of quantum computing though no general speedup is known.