Classical shadows are an influential framework for compressing copies of a given quantum state $\rho$ into classical data $S$, enabling many properties of $\rho$ to be predicted from relatively few copies. In this work, we study two natural questions involving shadows: (1) Given $S$, when can one efficiently verify tha...
Georgios Karaiskos, Asad Raza, D. Rudolph et al.· 0 citations
Low-energy estimation and state preparation for general $k$-local Hamiltonians are fundamental challenges in quantum complexity theory. Buhrman et al.~ [BGLGST, PRL 2025] recently broke the natural Grover bound $O^\ast(2^{n/2})$ for both problems, with the improvement depending on the relative accuracy $\varepsilon$ an...
Sevag Gharibian, François Le Gall, Ranitha Mataraarachchi et al.· 0 citations
We prove quantitative lower bounds on the semidefinite extension complexity of the set of separable quantum states on $\mathbb{C}^d\otimes\mathbb{C}^d$. We consider semidefinite programs (SDPs) that approximate the maximum acceptance probability of a measurement over separable states, the optimization problem underlyin...
Sevag Gharibian, Carsten Hecht, D. Rudolph· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.