Kavli Affiliate: Birgitta Whaley | 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 are shown to be universal for quantum computation under post-selection, and […]
Continue.. Exponential quantum speedups for near-term molecular electronic structure methods