Google quantum supremacy paper

[FrediFizzx]

***
Some people want to ban words like "supremacy" from science: https://www.quantumresponsibility.org/openletter.

***

Hmm... most all the USA signatories are Microsoft.
.

[Joy Christian]

***
Classical photons challenge quantum supremacy: https://www.inverse.com/innovation/phot ... study-says.

***

[Jarek]

Quantum computers rely on assumption of Feynman path ensemble, which is analogues (Wick-rotation) to Boltzmann sequence ensemble in classical Ising model ... which if true, allows for even stronger computers (e.g. breaking all cryptography not just RSA) to be realized with classical Ising (end of https://arxiv.org/pdf/1912.13300 ):

[Jarek]

***
Classical photons challenge quantum supremacy: https://www.inverse.com/innovation/phot ... study-says.
***

I see they attack subset sum problem for small numbers - what can be also done quickly classically by dynamic programming.
Subset-sum problem becomes NP-complete only when operating on large numbers - like made of thousands of digits, such solver needs to have implemented large number arithmetic.

Generally subset-sum problem is a great argument against adiabatic quantum computers.
They search global minimum of function having exponential number of local minima - and defend that finding a close local minimum is also satisfying.
Subset-sum problem shows that the spectral gap drops exponentially, in any neighborhood of global minimum there is exponentially growing space of local minima ... and that local minima are completely not helpful for finding the solution: global minimum.