21 citations · 67 across the 19 of their papers we have counts for
3 papers · 1 filter
Approximation Algorithms for Quantum Max--Cut
Charlie Carlson, Zackary Jorquera, Alexandra Kolla +2
We initiate the algorithmic study of the Quantum Max--Cut problem, a quantum generalization of the well-known Max--Cut problem. The Quantum Max--Cut problem involves findi…
Approximately counting independent sets in dense bipartite graphs via subspace enumeration
Charlie Carlson, Ewan Davies, Alexandra Kolla +1
We give a randomized algorithm that approximates the number of independent sets in a dense, regular bipartite graph -- in the language of approximate counting, we give an FPRAS for…
A quantum advantage over classical for local max cut
Charlie Carlson, Zackary Jorquera, Alexandra Kolla +1
We compare the performance of a quantum local algorithm to a similar classical counterpart on a well-established combinatorial optimization problem LocalMaxCut. We show that a popu…