27 citations · 53 across the 6 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2024★ 12 cited
Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering
Zewen Zhang, Roger Paredes, Bhuvanesh Sundar +5
The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it ha…
quant-ph2019★ 5 cited
A quantum algorithm to count weighted ground states of classical spin Hamiltonians
Bhuvanesh Sundar, Roger Paredes, David T. Damanik +2
Ground state counting plays an important role in several applications in science and engineering, from estimating residual entropy in physical systems, to bounding engineering reli…