P-computers can solve spin-glass problems faster than quantum systems

I'm having a hard time understanding this article.

First of all, a quantum annealer is not a universal quantum computer, just to elucidate the title.

Then, it seems like they are comparing a simulation of p-computers to a physical realization of a quantum annealer (likely D-wave, but not named outright for some reason). If this is true, it doesn't seem like a very relevant comparison, because D-wave systems actually exist, while their p-computer sounds like it is just a design. But I may have misunderstood, because at times they make it sound like the p-computer actually exists.

Also, they talk about how p-computers can be scaled up with TSMC semiconductor technology. From what I know, this is also true for semiconductor-based (universal) quantum computers.

The communication here is clear as mud. WHICH quantum systems? D-Wave? We know D-Wave is a joke!

Good sign that Extropic may be on the right path here

They misspelled "analog".

P is stored in the computer

> We used millions of p-bits

I'm not sure how this compares to quantum with its dozens to hundreds of qubits

Very interesting article.

This makes me wonder: Would it be possible to implement an equivalent to Shor's algorithm on a p-computer. Maybe the quantumness isn't necessary at all

I'm confused. Do p-computers have any complexity theoretic advantage over classical computers, similar to how quantum computers have such an advantage in some areas? Or are they just normal computers in the end?