616 citations
- Hewlett-Packard (United Kingdom)GB14 papers
- Bristol Laboratories (United Kingdom)GB13 papers
- Stanford UniversityUS12 papers
- University of California, Santa BarbaraUS12 papers
- Alfred P. Sloan FoundationUS7 papers
- University of California, BerkeleyUS7 papers
- Loughborough UniversityGB6 papers
- National Institute of InformaticsJP6 papers
- The University of MelbourneAU6 papers
- Lawrence Berkeley National LaboratoryUS5 papers
- The University of QueenslandAU5 papers
- Hewlett Packard Enterprise (United States)US4 papers
Showing 2025Show all
2 papers · 1 filter
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…
cs.ET2025★ 16 cited
Solving Boolean satisfiability problems with resistive content addressable memories
Giacomo Pedretti, Fabian Böhm, Tinish Bhattacharya +15
Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional…