Author

D. Rudolph

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Verification Complexity and Extension of Classical Shadows

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

Preprint Sep 2026

Semidefinite extension complexity of the separable set, with applications to approximate disentanglers

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