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
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
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.