Earlier quoted context omitted.
The main issue I had with their demonstrations were that the problems they chose were essentially "let's show that a quantum computer is better at being a quantum computer than a classical computer". Obviously they are, just like I'm better at being a human than ChatGPT is. I'm not saying they suck, but to proclaim that "quantum computers are superior" you need an actual use-case, IMO.
It's absolutely non-obvious, I'm dead serious. As far as I've understood keeping up over the years, there's a credible argument from a respected academic in the QC community that quantum computing is impossible.
Google claims to have proved its supremacy with new quantum computer
141–150 of 237 posts
Re: Google claims to have proved its supremacy with new quantum computer
#142Earlier quoted context omitted.
Did you really get the answer faster than a computer?or put another way, what question did you answer? How much force was applied to the stick before it broke? How fast was the stick moving 0.04s after breakage? How much sound was produced? There are thousands of questions you don’t have answers to when you simply break a stick.
I think that was his exact argument against quantum computing.
Re: Google claims to have proved its supremacy with new quantum computer
#143... Until the day that it does.
And then, a lot of very interesting things will happen very quickly, and the world will change massively.
Re: Google claims to have proved its supremacy with new quantum computer
#144Earlier quoted context omitted.
It's absolutely non-obvious, I'm dead serious. As far as I've understood keeping up over the years, there's a credible argument from a respected academic in the QC community that quantum computing is impossible.
Do you have a link handy? You've piqued my curiosity!
I would have picked it up in bits and pieces from blogs over years, here's an attempt to render that useful that is surely nitpickable:
TL;DR: there's two types of caring about Google's claims of quantum supremacy:
1. HN tends to assume these articles are about breakthrough in _product usefulness_ and then tsk tsk about lack of impact. c.f. top comment currently gravely noting after reading the paper, its too noisy and a long way off.
2. The papers are about demonstrating _there is quantum computing at all_, the interest in the people in the know is about settling that question, the raw strongman feat isn't particularly interesting.
Re: Google claims to have proved its supremacy with new quantum computer
#145Earlier quoted context omitted.
My understanding is that quantum computers only have two real use cases, as of today: 1. Breaking crypto. 2. Simulating other quantum systems. For (1) it's basically all downsides. For (2) unless you're a particle phycisist you'll never need quantum computers. But that's now. Maybe there will be a killer app for it some day, changing everything. Or indeed, we could get it indirectly. Maybe simulating quantum systems…
(2) can be very relevant to material science and chemistry. Those things have huge ranges of important practical applications. For example, people currently struggle to do accurate calculations of the band structures of materials and it doesn't look like there will be much progress there using only classical computers (using more computing power or better approximation tricks). Big enough quantum computers could do t…
Simulating physical systems better, faster, and more completely, can have many practical applications.
But unless you're already today trying to simulate physical systems like that, then QC probably won't help you one bit.
Re: Google claims to have proved its supremacy with new quantum computer
#146Earlier quoted context omitted.
Not a dumb question! There is a great video by the mathematician Richard Borcherds on this exact objection to current examples of quantum supremacy. https://www.youtube.com/watch?v=sFhhQRxWTIM
I love this video, thanks for sharing it. I'm watching it right now and I think I'm going to refer to his "teapot supremacy" from now on.
https://scottaaronson.blog/?p=5460
He actually goes into significant details about your exact question and proposes some resolutions. It's quite long and I don't think I can do it justice in a TLDR so leaving the link to speak for itself.
Re: Google claims to have proved its supremacy with new quantum computer
#147Earlier quoted context omitted.
I love this video, thanks for sharing it. I'm watching it right now and I think I'm going to refer to his "teapot supremacy" from now on.
There is also an interesting response to that video from a leading quantum computer scientist, Scott Aaronson: https://scottaaronson.blog/?p=5460 He actually goes into significant details about your exact question and proposes some resolutions. It's quite long and I don't think I can do it justice in a TLDR so leaving the link to speak for itself.
Edit: I just read it and I don't feel like he really answered the question. He had a rebuttal about being able to freely specify parameters, but then his Facebook friend addressed his rebuttal, to which he replies "this is indeed more interesting"... which, well, it certainly is, and also doesn't answer the question!
(Well, I guess he also mentions we should expect speedup greater than Avogadro's number, which seems fair, but clearly that's not the bar anyone is claiming to meet, so it doesn't get us anywhere.)
Re: Google claims to have proved its supremacy with new quantum computer
#148Earlier quoted context omitted.
My understanding is that quantum computers only have two real use cases, as of today: 1. Breaking crypto. 2. Simulating other quantum systems. For (1) it's basically all downsides. For (2) unless you're a particle phycisist you'll never need quantum computers. But that's now. Maybe there will be a killer app for it some day, changing everything. Or indeed, we could get it indirectly. Maybe simulating quantum systems…
Basically, quantum computers can solve problems of the BQP class in a time that is a polynomial function of input size. These same problems, on a traditional computer, can take exponential time. It is hard to tell with certainty what can be done with quantum computers, but having powerful quantum computers will certainly open new fields of research, like trying to figure out if quantum algorithms for NP-class problem…
What you said was the optimist view, that there's a world of possibilities. It's just that at the moment we just have the two I mentioned.
Maybe there's much more, and if we build it (the hardware), they (the algorithms) will come.
But for now really just the two. AFAIK.
Re: Google claims to have proved its supremacy with new quantum computer
#149Earlier quoted context omitted.
I don’t think you guys are tackling this right. You can observe the stick breaking to absurd precision, even using an electron tunneling microscope, and produce immense amounts of data about the sticks state at every point in the breaking and afterwards faster than a computer can simulate breaking the stick. The key is the stick breaking and it’s observation at any level of detail happens in parallel with all aspects…
But the comparison is not fair. Yes the electron microscope can image a lot of details "in parallel" but not all details from all angles, all internal microfractures. You can't easily measure all temperature gradients in all cubic nanometers of the material etc etc. The simulation is slow because it works at that level and thus as a side effect will also give you that output. Obviously if you don't need all that info…