1 code implementation • 12 Sep 2019 • Sevag Gharibian, Stephen Piddock, Justin Yirka
Perhaps surprisingly, [Ambainis, CCC 2014] showed that the related, but arguably more natural, problem of simulating local measurements on ground states of local Hamiltonians (APX-SIM) is likely harder than QMA.
Quantum Physics Computational Complexity
1 code implementation • 28 May 2018 • Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka
The polynomial-time hierarchy ($\mathrm{PH}$) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as $\mathrm{PH}$ does not collapse).
Computational Complexity Quantum Physics 68Q12, 68Q15, 81P68, 03D15 F.1.3
1 code implementation • 17 Jun 2016 • Sevag Gharibian, Justin Yirka
An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians.
Quantum Physics Strongly Correlated Electrons Computational Complexity
