activity
20212026
most citedQuantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement

2 citations · 3 across the 8 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.CC2021

On polynomially many queries to NP or QMA oracles

Sevag Gharibian, Dorian Rudolph

We study the complexity of problems solvable in deterministic polynomial time with access to an NP or Quantum Merlin-Arthur (QMA)-oracle, such as and , respective…