20 citations · 32 across the 14 of their papers we have counts for
4 papers · 2 filters
On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian Complexity
Sabee Grewal, Dorian Rudolph
We prove several new results concerning the pure quantum polynomial hierarchy (pureQPH). First, we show that QMA(2) is contained in pureQSigma2, that is, two unentangled existentia…
Efficient Learning of Structured Quantum Circuits via Pauli Dimensionality and Sparsity
Sabee Grewal, Daniel Liang
We study the problem of efficiently learning an unknown -qubit unitary channel in diamond distance given query access. We present a general framework showing that if Pauli opera…
Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs
Sabee Grewal, William Kretschmer
We investigate two resources whose effects on quantum interactive proofs remain poorly understood: the promise of unentanglement, and the verifier's ability to condition on an inte…
Demonstrating an unconditional separation between quantum and classical information resources
William Kretschmer, Sabee Grewal, Matthew DeCross +8
A longstanding goal in quantum information science is to demonstrate quantum computations that cannot be feasibly reproduced on a classical computer. Such demonstrations mark major…