33 citations · 43 across the 6 of their papers we have counts for
5 papers · 1 filter
Higher moment theory and learnability of bosonic states
Joseph T. Iosue, Yu-Xin Wang, Ishaun Datta +4
We present a sample- and time-efficient algorithm to learn any bosonic Fock state acted upon by an arbitrary Gaussian unitary. As a special case, this algorithm efficiently learns…
Exponential improvements to the average-case hardness of BosonSampling
Adam Bouland, Ishaun Datta, Bill Fefferman +1
BosonSampling and Random Circuit Sampling are important both as a theoretical tool for separating quantum and classical computation, and as an experimental means of demonstrating q…
Complexity-theoretic foundations of BosonSampling with a linear number of modes
Adam Bouland, Daniel Brod, Ishaun Datta +4
BosonSampling is the leading candidate for demonstrating quantum computational advantage in photonic systems. While we have recently seen many impressive experimental demonstration…
Going Beyond Gadgets: The Importance of Scalability for Analogue Quantum Simulators
Dylan Harley, Ishaun Datta, Frederik Ravn Klausen +4
Quantum hardware has the potential to efficiently solve computationally difficult problems in physics and chemistry to reap enormous practical rewards. Analogue quantum simulation…
Pseudo-dimension of quantum circuits
Matthias C. Caro, Ishaun Datta
We characterize the expressive power of quantum circuits with the pseudo-dimension, a measure of complexity for probabilistic concept classes. We prove pseudo-dimension bounds on t…