63 citations · 121 across the 12 of their papers we have counts for
13 papers
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…
Hamiltonian Locality Testing via Trotterized Postselection
John Kallaugher, Daniel Liang
The (tolerant) Hamiltonian locality testing problem, introduced in [Bluhm, Caro,Oufkir `24], is to determine whether a Hamiltonian is -close to being -local (…
Tolerant Testing of Stabilizer States with Mixed State Inputs
Vishnu Iyer, Daniel Liang
We study the problem of tolerant testing of stabilizer states. In particular, we give the first such algorithm that accepts mixed state inputs. Formally, given a mixed state th…
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,…