47 citations · 137 across the 18 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.NE2022
Stochastic Neuromorphic Circuits for Solving MAXCUT
Bradley H. Theilman, Yipu Wang, Ojas D. Parekh +3
Finding the maximum cut of a graph (MAXCUT) is a classic optimization problem that has motivated parallel algorithm development. While approximate algorithms to MAXCUT offer attrac…
quant-ph2022★ 8 cited
An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
Ojas Parekh, Kevin Thompson
We resolve the approximability of the maximum energy of the Quantum Max Cut (QMC) problem using product states. A classical 0.498-approximation, using a basic semidefinite programm…
quant-ph2022
The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut
John Kallaugher, Ojas Parekh
We investigate the space complexity of two graph streaming problems: Max-Cut and its quantum analogue, Quantum Max-Cut. Previous work by Kapralov and Krachun [STOC `19] resolved th…