2 ms·
> So even if there is a proof of P=NP with quantum computers That doesn't really even make sense as a sentence. A quantum computer is neither a Turing machine
by bawolff 5y ago
> So even if there is a proof of P=NP with quantum computers
That doesn't really even make sense as a sentence. A quantum computer is neither a Turing machine nor a non-deterministic Turing machine.
I guess what you're trying to say is that even if someone proved/disproved BQP=NP it would leave P=NP open.