Showing 2026Show all
2 papers · 1 filter
cs.DS2026
A Simple Algorithm for Best Separable State
Prashanti Anderson, Samuel B. Hopkins, Amit Rajaraman
We study the best separable state problem (BSS), which asks for the maximum acceptance probability of a quantum measurement over unentangled states. In classical terms, the goal is…
cs.DS2026
Entrywise Low-Rank Approximation and Matrix Norms via Global Correlation Rounding
Prashanti Anderson, Ainesh Bakshi, Samuel B. Hopkins
Given a matrix , the goal of the entrywise low-rank approximation problem is to find over all rank- matrices , where is t…