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]."
"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]."