On the hardness of learning ground state entanglement of geometrically
local Hamiltonians
On the hardness of learning ground state entanglement of geometrically
local Hamiltonians
Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In this work we study the computational complexity of this problem, given the Hamiltonian as input. Our main result is that to show it is cryptographically hard to determine if the ground state …