2000 character limit reached
Termwise versus globally stoquastic local Hamiltonians: questions of complexity and sign-curing
Published 23 Jul 2020 in quant-ph and cs.CC | (2007.11964v2)
Abstract: We elucidate the distinction between global and termwise stoquasticity for local Hamiltonians and prove several complexity results. We show that the stoquastic local Hamiltonian problem is -complete even for globally stoquastic Hamiltonians. We study the complexity of deciding whether a local Hamiltonian is globally stoquastic or not. In particular, we prove -hardness of deciding global stoquasticity in a fixed basis and -hardness of deciding global stoquasticity under single-qubit transformations. As a last result, we expand the class of sign-curing transformations by showing how Clifford transformations can sign-cure a class of disordered 1D Hamiltonians.
Paper Prompts
Sign up for free to create and run prompts on this paper.