251 citations · 802 across the 40 of their papers we have counts for
40 papers · 1 filter
A physical and universal model of bosonic computations with Solovay-Kitaev theorem
Dorian Rudolph, Arsalan Motamedi, Dhruva Sambrani +4
Bosonic quantum systems are among the leading architectures for quantum information processing, offering continuous-variable degrees of freedom with strong error-correction capabil…
Verification Complexity and Extension of Classical Shadows
Georgios Karaiskos, Asad Raza, Dorian Rudolph +2
Classical shadows are an influential framework for compressing copies of a given quantum state into classical data , enabling many properties of to be predicted from rel…
Near-Optimal Bounds on the Density of Low-Energy States of -Local Hamiltonians and Faster Quantum Algorithms
Sevag Gharibian, François Le Gall, Ranitha Mataraarachchi +1
Low-energy estimation and state preparation for general -local Hamiltonians are fundamental challenges in quantum complexity theory. Buhrman et al.~ [BGLGST, PRL 2025] recently…
Semidefinite extension complexity of the separable set, with applications to approximate disentanglers
Sevag Gharibian, Carsten Hecht, Dorian Rudolph
We prove quantitative lower bounds on the semidefinite extension complexity of the set of separable quantum states on . We consider semidefinite pr…
Energy, Bosons and Computational Complexity
Dorian Rudolph, Arsalan Motamedi, Dhruva Sambrani +4
We investigate the role of energy, i.e. average photon number, as a resource in the computational complexity of bosonic systems. We show three sets of results: (1. Energy growth ra…
How hard is it to verify a classical shadow?
Georgios Karaiskos, Dorian Rudolph, Johannes Jakob Meyer +2
Classical shadows are succinct classical representations of quantum states which allow one to encode a set of properties P of a quantum state rho, while only requiring measurements…