1 citations · 1 across the 2 of their papers we have counts for
4 papers
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…
Quantum k-SAT Related Hypergraph Problems
Simon-Luca Kremer, Dorian Rudolph, Sevag Gharibian
The Quantum k-SAT problem is the quantum generalization of the k-SAT problem. It is the problem whether a given local Hamiltonian is frustration-free. Frustration-free means that t…
An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem
Marco Aldi, Sevag Gharibian, Dorian Rudolph
The theory of Total Function NP (TFNP) and its subclasses says that, even if one is promised an efficiently verifiable proof exists for a problem, finding this proof can be intract…