247 citations · 988 across the 28 of their papers we have counts for
28 papers
Sampling hard circuits with verifiably high fidelity
Simon Martiel, Jay-U Chung, Alireza Seif +9
Sampling-based proposals are prominent candidates for demonstrating quantum computations beyond the reach of classical supercomputers. However, it has been difficult to combine the…
Classical simulation of noisy random circuits from exponential decay of correlation
Su-un Lee, Soumik Ghosh, Changhun Oh +3
We study the classical simulability of noisy random quantum circuits under general noise models. While various classical algorithms for simulating noisy random circuits have been p…
Efficiently verifiable quantum advantage using error correction
Abhinav Deshpande, Bill Fefferman, Soumik Ghosh +3
A key issue with existing quantum advantage experiments is that their verification requires exponential classical time. In this work, we address this challenge by designing a new p…
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…
On the complexity of sampling from shallow Brownian circuits
Gregory Bentsen, Bill Fefferman, Soumik Ghosh +2
While many statistical properties of deep random quantum circuits can be deduced, often rigorously and other times heuristically, by an approximation to global Haar-random unitarie…
Classical algorithm for simulating experimental Gaussian boson sampling
Changhun Oh, Minzhao Liu, Yuri Alexeev +2
Gaussian boson sampling is a promising candidate for showing experimental quantum advantage. While there is evidence that noiseless Gaussian boson sampling is hard to efficiently s…