10
talks
2
posters
1
committee roles
0
leadership roles
2020–2026
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Constrained local Hamiltonians: quantum generalizations of classical problems | QIP 2025 | regular | Sankara Sai Chaithanya Rayudu, Kevin Thompson |
| Complexity Classification of Product State Problems for Local Hamiltonians | QIP 2024 | regular | ▸John Kallaugher, Kevin Thompson, Yipu Wang, Justin Yirka |
| Exponential Quantum Streaming Advantage for Maximum Directed Cut | QIP 2024 | regular | ▸John Kallaugher, Nadezhda Voronova |
| An improved Quantum Max Cut approximation via Maximum Matching | TQC 2024 | regular | Eunou Lee |
Finding a high (or low) energy state of a given quantum Hamiltonian is a potential area to gain a provable and practical quantum advantage. A line of recent studies focuses on Quantum Max Cut, where one is asked to find a high energy state of a given antiferromagnetic Heisenberg Hamiltonian. In this work, we present a classical approximation algorithm for Quantum Max Cut that achieves an approximation ratio of 0.595, outperforming the previous best algorithms of Lee (0.562, generic input graph) and King (0.582, triangle-free input graph). The algorithm is based on finding the maximum weighted matching of an input graph and outputs a product of at most 2-qubit states, which is simpler than the fully entangled output states of the previous best algorithms |
|||
| An SU(2)-symmetric Semidefinite Programming Hierarchy for Quantum Max Cut | TQC 2024 | regular | ▸Jun Takahashi, Chaithanya Rayudu, Cunlu Zhou, Robbie King, Kevin Thompson |
Understanding and approximating extremal energy states of local Hamiltonians is a central problem in quantum physics and complexity theory. Recent work has focused on developing approximation algorithms for local Hamiltonians, and in particular the ``Quantum Max Cut'' (QMaxCut) problem, which is closely related to the antiferromagnetic Heisenberg model. In this work, we introduce a family of semidefinite programming (SDP) relaxations based on the Navascues-Pironio-Acin (NPA) hierarchy which is tailored for QMaxCut by taking into account its SU(2) symmetry. We show that the hierarchy converges to the optimal QMaxCut value at a finite level, which is based on a characterization of the algebra of SWAP operators. We give several analytic proofs and computational results showing exactness/inexactness of our hierarchy at the lowest level on several important families of graphs. We also discuss relationships between SDP approaches for QMaxCut and frustration-freeness in condensed matter physics and numerically demonstrate that the SDP-solvability practically becomes an efficiently-computable generalization of frustration-freeness. Furthermore, by numerical demonstration we show the potential of SDP algorithms to perform as an approximate method to compute physical quantities and capture physical features of some Heisenberg-type statistical mechanics models even away from the frustration-free regions. |
|||
| The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut | QIP 2023 | regular | ▸John Kallaugher |
| Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality | QIP 2023 | regular | ▸Yeongwoo Hwang, Joe Neeman, Kevin Thompson, John Wright |
| Quantum Approximation Algorithms via the Level-2 Quantum Lasserre Hierarchy | QIP 2022 | regular | Kevin Thompson |
| Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell’s inequality | QIP 2022 | plenary_short | Yeongwoo Hwang, Joe Neeman, Kevin Thompson, John Wright |
| Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut | QIP 2020 | regular | Sevag Gharibian |
Posters
| Title | Conference | Co-authors |
|---|---|---|
| Second Order Cone Relaxations for Quantum Max Cut | QIP 2025 | Felix Huber, Kevin Thompson, Sevag Gharibian |
| Unifying (exponential) quantum streaming advantages with a simple sketch | QIP 2025 | John Kallaugher, Nadezhda Voronova |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QIP 2026 | PC | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Kevin Thompson | 7 |
| John Kallaugher | 4 |
| Joe Neeman | 2 |
| John Wright | 2 |
| Nadezhda Voronova | 2 |
| Sevag Gharibian | 2 |
| Yeongwoo Hwang | 2 |
| Chaithanya Rayudu | 1 |
| Cunlu Zhou | 1 |
| Eunou Lee | 1 |
| Felix Huber | 1 |
| Jun Takahashi | 1 |
| Justin Yirka | 1 |
| Robbie King | 1 |
| Sankara Sai Chaithanya Rayudu | 1 |
| Yipu Wang | 1 |