activity
20162026
most citedComplexity Classification of Product State Problems for Local Hamiltonians

1 citations · 1 across the 9 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

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…