Who needs qubits? Factoring algorithm run on a probabilistic computer It shares some features with quantum annealers, but it's easier to build and operate.

Is your algorithm deterministic, probabilistic or both? Can you measure the accuracy of the matching algorithm? What kind of accuracy can we expect?

"They're almost the same thing. Removing randomness from probabilistic algorithms, and proving hardness of computational problems are, sort-of, dual problems." ...

Richard M. Karp, Rajeev Motwani, Noam Nisan, Probabilistic Analysis of Network Flow Algorithms, Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 ...