Kavli Affiliate: Birgitta Whaley | First 5 Authors: Oskar Leimkuhler, Oskar Leimkuhler, , , | Summary: We prove classical simulation hardness, under the generalized $mathsfPneqmathsfNP$ conjecture, for quantum circuit families with applications in near-term chemical ground state estimation. The proof exploits a connection to particle number conserving matchgate circuits with fermionic magic state inputs, which […]
Continue.. Exponential quantum speedups in quantum chemistry with linear depth