> [...] quantum-inspired computing built on CMOS technology [...]

So at the heart of the solution is some FPGA that does something (close to?) quantum computing and that helps exploring exponential search space in somewhat feasible way? Is the gist that we might have stumbled upon a practical application of QC? And if so, what's the secret sauce if not lots of qbits? A new algorithm? Is it just hype?

Can someone that understands quantum computing please comment?

So this isn't quantum computing in the qubit sense, but instead a different computer architecture (demonstrated on an FPGA) that's based on Fowler–Nordheim (FN) quantum tunneling (a real physical effect, used in flash memory, but simulated here).

The paper says:

> The FN-dynamics may be realized either by a physical FN-tunneling device or via a digital emulation of the FN-tunneling dynamical systems. In this work, we employ the digital emulation to achieve the precision required for simulated annealing in the low-temperature regime.

In my opinion this result is quite neat, as it implies this will only get faster/better with "real" (read: analog) hardware.

This is not quantum computing - "quantum-inspired" could just as well be used to describe a process like simulated annealing. The problem they are solving here is a problem often used as a benchmark for quantum computing, but the approach is purely classical.

No it's just analogies. It's a normal FPGA.

This is not especially related to quantum computing. Neuromorphic computing uses an algorithm that tries to replicate how the brain works and then in this case implements it and runs it on an FPGA. There are quite a range of papers on this concept and multiple companies are doing just this to show their work. It is often used as it should theoretically avoid such a brute force approach.

> Can someone that understands quantum computing please comment?

...

Crickets

...

[flagged]