2 papers
quant-ph2026
Semidefinite extension complexity of the separable set, with applications to approximate disentanglers
Sevag Gharibian, Carsten Hecht, Dorian Rudolph
We prove quantitative lower bounds on the semidefinite extension complexity of the set of separable quantum states on . We consider semidefinite pr…
quant-ph2024
Hardness of approximation for ground state problems
Sevag Gharibian, Carsten Hecht
After nearly two decades of research, the question of a quantum PCP theorem for quantum Constraint Satisfaction Problems (CSPs) remains wide open. As a result, proving QMA-hardness…