Author

Georgios Karaiskos

1 paper 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

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