4 papers
Sampling hard circuits with verifiably high fidelity
Simon Martiel, Jay-U Chung, Alireza Seif +6
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…
Peaked quantum advantage using error correction
Abhinav Deshpande, Bill Fefferman, Soumik Ghosh +2
A key issue of current quantum advantage experiments is that their verification requires a full classical simulation of the ideal computation. This limits the regime in which the e…
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…