Sign-curing local Hamiltonians: termwise versus global stoquasticity and the use of Clifford transformations

07/23/2020
by   Marios Ioannou, et al.
0

We elucidate the distinction between global and termwise stoquasticity for local Hamiltonians and prove several complexity results. We prove coNP-hardness of deciding global stoquasticity in a fixed basis and Σ_2^p-hardness of deciding global stoquasticity under single-qubit transformations. We expand the class of sign-curing transformations by showing how Clifford transformations can sign-cure a class of disordered 1D XYZ Hamiltonians.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/06/2020

StoqMA vs. MA: the power of error reduction

StoqMA characterizes the computational hardness of stoquastic local Hami...
research
06/25/2021

Complexity of Deciding Syntactic Equivalence up to Renaming for Term Rewriting Systems (Extended Version)

Inspired by questions from program transformations, eight notions of iso...
research
03/17/2021

Accretive Computation of Global Transformations of Graphs

The framework of global transformations aims at describing synchronous r...
research
10/12/2022

About some generalizations trigonometric splines

Methods of constructing trigonometric fundamental splines with constant ...
research
10/14/2021

Sign and Relevance learning

Standard models of biologically realistic, or inspired, reinforcement le...
research
05/21/2022

Equivariant Mesh Attention Networks

Equivariance to symmetries has proven to be a powerful inductive bias in...
research
04/07/2013

Facial transformations of ancient portraits: the face of Caesar

Some software solutions used to obtain the facial transformations can he...

Please sign up or login with your details

Forgot password? Click here to reset