Quantum computing presents unique advantages and limitations compared to classical computing. While it offers significant speed improvements for specific problem types, it does not universally outperform classical algorithms. The concept of quantum superposition, where a qubit can represent multiple states, is often misunderstood; it does not imply simultaneous processing of all values. Experts like Scott Aaronson provide valuable insights into the complexities of quantum computing.
PREREQUISITESResearchers, computer scientists, and technology enthusiasts interested in the advancements and challenges of quantum computing.
The prospects of quantum computing seem to be very limited. There are some types of problems for which it is very much faster than regular computers and many more for which it is likely slower.ChrisisC said:With the development of quantum computing, just how much could it improve our lives. Obviously faster computing, but could we begin to do things than conventional computer can't?
phinds said:The prospects of quantum computing seem to be very limited. There are some types of problems for which it is very much faster than regular computers and many more for which it is likely slower.
It is NOT in general "faster computing" for all algorithms.
I don't know enough to answer that but it's more complicated than you think. There are numerous threads here on PF about quantum computing. I suggest a forum search. As always, a good place to start is with the links at the bottom of the thread.ChrisisC said:If a qubit is both 1 and 2 at the same time, how would this not result in generally faster computing?
phinds said:I don't know enough to answer that but it's more complicated than you think. There are numerous threads here on PF about quantum computing. I suggest a forum search. As always, a good place to start is with the links at the bottom of the thread.
ChrisisC said:If a qubit is both 1 and 2 at the same time
PeterDonis said:It isn't.
ChrisisC said:0 and 1 is what i meant to say