activity
20062026
most citedHigh Throughput Data Center Topology Design

21 citations · 67 across the 19 of their papers we have counts for

collaborators
Showing quant-phShow all

5 papers · 1 filter

quant-ph2026

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…

quant-ph2024

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…

quant-ph2023

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…

quant-ph2023★ 1 cited

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…

quant-ph2006★ 1 cited

On parallel composition of zero-knowledge proofs with black-box quantum simulators

Rahul Jain, Alexandra Kolla, Gatis Midrijanis +1

Let L be a language decided by a constant-round quantum Arthur-Merlin (QAM) protocol with negligible soundness error and all but possibly the last message being classical. We prove…