Shuvro's "Pushing the boundary of quantum advantage in hard combinatorial optimization with probabilistic computers” is now out in Nature Communications

We show that probabilistic computers raise the bar of quantum advantage, changing the landscape of how we think about hard optimization. Using 3D spin glasses as a testbed, we benchmarked simulated quantum annealing and adaptive parallel tempering, showing that with the right co-design, classical probabilistic systems can reach, and sometimes surpass, the performance of specialized quantum devices. This work is part of an ongoing back-and-forth between probabilistic and quantum computing, each pushing the other to define what advantage really means. Congratulations to Shuvro Chowdhury who has worked tirelessly on this, as well as our diverse and brilliant collaborators Masoud Mohseni, Giovanni Finocchio, Tathagata Srimani, Luke Theogarajan, Massimo Chiappini, Federico Ricci-Tersenghi, Marek Rams, Johan Mentink, Aaron Lott and student contributors Atharva Raut, Eleonora Raimondo, Andrea Grimaldi and Navid Anjum Aadit.