Live data from Hacker News

The Case Against Quantum Computing

spectrum.ieee.org

21–30 of 89 posts

Re: The Case Against Quantum Computing

#21
post #13
post #7

Earlier quoted context omitted.

With one major difference. We know that fusion in some form is possible (for example, in the sun, or in a hydrogen-bomb). The difficulty is doing it at a reasonable scale. It's less clear that quantum computing is possible.

I mean we already have quantum computers too. https://quantumexperience.ng.bluemix.net/qx/experience The trouble here is also scaling, but in the upward direction.

You might say that's the case with Fusion as well :)

Re: The Case Against Quantum Computing

#22

I still need to gain the intuition for why a quantum computer can operate on some kinds of things "faster". I've read some of the math, but that did little to satisfy me (I need to study it more clearly). But all of this seems in a tragic state at the moment. Allowing rampant misinformation and hype as to what these machines are actually capable of.

I'm going to butcher a lot of the physics here, but here's the gist of it that should avoid some quantum myths: The quantum state of a system is not described by a simple real probability but by a complex number. This means that there is an additional degree of freedom that you can adjust in a quantum state that doesn't change its probability of occurring. The nature of entanglement means that there is constructive a…

> This means that there is an additional degree of freedom that you can adjust in a quantum state that doesn't change its probability of occurring.

This gave me a real 'aha' moment - I've been trying to get an intuition for complex numbers for years, thanks.

Re: The Case Against Quantum Computing

#23

Earlier quoted context omitted.

I'm going to butcher a lot of the physics here, but here's the gist of it that should avoid some quantum myths: The quantum state of a system is not described by a simple real probability but by a complex number. This means that there is an additional degree of freedom that you can adjust in a quantum state that doesn't change its probability of occurring. The nature of entanglement means that there is constructive a…

OK, yes. This builds on the parts of my intuition that already exist. It's about building a system (from combinations of quantum operators) that maximizes the probability distribution of the result you want. I'm still unsure of the timeline of any quantum operator, and the "finding the interference" seems equivalent to saying something like "find the function" or something more classical.

Yes I would really like to understand if this is different than curve fitting. How isn't that classical ? What about causality ? Quantum mechanics to me are just an effective model for dealing with uncertainty AKA probabilistic/meta probabilistic reasoning. But it is about statistically predicting the state of a particle/particles (position, spin, mass, momentum, etc). How can this model uncertainety in algorithms is something I don't understand at all. My brain is very tempted to claim that quantum computing is bullshit and that is what it seems to a layman like me because i've never read a great explanation. Even if quantum computing worked it would be soft computing ? By having a set of probabilities as results, that would be an approximation thus effectively allowing to be less than exponential for np hard and less correct. How does that differ from classical heuristics algorithms that already have massive Speed like SAT solvers ?

Re: The Case Against Quantum Computing

#24

Earlier quoted context omitted.

If you are specifically interested in building up the mathematical intuition, check out "Quantum Computing since Democritus" by Aaronson - it excels at presenting the intuition. For less comp-sci and more physics look at the standard references: Nielsen and Chuang's book and Preskill's lecture notes.

Thanks for the links. I'll start here: http://www.theory.caltech.edu/%7Epreskill/ph219/index.html#l... and probably get the books too (hey, they're cheap on amazon... god I hate myself).

The Aaronson book is mostly available on his academic website as lecture notes.

Re: The Case Against Quantum Computing

#25

Earlier quoted context omitted.

I'm going to butcher a lot of the physics here, but here's the gist of it that should avoid some quantum myths: The quantum state of a system is not described by a simple real probability but by a complex number. This means that there is an additional degree of freedom that you can adjust in a quantum state that doesn't change its probability of occurring. The nature of entanglement means that there is constructive a…

OK, yes. This builds on the parts of my intuition that already exist. It's about building a system (from combinations of quantum operators) that maximizes the probability distribution of the result you want. I'm still unsure of the timeline of any quantum operator, and the "finding the interference" seems equivalent to saying something like "find the function" or something more classical.

With Shor's algorithm, the quantum part of the algorithm comes down to finding the period of 'a mod N' where N is the prime number you have, and a is a number less than N that is not a factor of N. Here, the period is the smallest value of x where 'a^x mod N = 1'.

This is done applying the Quantum Fourier Tranform on each 'a^x mod N' using x+1 complex roots of unity for that value of x. You can visualise this as x+1 arrows from the centre of a unit circle with an angle 2pi/(x+1). So, for x=3 you have 4 arrows pointing up, down, left, and right.

When you stack the arrows end to end, they will loop back to their starting point (3 will form a triangle, 4 a square, etc.). The key is that when multiplting this quantum fourier transform with the value of 'a^x mod N', the 1s (at the period) will occur at the same point around the unit circle only for the cases where the number of complex roots is a multiple of the period.

This has the effect that for the correct answer, the arrows are lined up together in a single direction, amplifying the number and thus the probability of selecting that number. For the others, the arrows cycle and loop back on each other, so stay fairly small, decreasing the probability they will be selected.

Re: The Case Against Quantum Computing

#27

I still need to gain the intuition for why a quantum computer can operate on some kinds of things "faster". I've read some of the math, but that did little to satisfy me (I need to study it more clearly). But all of this seems in a tragic state at the moment. Allowing rampant misinformation and hype as to what these machines are actually capable of.

Scott's book referenced is very good, but you might also want to see if his layman's blog explanation of Shor's Algorithm is useful to you: https://www.scottaaronson.com/blog/?p=208

Re: The Case Against Quantum Computing

#28
post #4
post #2

Had to read to the bottom to get to the (really weak) "case against Quantum Computing": > I believe that, appearances to the contrary, the quantum computing fervor is nearing its end. That’s because a few decades is the maximum lifetime of any big bubble in technology or science. After a certain period, too many unfulfilled promises have been made, and anyone who has been following the topic starts to get annoyed by…

Sounds like Fusion. That’s still going on after 60 odd years.

We know that fusion is possible. We have H-bombs. We have various things that do small scale fusion. Getting out more power than is put in remains way out of reach.

Re: The Case Against Quantum Computing

#29
post #13

Earlier quoted context omitted.

I mean we already have quantum computers too. https://quantumexperience.ng.bluemix.net/qx/experience The trouble here is also scaling, but in the upward direction.

The "quantum computers" we have are classical computers with very weird hardware. The thing everybody is trying to achieve is quantum supremacy - this hasn't been achieved or demonstrated yet, and might never will be.

For at least a very, very long time, I see Quantum Computers as simply being "accelerators" that do very niche tasks. Like GPUs or FPGAs today. I'm sure one day we'll have a whole other paradigm, but I doubt Quantum Computing as we envision it today will be the thing that replaces x86-compatible silicon.

Re: The Case Against Quantum Computing

#30
post #13

Earlier quoted context omitted.

I mean we already have quantum computers too. https://quantumexperience.ng.bluemix.net/qx/experience The trouble here is also scaling, but in the upward direction.

The "quantum computers" we have are classical computers with very weird hardware. The thing everybody is trying to achieve is quantum supremacy - this hasn't been achieved or demonstrated yet, and might never will be.

They are not classical computers. We've had actual quantum logic gates since 1995. https://en.wikipedia.org/wiki/Timeline_of_quantum_computing And as linked above, IBM is renting out time on real quantum computers up to 17 qubits now. Intel, Google, and IBM had all announced plans for 49 or 50 qubit computers, which would have achieved quantum supremacy at the time, but IBM improved their simulator to 56 qubits last year. https://en.wikipedia.org/wiki/Quantum_supremacy So we're only one or two hardware generations away now.
Post reply on HN