05805nas a2200145 4500008004100000245004900041210004900090260001500139520537700154100002305531700002005554700002305574700002505597856003705622 2017 eng d00aComplexity of sampling as an order parameter0 aComplexity of sampling as an order parameter c2017/03/153 a
We consider the classical complexity of approximately simulating time evolution under spatially local quadratic bosonic Hamiltonians for time t. We obtain upper and lower bounds on the scaling of twith the number of bosons, n, for which simulation, cast as a sampling problem, is classically efficient and provably hard, respectively. We view these results in the light of classifying phases of physical systems based on parameters in the Hamiltonian and conjecture a link to dynamical phase transitions. In doing so, we combine ideas from mathematical physics and computational complexity to gain insight into the behavior of condensed matter systems.
1 aDeshpande, Abhinav1 aFefferman, Bill1 aFoss-Feig, Michael1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1703.05332