Yes and No. What experiments have essentially shown is that when can send information, in the form of quantum states FTL, but the communicated info is encrypted by Nature. From this point the sender must measure their states and send the resulting bit string to the reciever at light speed or less. Then this bit string is used to decode the teleported info; for one Qbit there are 4 possible encryptions, this grows exponentially base 2. So, it's pseudo-FTL. And the sent encrypted states can still be used kinda-like unknown variables, that are evaluated when they can be decrypted.
Yes, this is roughly what I was thinking when I read your original post. As you stated, "Quantum computers are more like Prob TM's [than NTM's]", this is what prompted my response. Now, in your reply, exists a contradiction with the original post, at least as worded, perhaps not as the thought. Moreover, in my reply, I alluded to the NTM to ProbTM aspects of Qcomp that you stated more explicitly in your reply. As for the BQP and BPP I can not comment about, since pure computer science is newer to me than mathematics and physics; i.e. I'm currently two out of three in the multidisciplinary math, physics, & compSci that is Qcomp.
In reality, since quantum wavefunctions follow all possible paths they behave as the nondeterministic Turing machines you describe. And since they have the probability interpretation, via the norm squared thanks to Born, they have a probabilistic Turing machine- like aspect as well. So, they are really neither of these things, but have aspects that throwback to previuously established concepts.
Slashdot Mirror
Yes and No. What experiments have essentially shown is that when can send information, in the form of quantum states FTL, but the communicated info is encrypted by Nature. From this point the sender must measure their states and send the resulting bit string to the reciever at light speed or less. Then this bit string is used to decode the teleported info; for one Qbit there are 4 possible encryptions, this grows exponentially base 2. So, it's pseudo-FTL. And the sent encrypted states can still be used kinda-like unknown variables, that are evaluated when they can be decrypted.
later,
Yes, this is roughly what I was thinking when I read your original post. As you stated, "Quantum computers are more like Prob TM's [than NTM's]", this is what prompted my response. Now, in your reply, exists a contradiction with the original post, at least as worded, perhaps not as the thought. Moreover, in my reply, I alluded to the NTM to ProbTM aspects of Qcomp that you stated more explicitly in your reply. As for the BQP and BPP I can not comment about, since pure computer science is newer to me than mathematics and physics; i.e. I'm currently two out of three in the multidisciplinary math, physics, & compSci that is Qcomp.
In reality, since quantum wavefunctions follow all possible paths they behave as the nondeterministic Turing machines you describe. And since they have the probability interpretation, via the norm squared thanks to Born, they have a probabilistic Turing machine- like aspect as well. So, they are really neither of these things, but have aspects that throwback to previuously established concepts.