4 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…
Quantifying Gerrymandering With Simulated Annealing
Stuart Wayland
Gerrymandering is the perversion of an election based on manipulation of voting district boundaries, and has been a historically important yet difficult task to analytically prove.…