Non-deterministic Turing machines are computationally equivalent to deterministic ones. Quantum mechanics only causes issues with the practical feasibility of t

Non-deterministic Turing machines are computationally equivalent to deterministic ones. Quantum mechanics only causes issues with the practical feasibility of the computation, not its theoretical possibility given unbounded time and storage.