7 citations · 11 across the 7 of their papers we have counts for
8 papers
Mildly-Interacting Fermionic Unitaries are Efficiently Learnable
Vishnu Iyer
Recent work has shown that one can efficiently learn fermionic Gaussian unitaries, also commonly known as nearest-neighbor matchcircuits or non-interacting fermionic unitaries. How…
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…
PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements
Scott Aaronson, Sabee Grewal, Vishnu Iyer +2
We define and study a variant of QMA (Quantum Merlin Arthur) in which Arthur can make multiple non-collapsing measurements to Merlin's witness state, in addition to ordinary collap…
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 …
Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
Sabee Grewal, Vishnu Iyer, William Kretschmer +1
We show that quantum states with "low stabilizer complexity" can be efficiently distinguished from Haar-random. Specifically, given an -qubit pure state , we give an…