Aidan Epperly
YOU?
Author Swipe
View article: Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators
Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators Open
The Quantum Max Cut (QMC) problem has emerged as a test-problem for designing approximation algorithms for local Hamiltonian problems. In this paper we attack this problem using the algebraic structure of QMC, in particular the relationshi…
View article: Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators
Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators Open
The Quantum Max Cut (QMC) problem has emerged as a test-problem for designing approximation algorithms for local Hamiltonian problems. In this paper we attack this problem using the algebraic structure of QMC, in particular the relationshi…
View article: Matrix Extreme Points and Free extreme points of Free spectrahedra
Matrix Extreme Points and Free extreme points of Free spectrahedra Open
A spectrahedron is a convex set defined by a linear matrix inequality, i.e., the set of all $x \in \mathbb{R}^g$ such that \[ L_A(x) = I + A_1 x_1 + A_2 x_2 + \dots + A_g x_g \succeq 0 \] for some symmetric matrices $A_1,\ldots,A_g$. This …