22 citations · 22 across the 4 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2019
Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut
Sevag Gharibian, Ojas Parekh
Approximation algorithms for constraint satisfaction problems (CSPs) are a central direction of study in theoretical computer science. In this work, we study classical product stat…
quant-ph2016
Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis
Ojas Parekh, Jeremy Wendt, Luke Shulenburger +3
We lay the foundation for a benchmarking methodology for assessing current and future quantum computers. We pose and begin addressing fundamental questions about how to fairly comp…