Skip to content

Author

D. Rudolph

3 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

A physical and universal model of bosonic computations with Solovay-Kitaev theorem

Bosonic quantum systems are among the leading architectures for quantum information processing, offering continuous-variable degrees of freedom with strong error-correction capabilities. However, standard bosonic quantum computation models such as the Lloyd-Braunstein [Lloyd and Braunstein, 1999] and hybrid oscillator-...

D. Rudolph, Arsalan Motamedi, Dhruva Sambrani et al. · 0 citations
Preprint Sep 2026

Verification Complexity and Extension of Classical Shadows

This work shows CSV is efficiently solvable for permutation-invariant shadows, QMA-hard for real, fermionic, and bosonic shadows, and both coNP-hard and QMA-hard when the observable family consists of all $n-qubit Pauli strings.

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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.