21 citations · 67 across the 19 of their papers we have counts for
25 papers
Classical Algorithms for Bipartite Quantum Max-Cut on Dense Expanders
Stuart Wayland, Zackary Jorquera, Alexandra Kolla
Quantum Max-Cut is a well-studied local Hamiltonian problem for which the classical complexity of the bipartite case remains open. We give a polynomial-time classical randomized al…
Monogamy of Entanglement Bounds and Improved Approximation Algorithms for Qudit Hamiltonians
Zackary Jorquera, Alexandra Kolla, Steven Kordonowy +2
We prove new monogamy of entanglement bounds for two-local qudit Hamiltonians of rank-one projectors without one-local terms. In particular, we certify the maximum energy in terms…
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…
Algorithms for the ferromagnetic Potts model on expanders
Charlie Carlson, Ewan Davies, Nicolas Fraiman +3
We give algorithms for approximating the partition function of the ferromagnetic -color Potts model on graphs of maximum degree . Our primary contribution is a fully polynomi…