Quantum computers can be simulated on classical computers with exponential slow down. So even if you think the human mind uses quantum computation, this doesn’t mean that the same thing can’t be done on a classical machine. Note also that BQP (the set of efficiently computable problems by a quantum computer) is believed (although not proven) to not contain any NP complete problems.
Note also that at a purely practical level, since quantum computers can do a lot of things better than classical computers and our certainty about their strength is much lower, trying to run an AI on a quantum computer is a really bad idea if you take the threat of AI going FOOM seriously.
So even if you think the human mind uses quantum computation, this doesn’t mean that the same thing can’t be done on a classical machine.
An exponential slowdown basically means that it can’t be done. If you have an oracle for EXPTIME then you’re basically already set for most problems you could want to solve.
So that is practically true, and in fact. EXPTIME is one of the few things we can show is large enough that we can even prove it properly contains P. But, in context this isn’t as bad as it looks. The vast majority of interesting things we can do on quantum computers take in practice much less than exponential time (look at factoring for example). In fact, BQP actually lives inside PSPACE, so this shouldn’t be that surprising.
But practical issues aside , most of the arguments about using quantum computers to do AI or consciousness involve claims that they are fundamentally necessary. The fact that we can simulate them with sufficient slow down demonstrates that at least that version of that thesis is false.
Quantum computers can be simulated on classical computers with exponential slow down. So even if you think the human mind uses quantum computation, this doesn’t mean that the same thing can’t be done on a classical machine. Note also that BQP (the set of efficiently computable problems by a quantum computer) is believed (although not proven) to not contain any NP complete problems.
Note also that at a purely practical level, since quantum computers can do a lot of things better than classical computers and our certainty about their strength is much lower, trying to run an AI on a quantum computer is a really bad idea if you take the threat of AI going FOOM seriously.
An exponential slowdown basically means that it can’t be done. If you have an oracle for EXPTIME then you’re basically already set for most problems you could want to solve.
So that is practically true, and in fact. EXPTIME is one of the few things we can show is large enough that we can even prove it properly contains P. But, in context this isn’t as bad as it looks. The vast majority of interesting things we can do on quantum computers take in practice much less than exponential time (look at factoring for example). In fact, BQP actually lives inside PSPACE, so this shouldn’t be that surprising.
But practical issues aside , most of the arguments about using quantum computers to do AI or consciousness involve claims that they are fundamentally necessary. The fact that we can simulate them with sufficient slow down demonstrates that at least that version of that thesis is false.