Kevin Thompson

activity

20152026

most citedEfficiently Controllable Graphs

12 citations · 51 across the 10 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

quant-ph2021★ 3 cited

Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality

Yeongwoo Hwang, Joe Neeman, Ojas Parekh +2

The Gaussian noise stability of a function $f : R^{n} \to {- 1, 1}$ is the expected value of $f (x) \cdot f (y)$ over $ρ$ -correlated Gaussian random v…

quant-ph2021★ 6 cited

Application of the Level- $2$ Quantum Lasserre Hierarchy in Quantum Approximation Algorithms

Ojas Parekh, Kevin Thompson

The Lasserre Hierarchy is a set of semidefinite programs which yield increasingly tight bounds on optimal solutions to many NP-hard optimization problems. The hierarchy is paramete…

Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality

Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms

Application of the Level- $2$ Quantum Lasserre Hierarchy in Quantum Approximation Algorithms