Блог пользователя bobowajak

A question to Mike
Автор bobowajak, история, 5 лет назад, По-английски

Hey Mike,

First of all, I hope you're doing well :)

It's almost very clear that Google has achieved quantum supermacy (https://www.youtube.com/watch?v=-ZNEzzDcllU).

So, do we still have to write polynomial codes or you'll be installing such quantum computers for judging solutions?

Thanks!

  • Проголосовать: нравится
  • -30
  • Проголосовать: не нравится

»
5 лет назад, # |
  Проголосовать: нравится +46 Проголосовать: не нравится

Well, it is not the question of performance, I guess, you just always want to come up with the fastest algorithm possible. When it is not polynomial, you see constraints like $$$N \le 20$$$.

P.S. I wish Google rather made Chrome not eat entire memory of my PC.

→ Ответить
»
5 лет назад, # |
  Проголосовать: нравится +13 Проголосовать: не нравится

It is a great technological achievement, but it isn't as much of a breakthrough as it is hyped.

Quantum supremacy has been achieved quite a long time ago. The new thing here is putting this into a programmable chip. But the programmability is still far from what we would need to call it a quantum computer.

Quantum computer does not exist yet, and it will take a long time before one is created.

→ Ответить