> Quantum Computers are no more powerful than Turing Machines
They are more powerful in the sense that P-time for quantum computers (aka BQP) is hypothesized to be larger than P-time for Turing machines. That is different from every classical model of computation (RAM machines, etc.) that we usually talk about. It's hard to call something a cellular automaton if it has to expand exponentially in size as it evolves. Thus, 't Hooft concretely predicts that if his CA model is right, then quantum computers can't work. Idk whether Wolfram addresses this issue.
They are more powerful in the sense that P-time for quantum computers (aka BQP) is hypothesized to be larger than P-time for Turing machines. That is different from every classical model of computation (RAM machines, etc.) that we usually talk about. It's hard to call something a cellular automaton if it has to expand exponentially in size as it evolves. Thus, 't Hooft concretely predicts that if his CA model is right, then quantum computers can't work. Idk whether Wolfram addresses this issue.