63 citations · 217 across the 21 of their papers we have counts for
21 papers
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…
Pseudoentanglement Ain't Cheap
Sabee Grewal, Vishnu Iyer, William Kretschmer +1
We show that any pseudoentangled state ensemble with a gap of bits of entropy requires non-Clifford gates to prepare. This bound is tight up to polylogarithmic factors i…
Agnostic Tomography of Stabilizer Product States
Sabee Grewal, Vishnu Iyer, William Kretschmer +1
We define a quantum learning task called agnostic tomography, where given copies of an arbitrary state and a class of quantum states , the goal is to output a succ…
Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates II: Single-Copy Measurements
Sabee Grewal, Vishnu Iyer, William Kretschmer +1
Recent work has shown that -qubit quantum states output by circuits with at most single-qubit non-Clifford gates can be learned to trace distance using $\mathsf{poly}(n,…
Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates
Sabee Grewal, Vishnu Iyer, William Kretschmer +1
We give a pair of algorithms that efficiently learn a quantum state prepared by Clifford gates and non-Clifford gates. Specifically, for an -qubit state …