27 citations · 45 across the 4 of their papers we have counts for
4 papers
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…
Ising Model Partition Function Computation as a Weighted Counting Problem
Shaan A. Nagy, Roger Paredes, Jeffrey M. Dudek +2
While the Ising model remains essential to understand physical phenomena, its natural connection to combinatorial reasoning makes it also one of the best models to probe complex sy…
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…
Principled Network Reliability Approximation: A Counting-Based Approach
R. Paredes, L. Duenas-Osorio, K. S. Meel +1
As engineered systems expand, become more interdependent, and operate in real-time, reliability assessment is indispensable to support investment and decision making. However, netw…