Does provable absence of barren plateaus imply classical simulability?
APA
(2025). Does provable absence of barren plateaus imply classical simulability?. Perimeter Institute. https://pirsa.org/25030071
MLA
Does provable absence of barren plateaus imply classical simulability?. Perimeter Institute, Mar. 28, 2025, https://pirsa.org/25030071
BibTex
@misc{ pirsa_PIRSA:25030071, doi = {10.48660/25030071}, url = {https://pirsa.org/25030071}, author = {}, keywords = {Other}, language = {en}, title = {Does provable absence of barren plateaus imply classical simulability?}, publisher = {Perimeter Institute}, year = {2025}, month = {mar}, note = {PIRSA:25030071 see, \url{https://pirsa.org}} }
Abstract
A large amount of effort has recently been put into understanding the barren plateau phenomenon. In this perspective talk, we face the increasingly loud elephant in the room and ask a question that has been hinted at by many but not explicitly addressed: Can the structure that allows one to avoid barren plateaus also be leveraged to efficiently simulate the loss classically? We present a case-by-case argument that commonly used models with provable absence of barren plateaus are also in a sense classically simulable, provided that one can collect some classical data from quantum devices during an initial data acquisition phase. This follows from the observation that barren plateaus result from a curse of dimensionality, and that current approaches for solving them end up encoding the problem into some small, classically simulable, subspaces. We end by discussing caveats in our arguments including the limitations of average case arguments, the role of smart initializations, models that fall outside our assumptions, the potential for provably superpolynomial advantages and the possibility that, once larger devices become available, parametrized quantum circuits could heuristically outperform our analytic expectations.