Papers
Topics
Authors
Recent
Search
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 StoqMA\textbf{StoqMA}-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 coNP\textbf{coNP}-hardness of deciding global stoquasticity in a fixed basis and Σ2<sup>p\Sigma_2<sup>p-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 XYZXYZ Hamiltonians.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.