News for hackers. Stuff that matters.
Re:Quantum supremacy, now with BosonSampling by littlestymaar on Friday December 04, 2020 @08:52AM (#25302191)
I's really a bigger feat than what google achieved last year[1] and yet almost nobody will hear about it because google took all the hype. It's a pretty sad story actually.

[1]: the google achievement was designing a specific problem for which their quantum computer could perform better than classical computers. Now, this is a solution to a preexisting problem. Not to say that Google's result wasn't important, but this one is “one rank” higher.

Re:Quantum supremacy, now with BosonSampling by rsln-s on Friday December 04, 2020 @09:07AM (#25302325)
Not necessarily true. Google's result used a programmable universal quantum computer for a specific task; the point of the experiment was not just to show that it can do this specific convoluted task faster than classical supercomputers, but also to show how powerful the quantum computer they've built is and how well they can control it. What they then did is go on a publish a dozen papers of running many other algorithms on it (of course, for those algorithms the quantum computer is not yet powerful enough to show advantage).

On the other hand, the device used in this experiment is a single-purpose non-universal sampler with very limited applications.

Re:Quantum supremacy, now with BosonSampling by littlestymaar on Friday December 04, 2020 @09:14AM (#25302382)
Yeah, google's computer is “more interesting” but wasn't able to outperform a classical computer on any known problem (hence not “quantum supreme”). Then they managed to design a problem, highly specific to their computer's design, that would be too hard to solve on a classical computer (hence “«quantum supreme»”).

On the scale :

0. Computer solves a specifically crafted problem < 1. computer solves one preexisting problem < 2. computer solves several existing problems < 3. computer solves all theoretically solvable problems.

Google's result is at 0, while this is a 1.

(By solve/theoretically solvable I mean: solve faster than a classical computer, and should be solvable faster with quantum than classical)

Re:Quantum supremacy, now with BosonSampling by Aardwolf on Friday December 04, 2020 @08:57AM (#25302232)
We hear about it here now, and it's a more recent achievement so of course it's bigger, it wouldn't be an achievement if it was smaller than the state of the art of a year ago
Re:Quantum supremacy, now with BosonSampling by littlestymaar on Friday December 04, 2020 @09:08AM (#25302332)
It's not just bigger, it's an order of magnitude bigger.

Actually, some people weren't totally convinced that Google's result really deserved the “quantum supremacy” label. Sure, the guys at IBM[1] were a bit bitter, but their argument make sense (and they weren't alone on that).

This result unambiguously deserve such qualification: this the kind of results everybody expected to be called “Quantum supremacy”, so that's a bit sad that they won't get as much credit as google's team.

[1]: https://www.ibm.com/blogs/research/2019/10/on-quantum-suprem...