[supernetworks]

A direct equivalent, no, as stated in the introduction.

"Notably, while probabilistic computers can emulate quantum interference with polynomial resources, their convergence is in general believed to require exponential time [10]. This challenge is known as the signproblem in Monte Carlo algorithms [11]."

[aleph_minus_one]

> A direct equivalent, no, as stated in the introduction

... of https://www.nature.com/articles/s41467-025-64235-y

[supernetworks]

yes, this paper is the main subject of the article

[aleph_minus_one]

The article links two papers (text: "Two recent papers underscore that potential."):

- https://www.nature.com/articles/s41928-025-01439-6 (link text: "In one study")

- https://www.nature.com/articles/s41467-025-64235-y (link text: "In the most recent paper")

[supernetworks]

yes understood, the first article isn't the main subject of the article.