most citedPushing the Boundary of Quantum Advantage in Hard Combinatorial Optimization with Probabilistic Computers

9 citations · 21 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2025★ 9 cited

Pushing the Boundary of Quantum Advantage in Hard Combinatorial Optimization with Probabilistic Computers

Shuvro Chowdhury, Navid Anjum Aadit, Andrea Grimaldi +12

Recent demonstrations on specialized benchmarks have reignited excitement for quantum computers, yet whether they can deliver an advantage for practical real-world problems remains…

quant-ph2024★ 7 cited

How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

Masoud Mohseni, Artur Scherer, K. Grace Johnson +48

In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become po…

cs.DC2024

Next-generation Probabilistic Computing Hardware with 3D MOSAICs, Illusion Scale-up, and Co-design

Tathagata Srimani, Robert Radway, Masoud Mohseni +2

The vast majority of 21st century AI workloads are based on gradient-based deterministic algorithms such as backpropagation. One of the key reasons for the dominance of determinist…

cs.ET2024★ 3 cited

Parallel Tempering-Inspired Distributed Binary Optimization with In-Memory Computing

Xiangyi Zhang, Fabian Böhm, Elisabetta Valiante +7

In-memory computing (IMC) has been shown to be a promising approach for solving binary optimization problems while significantly reducing energy and latency. Building on the advant…

cs.AI2024★ 2 cited

Combinatorial Reasoning: Selecting Reasons in Generative AI Pipelines via Combinatorial Optimization

Mert Esencan, Tarun Advaith Kumar, Ata Akbari Asanjan +5

Recent Large Language Models (LLMs) have demonstrated impressive capabilities at tasks that require human intelligence and are a significant step towards human-like artificial inte…